Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
From MaRDI portal
Publication:3608784
DOI10.1007/978-3-540-73595-3_25zbMATH Open1213.68378OpenAlexW1495032777MaRDI QIDQ3608784FDOQ3608784
Daniele Zucchelli, Silvio Ranise, Enrica Nicolini, Silvio Ghilardi
Publication date: 6 March 2009
Published in: Automated Deduction – CADE-21 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73595-3_25
Recommendations
- scientific article; zbMATH DE number 1499079
- scientific article; zbMATH DE number 1263840
- A decidability result for the model checking of infinite-state systems
- scientific article; zbMATH DE number 2102702
- Decidability of model checking for infinite-state concurrent systems
- Bounded model checking of infinite state systems
- Computer Aided Verification
- Equivalence-checking with infinite-state systems: techniques and results
- Equivalence-checking on infinite-state systems: Techniques and results
Cited In (11)
- CTL* model checking for data-aware dynamic systems with arithmetic
- SMT-based scenario verification for hybrid systems
- A decidability result for the model checking of infinite-state systems
- Title not available (Why is that?)
- IPL: an integration property language for multi-model cyber-physical systems
- Hierarchical Reasoning for the Verification of Parametric Systems
- Model Checking Parameterised Multi-token Systems via the Composition Method
- Title not available (Why is that?)
- Rewriting modulo SMT and open system analysis
- SMT-based satisfiability of first-order LTL with event freezing functions and metric operators
- Satisfiability Modulo Theories
This page was built for publication: Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608784)
