Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems

DOI10.1007/978-3-540-73595-3_25zbMath1213.68378OpenAlexW1495032777MaRDI QIDQ3608784

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (10)

Satisfiability Modulo Theories ⋮ Rewriting modulo SMT and open system analysis ⋮ SMT-based satisfiability of first-order LTL with event freezing functions and metric operators ⋮ A decidability result for the model checking of infinite-state systems ⋮ Unnamed Item ⋮ SMT-based scenario verification for hybrid systems ⋮ Hierarchical Reasoning for the Verification of Parametric Systems ⋮ IPL: an integration property language for multi-model cyber-physical systems ⋮ Model Checking Parameterised Multi-token Systems via the Composition Method ⋮ CTL* model checking for data-aware dynamic systems with arithmetic

This page was built for publication: Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems