Sciweavers

189 search results - page 6 / 38
» Verifying Multi-agent Programs by Model Checking
Sort
View
SNPD
2008
13 years 9 months ago
Architecture-aware Partial Order Reduction to Accelerate Model Checking of Networked Programs
Testing cannot cover all execution schedules in concurrent software. Model checking, however, is capable of verifying the outcome of all possible executions. It has been applied s...
Cyrille Artho, Watcharin Leungwattanakit, Masami H...
VVEIS
2007
13 years 8 months ago
Checking Properties of Business Process Models with Logic Programming
Logic programming has been successfully used for reasoning about various kinds of models. However, in the area of business-process modeling it has not yet gained the attention it d...
Volker Gruhn, Ralf Laue
ICCD
2003
IEEE
98views Hardware» more  ICCD 2003»
14 years 4 months ago
Specifying and Verifying Systems with Multiple Clocks
Multiple clock domains are a challenge for hardware specification and verification. We present a method for specifying the relations between multiple clocks, and for modeling th...
Edmund M. Clarke, Daniel Kroening, Karen Yorav
POPL
2005
ACM
14 years 7 months ago
Dynamic partial-order reduction for model checking software
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
Cormac Flanagan, Patrice Godefroid
ATAL
2005
Springer
14 years 1 months ago
Bounded model checking for knowledge and real time
We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We show that the model checking problem is decidable, and we present an algorithm for TECTLK ...
Bozena Wozna, Alessio Lomuscio, Wojciech Penczek