Sciweavers

460 search results - page 45 / 92
» Abstraction in model checking multi-agent systems
Sort
View
TOPNOC
2008
13 years 7 months ago
TAPAs: A Tool for the Analysis of Process Algebras
Process Algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties. TAPAs is a tool that can be used to...
Francesco Calzolai, Rocco De Nicola, Michele Loret...
MONTEREY
2007
Springer
14 years 1 months ago
Logic-Based Regulatory Conformance Checking
In this paper, we describe an approach to formally assess whether an organization conforms to a body of regulation. Conformance is cast as a model checking question where the regul...
Nikhil Dinesh, Aravind K. Joshi, Insup Lee, Oleg S...
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
13 years 5 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...
CADE
2010
Springer
13 years 8 months ago
MCMT: A Model Checker Modulo Theories
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
Silvio Ghilardi, Silvio Ranise
SIGSOFT
2007
ACM
14 years 8 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...