The following pages link to Refinement of Trace Abstraction (Q3392921):
Displaying 12 items.
- Horn clause verification with convex polyhedral abstraction and tree automata-based refinement (Q681335) (← links)
- A tree-based approach to data flow proofs (Q1629956) (← links)
- A unifying view on SMT-based software verification (Q1703012) (← links)
- Loop verification with invariants and contracts (Q2152642) (← links)
- Verifying the correctness of distributed systems via mergeable parallelism (Q2154028) (← links)
- Unbounded procedure summaries from bounded environments (Q2234080) (← links)
- Automated Program Verification (Q2799160) (← links)
- Tree dimension in verification of constrained Horn clauses (Q4644355) (← links)
- Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction* (Q4989166) (← links)
- What’s Decidable About Program Verification Modulo Axioms? (Q5164172) (← links)
- Proving Safety with Trace Automata and Bounded Model Checking (Q5206955) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
