Sciweavers

35 search results - page 4 / 7
» Towards a Model-Checker for Counter Systems
Sort
View
CAV
2005
Springer
127views Hardware» more  CAV 2005»
14 years 2 months ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala
KBSE
2000
IEEE
14 years 28 days ago
Model Checking Programs
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it eas...
Willem Visser, Klaus Havelund, Guillaume P. Brat, ...
ASE
2008
102views more  ASE 2008»
13 years 8 months ago
Model driven code checking
Model checkers were originally developed to support the formal verification of high-level design models of distributed system designs. Over the years, they have become unmatched in...
Gerard J. Holzmann, Rajeev Joshi, Alex Groce
LOGCOM
2008
110views more  LOGCOM 2008»
13 years 8 months ago
Sum and Product in Dynamic Epistemic Logic
The Sum-and-Product riddle was first published in [Fre69]. We provide an overview on the history of the dissemination of this riddle through the academic and puzzle-math community...
Hans P. van Ditmarsch, Ji Ruan, Rineke Verbrugge
ATAL
2009
Springer
13 years 9 months ago
Towards a Logical Model of Social Agreement for Agent Societies
Multi-agent systems (MASs), comprised of autonomous entities with the aim to cooperate to reach a common goal, may be viewed as computational models of distributed complex systems ...
Emiliano Lorini, Mario Verdicchio