• Typestate analysis, sometimes called protocol analysis, is a form of program analysis employed in programming languages. It is most commonly applied to...
    14 KB (1,834 words) - 23:05, 17 February 2024
  • In computer science, static program analysis (also known as static analysis or static simulation) is the analysis of computer programs performed without...
    17 KB (1,864 words) - 01:44, 13 April 2024
  • Thumbnail for Design by contract
    derivation Program refinement Strong typing Test-driven development Typestate analysis Meyer, Bertrand: Design by Contract, Technical Report TR-EI-12/CO...
    21 KB (2,108 words) - 16:09, 6 May 2024
  • Hermes (programming language) (category Static program analysis tools)
    Representation-independent data aggregates called tables. Lack of pointers. It used typestate analysis to check variables transitions errors, to rule out some semantically...
    4 KB (367 words) - 02:16, 29 January 2023
  • In computer science, program analysis is the process of automatically analyzing the behavior of computer programs regarding a property such as correctness...
    10 KB (1,310 words) - 02:47, 16 March 2023
  • In compiler theory, dependence analysis produces execution-order constraints between statements/instructions. Broadly speaking, a statement S2 depends...
    4 KB (564 words) - 13:04, 22 January 2024
  • possible histories. Side effects play an important role in the design and analysis of programming languages. The degree to which side effects are used depends...
    10 KB (1,083 words) - 18:51, 24 April 2024
  • has been included in comparatively few tools in the automatic program analysis category (and none mentioned in the next section). O'Hearn and Brookes...
    28 KB (3,641 words) - 09:42, 19 March 2024
  • LLVM toolchain. E-graphs have been applied to several problems in program analysis, including fuzzing, abstract interpretation, and library learning. (Willsey...
    13 KB (1,895 words) - 15:11, 18 March 2024
  • Model checking Pointer Shape Symbolic execution Termination Type systems Typestate Dynamic Data-flow Taint tracking Concolic execution Fuzzing Invariant...
    13 KB (1,738 words) - 16:47, 23 March 2024
  • Thumbnail for Model checking
    model checking tools Partial order reduction Program analysis (computer science) Static code analysis For convenience, the example properties are paraphrased...
    25 KB (2,717 words) - 08:36, 19 February 2024
  • significant impact on fields including software verification, program analysis, constraint solving, artificial intelligence, electronic design automation...
    29 KB (3,558 words) - 15:26, 22 December 2023
  • Abstract interpretation (category Program analysis)
    performing all the calculations. Its main concrete application is formal static analysis, the automatic extraction of information about the possible executions...
    24 KB (2,924 words) - 16:16, 17 April 2024
  • Path explosion (category Program analysis)
    analyses, including fuzzing, symbolic execution, and path-sensitive static analysis. Path explosion refers to the fact that the number of control-flow paths...
    3 KB (303 words) - 18:53, 12 August 2023
  • Polyvariance (category Program analysis)
    In program analysis, a polyvariant or context-sensitive analysis (as opposed to a monovariant or context-insensitive analysis) analyzes each function multiple...
    2 KB (215 words) - 15:36, 8 August 2023
  • Program slicing (category Program analysis)
    applications of slicing include software maintenance, optimization, program analysis, and information flow control. Slicing techniques have been seeing a rapid...
    10 KB (1,417 words) - 16:13, 8 August 2023
  • Hyperproperty (category Program analysis)
    Kim Guldstrand (eds.). Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science. Vol. 12651. Cham: Springer...
    8 KB (958 words) - 20:57, 25 January 2024
  • Hoare logic (category Static program analysis)
    verification Loop invariant Predicate transformer semantics Static program analysis Hoare originally wrote " P { C } Q {\displaystyle P\{C\}Q} " rather than...
    22 KB (3,643 words) - 22:35, 5 April 2024