The following pages link to Back to the future (Q3189836):
Displaying 19 items.
- Verification of heap manipulating programs with ordered data by extended forest automata (Q300414) (← links)
- Symbolic predictive analysis for concurrent programs (Q432146) (← links)
- Parametrized invariance for infinite state processes (Q493122) (← links)
- A shape graph logic and a shape system (Q744329) (← links)
- Decidable fragments of many-sorted logic (Q1041587) (← links)
- SGGS decision procedures (Q2096457) (← links)
- Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems (Q2408742) (← links)
- Invariants Synthesis over a Combined Domain for Automated Program Verification (Q2842643) (← links)
- Partitioned Memory Models for Program Analysis (Q2961587) (← links)
- A Logic-Based Framework for Reasoning about Composite Data Structures (Q3184673) (← links)
- Bounded Quantifier Instantiation for Checking Inductive Invariants (Q3303891) (← links)
- DKAL and Z3: A Logic Embedding Experiment (Q3586018) (← links)
- (Q4989410) (← links)
- Local Reasoning for Global Graph Properties (Q5041096) (← links)
- Decision Procedure for Entailment of Symbolic Heaps with Arrays (Q5055997) (← links)
- Complexity and Algorithms for Monomial and Clausal Predicate Abstraction (Q5191104) (← links)
- An Efficient Decision Procedure for Imperative Tree Data Structures (Q5200043) (← links)
- Complete instantiation-based interpolation (Q5890659) (← links)
- Distributed bounded model checking (Q6661747) (← links)
