Proof simplification for model generation and its applications
From MaRDI portal
Recommendations
- Proof simplification in the framework of coherent logic
- Model elimination with simplification and its application to software verification
- Proof simplification and automated theorem proving
- Toward mechanical methods for streamlining proofs
- Simplification of proof procedures based on the path condition concepts
Cited in
(11)- Simplification of proof procedures based on the path condition concepts
- Simplify: a theorem prover for program checking
- On the convergence of reduction-based and model-based methods in proof theory
- Flexible heuristics for simplification with conditional lemmas by marking formulas as forbidden, mandatory, obligatory, and generous
- Proof simplification in the framework of coherent logic
- An Implementation of the Model Elimination Proof Procedure
- Model elimination with simplification and its application to software verification
- Proof simplification and automated theorem proving
- ILF-SETHEO
- Toward mechanical methods for streamlining proofs
- A versatile, sound tool for simplifying definitions
This page was built for publication: Proof simplification for model generation and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2767011)