Keyphrases
Abstraction Refinement
30%
Algebraic Analysis
30%
Alternating Automata
30%
Arithmetic Games
30%
Automated Reasoning Tools
15%
Automated Verification
67%
Automatic Program
60%
Benchmark Suite
30%
Bisimulation
15%
Bit Vector
30%
Boolean Abstraction
30%
Boolean Operation
15%
Boolean Programming
30%
Closed-form Representation
15%
Combinatorial Inference
30%
Compositional Verification
15%
Computational Geometry
30%
Concurrent Programs
45%
Consequence Finding
30%
Consistency Analysis
60%
Constraint Solver
60%
Control Module
60%
Convex Hull Algorithm
30%
Correctness Properties
30%
Counting Argument
60%
Data Dependence Analysis
30%
Data Flow Analysis
20%
Data Flow Graph
45%
Data Module
60%
Data Structure Invariants
30%
Dataflow Model
20%
Decidable Model
15%
Decision-dependent Uncertainty
30%
Discrete Decisions
60%
Escher
30%
Feedback Loop
15%
Finite Sets
22%
Fixpoint
30%
For Loop
30%
Geometric Algorithms
30%
Global Variables
30%
Heap-manipulating Programs
15%
Hoare Triples
45%
Impedance Mismatch
19%
Imperative Programs
30%
Individual Choice
30%
Inductive Capacity
30%
Infinite State
30%
Less Is More
30%
Linear Arithmetic
30%
Linear Integer Arithmetic
30%
Linear Transition
30%
Linux Driver
15%
Local Variables
30%
Location Algorithm
30%
Loop Summarization
30%
Modular Reasoning
60%
Monotone Procedure
30%
Multithreaded Programs
45%
Nested Locks
30%
Network Snapshot
22%
Non-deterministic
30%
Number of Threads
22%
Numerical Invariants
37%
Numerical Precision
30%
Parallelization
30%
Parameterized Code
30%
Point Location
30%
Polynomial Ideals
30%
Polynomial Maps
20%
Program Analysis
34%
Program Execution
49%
Program Invariants
30%
Program Tracing
30%
Proof System
15%
Quantified Formulas
15%
Quantifier Elimination
15%
Rational Arithmetic
30%
Reachability Games
20%
Real Arithmetic
20%
Recurrence Quantification Analysis
60%
Recurrence Relations
30%
Recursive Programs
30%
Satisfiability Modulo Theories
45%
Sequential Data
20%
Sequential Programs
17%
SMT Solving
15%
Solvable Polynomials
30%
State Invariant
15%
Strategy Improvement
30%
Structure Embedding
30%
Succinctness
15%
Symbolic Automata
15%
Symbolic Optimisations
60%
Syntactic Paths
20%
Triangulation
30%
Two-module
30%
Vector Addition Systems
30%
Vector Array
15%
Verification Method
15%
Computer Science
Abstract Interpretation
22%
Abstract Machine
30%
Abstract Method
15%
Analysis Technique
15%
Annotation
5%
Binary Tree
30%
Bit Vector
30%
Boolean Connective
15%
Boolean Operation
15%
Combinatorial Problem
5%
Computational Geometry
30%
Concurrent Program
100%
Constraint Solver
60%
context-free language
30%
Context-Sensitive Analysis
15%
Control-Flow Graph
10%
Correctness Proofs
21%
Data Dependency
19%
Data Flow Graph
60%
Data Flow Model
20%
Data Invariant
90%
Data Manipulation
30%
Data-Flow Analysis
20%
Decision-Making
30%
Device Driver
30%
Dynamical System
30%
Effective Method
9%
Eigenvalue
15%
Execution Thread
10%
Exponential Explosion
10%
Feedback Loop
30%
Fixed Points
30%
for Loop
44%
Formal Verification
30%
Fragment Program
7%
Functional Programming
15%
Global Variable
60%
Hoare Triple
45%
Impedance Mismatch
60%
Incomplete Algorithm
9%
Individual Decision
30%
Inference Rule
30%
Irrational Number
9%
Linear Constraint
30%
Linked List
30%
Liveness
30%
Liveness Property
30%
Local Variable
60%
Meet-over-All-Paths Solution
9%
Merge-Sort
30%
model checker
15%
Multiobjective
7%
Multithreaded Program
30%
Network Snapshot
30%
Nonlinear Behavior
15%
Objective Function
30%
Operating Procedure
9%
Optimization Algorithm
7%
Parallelism
30%
Path Expression
15%
Prenex Normal Form
15%
Program Analysis
67%
Program Execution
67%
Program Synthesis
7%
Program Trace
30%
Program Verification
15%
Proof System
15%
Quantifier Elimination
30%
Ranking Function
36%
Rational Vector
30%
Reasoning about Programs
60%
Recurrence Relation
30%
Recursive Program
30%
Regular Language
30%
Running Thread
7%
Satisfying Assignment
45%
Sequential Program
17%
Shared Resource
9%
Software Model
15%
Software Verification
15%
Speed-up
7%
Starting Point
7%
State Invariant
60%
Static Program Analysis
15%
Subgraph Isomorphism
30%
Termination Analysis
56%
Theorem Prover
15%
Threaded Program
39%
Transition System
22%
Tree Traversal
30%
Unknown Quantity
30%
Winning Strategy
15%
