Sciweavers

1463 search results - page 99 / 293
» Model Checking Implicit-Invocation Systems
Sort
View
ATAL
2008
Springer
15 years 3 months ago
A flexible framework for verifying agent programs
There is an increasing number of agent-oriented programming languages that have working interpreters and platforms, with significant progress in the quality of such platforms over...
Louise A. Dennis, Berndt Farwer, Rafael H. Bordini...
ICALP
2000
Springer
15 years 5 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
STTT
2008
86views more  STTT 2008»
15 years 1 months ago
Properties of state spaces and their applications
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large co...
Radek Pelánek
AADEBUG
2005
Springer
15 years 7 months ago
Specifying and checking component usage
One of today’s challenges is producing reliable software in the face of an increasing number of interacting components. Our system CHET lets developers define specifications des...
Steven P. Reiss
FAC
2008
139views more  FAC 2008»
15 years 1 months ago
Network invariants for real-time systems
We extend the approach of model checking parameterized networks of processes by means of network invariants to the setting of real-time systems. We introduce timed transition stru...
Olga Grinchtein, Martin Leucker