SeaHorn

swMATH18274MaRDI QIDQ30117FDOQ30117

Author name not available (Why is that?)

Cited In (26)

• Higher-order quantifier elimination, counter simulations and fault-tolerant systems
• Generalized rewrite theories, coherence completion, and symbolic methods
• Regression verification for unbalanced recursive functions
• Constraint-based relational verification
• Concolic Testing in CLP
• Code2Inv: a deep learning framework for program verification
• Automatic synthesis of logical models for order-sorted first-order theories
• Efficient Information-Flow Verification Under Speculative Execution
• AUSPICE-R: Automatic Safety-Property Proofs for Realistic Features in Machine Code
• An iterative approach to precondition inference using constrained Horn clauses
• Data abstraction: a general framework to handle program verification of data structures
• Compositional verification of smart contracts through communication abstraction
• Loop verification with invariants and contracts
• Title not available (Why is that?)
• Title not available (Why is that?)
• Horn Clause Solvers for Program Verification
• An Abstract Domain of Uninterpreted Functions
• RustHorn: CHC-Based Verification for Rust Programs
• Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays
• Leveraging compiler intermediate representation for multi- and cross-language verification
• Partitioned Memory Models for Program Analysis
• A unifying view on SMT-based software verification
• Relational program reasoning using compiler IR
• Incremental and Modular Context-sensitive Analysis
• Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
• Software Verification with PDR: An Implementation of the State of the Art

This page was built for software: SeaHorn