The following pages link to UFO (Q21551):
Displaying 18 items.
- SMT-based model checking for recursive programs (Q518396) (← links)
- Leveraging compiler intermediate representation for multi- and cross-language verification (Q784116) (← links)
- Deciding local theory extensions via E-matching (Q1702888) (← links)
- A unifying view on SMT-based software verification (Q1703012) (← links)
- Tools and algorithms for the construction and analysis of systems. 19th international conference, TACAS 2013, held as part of the European joint conferences on theory and practice of software, ETAPS 2013, Rome, Italy, March 16--24, 2013. Proceedings (Q1935964) (← links)
- Exploiting partial variable assignment in interpolation-based model checking (Q2009611) (← links)
- Model checking boot code from AWS data centers (Q2050104) (← links)
- TOrPEDO : witnessing model correctness with topological proofs (Q2065548) (← links)
- Efficient strategies for CEGAR-based model checking (Q2209549) (← links)
- Learning inductive invariants by sampling from frequency distributions (Q2225478) (← links)
- Automatically proving termination and memory safety for programs with pointer arithmetic (Q2362494) (← links)
- Block-Wise Abstract Interpretation by Combining Abstract Domains with SMT (Q2961574) (← links)
- Predicate Abstraction for Program Verification (Q3176373) (← links)
- Automated Discovery of Simulation Between Programs (Q3460090) (← links)
- Horn clauses as an intermediate representation for program analysis and transformation (Q4592995) (← links)
- Integrating Topological Proofs with Model Checking to Instrument Iterative Design (Q5039527) (← links)
- Loop Invariants from Counterexamples (Q5233241) (← links)
- The MathSAT5 SMT Solver (Q5326318) (← links)
