Sciweavers

3909 search results - page 27 / 782
» Extreme Model Checking
Sort
View
EUROCAST
2007
Springer
131views Hardware» more  EUROCAST 2007»
15 years 1 months ago
Efficient Model Checking of Applications with Input/Output
Most non-trivial applications use some form of input/output (I/O), such as network communication. When model checking such an application, a simple state space exploration scheme i...
Cyrille Artho, Boris Zweimüller, Armin Biere,...
ATAL
2004
Springer
15 years 1 months ago
Verification of Multiagent Systems via Unbounded Model Checking
We present an approach to the problem of verification of epistemic properties of multi-agent systems by means of symbolic model checking. In particular, it is shown how to extend ...
Magdalena Kacprzak, Alessio Lomuscio, Wojciech Pen...
ASE
2004
117views more  ASE 2004»
14 years 9 months ago
Model Checking for Combined Logics with an Application to Mobile Systems
In this paper, we develop model checking procedures for three ways of combining (temporal) logics: temporalization, independent combination, and join. We prove that they are termin...
Massimo Franceschet, Angelo Montanari, Maarten de ...
LOGCOM
2002
100views more  LOGCOM 2002»
14 years 9 months ago
Model Checking Games for Branching Time Logics
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
Martin Lange, Colin Stirling
ASPDAC
2006
ACM
230views Hardware» more  ASPDAC 2006»
15 years 3 months ago
Statistical Bellman-Ford algorithm with an application to retiming
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...
Mongkol Ekpanyapong, Thaisiri Watewai, Sung Kyu Li...