Automating soundness proofs
From MaRDI portal
Recommendations
Cites work
- Finite axiom systems for testing preorder and De Simone process languages
- Foundations of Software Science and Computational Structures
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 48157 (Why is no real title available?)
- scientific article; zbMATH DE number 2086418 (Why is no real title available?)
- scientific article; zbMATH DE number 3333259 (Why is no real title available?)
- Isabelle. A generic theorem prover
- Isabelle/HOL. A proof assistant for higher-order logic
- Process Algebra
- Structured operational semantics and bisimulation as a congruence
- The meaning of negative premises in transition system specifications
- The origins of structural operational semantics
- Untersuchungen über das logische Schliessen. I
- Using a generalisation critic to find bisimulations for coinductive proofs
Cited in
(6)- Exploiting algebraic laws to improve mechanized axiomatizations
- Proving the validity of equations in GSOS languages using rule-matching bisimilarity
- scientific article; zbMATH DE number 1980941 (Why is no real title available?)
- scientific article; zbMATH DE number 1748586 (Why is no real title available?)
- How to make ad hoc proof automation less ad hoc
- Improving automation for higher-order proof steps
This page was built for publication: Automating soundness proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2810691)