Sciweavers

49 search results - page 2 / 10
» Abstraction and Modular Verification of Infinite-State React...
Sort
View
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
13 years 3 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...
TPHOL
1998
IEEE
13 years 9 months ago
Co-inductive Axiomatization of a Synchronous Language
Abstract. Over the last decade, the increasing demand for the validation of safety critical systems lead to the development of domain-specific programming languages (e.g. synchrono...
David Nowak, Jean-René Beauvais, Jean-Pierr...
CADE
2008
Springer
14 years 5 months ago
Towards SMT Model Checking of Array-Based Systems
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
POPL
2000
ACM
13 years 8 months ago
Modular Refinement of Hierarchic Reactive Machines
with existing analysis tools. Modular reasoning principles such as abstraction, compositional refinement, and assume-guarantee reasoning are well understood for architectural hiera...
Rajeev Alur, Radu Grosu