Constraint-based deductive model checking
From MaRDI portal
Cited in
(22)- Automatic software model checking via constraint logic
- Generalized rewrite theories, coherence completion, and symbolic methods
- Real-time verification techniques for untimed systems
- scientific article; zbMATH DE number 1617315 (Why is no real title available?)
- scientific article; zbMATH DE number 1615250 (Why is no real title available?)
- scientific article; zbMATH DE number 1696809 (Why is no real title available?)
- scientific article; zbMATH DE number 1696868 (Why is no real title available?)
- Program specialization for verifying infinite state systems: an experimental evaluation
- Rewriting modulo SMT and open system analysis
- scientific article; zbMATH DE number 1956554 (Why is no real title available?)
- scientific article; zbMATH DE number 2080049 (Why is no real title available?)
- scientific article; zbMATH DE number 2084712 (Why is no real title available?)
- scientific article; zbMATH DE number 2090523 (Why is no real title available?)
- scientific article; zbMATH DE number 1406234 (Why is no real title available?)
- Automated Technology for Verification and Analysis
- Automata, Languages and Programming
- Analysis and Transformation of Constrained Horn Clauses for Program Verification
- Constraint-based debugging in probabilistic model checking
- Temporal verification of programs via first-order fixpoint logic
- Artificial intelligence in biological modelling
- An overview of the HFL model checking project
- Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
This page was built for publication: Constraint-based deductive model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953447)