UFO

swMATH9570MaRDI QIDQ21551

No author found.

Described by source

• From Under-Approximations to Over-Approximations and Back

Related Items (18)

Automatically proving termination and memory safety for programs with pointer arithmetic ⋮ Integrating Topological Proofs with Model Checking to Instrument Iterative Design ⋮ Predicate Abstraction for Program Verification ⋮ Automated Discovery of Simulation Between Programs ⋮ The MathSAT5 SMT Solver ⋮ Horn clauses as an intermediate representation for program analysis and transformation ⋮ 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 ⋮ Block-Wise Abstract Interpretation by Combining Abstract Domains with SMT ⋮ Deciding local theory extensions via E-matching ⋮ A unifying view on SMT-based software verification ⋮ Efficient strategies for CEGAR-based model checking ⋮ Learning inductive invariants by sampling from frequency distributions ⋮ SMT-based model checking for recursive programs ⋮ Exploiting partial variable assignment in interpolation-based model checking ⋮ Model checking boot code from AWS data centers ⋮ TOrPEDO : witnessing model correctness with topological proofs ⋮ Loop Invariants from Counterexamples ⋮ Leveraging compiler intermediate representation for multi- and cross-language verification

This page was built for software: UFO