Sciweavers

1895 search results - page 172 / 379
» Using ATL for Checking Models
Sort
View
ICPP
1993
IEEE
15 years 10 months ago
A Unified Model for Concurrent Debugging
: Events are occurrence instances of actions. The thesis of this paper is that the use of “actions”, instead of events, greatly simplifies the problem of concurrent debugging....
S. I. Hyder, John Werth, James C. Browne
CONCUR
2009
Springer
16 years 18 days ago
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
Abstract. The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one pe...
Sergio Giro, Pedro R. D'Argenio, Luis María...
ECAI
2010
Springer
15 years 7 months ago
On the Verification of Very Expressive Temporal Properties of Non-terminating Golog Programs
Abstract. The agent programming language GOLOG and the underlying Situation Calculus have become popular means for the modelling and control of autonomous agents such as mobile rob...
Jens Claßen, Gerhard Lakemeyer
JSC
2010
100views more  JSC 2010»
15 years 24 days ago
An invariant-based approach to the verification of asynchronous parameterized networks
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
Igor V. Konnov, Vladimir A. Zakharov
TACAS
2007
Springer
141views Algorithms» more  TACAS 2007»
16 years 4 days ago
JPF-SE: A Symbolic Execution Extension to Java PathFinder
We present JPF–SE, an extension to the Java PathFinder Model Checking framework (JPF) that enables the symbolic execution of Java programs. JPF–SE uses JPF to generate and expl...
Saswat Anand, Corina S. Pasareanu, Willem Visser