Sciweavers

Share
ASE
2004
117views more  ASE 2004»
8 years 10 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 ...
ENTCS
2007
119views more  ENTCS 2007»
8 years 10 months ago
Interpolant Learning and Reuse in SAT-Based Model Checking
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
João Marques-Silva
ENTCS
2006
134views more  ENTCS 2006»
8 years 10 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening
GG
2010
Springer
8 years 10 months ago
A False History of True Concurrency: From Petri to Tools
I briefly review the history of the unfolding approach to model checking. Carl Adam Petri passed away on July 2, 2010. I learnt about his death three days later, a few hours after ...
Javier Esparza
ECAI
2010
Springer
8 years 11 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
ATAL
2010
Springer
8 years 11 months ago
Distributed BDD-based BMC for the verification of multi-agent systems
We present a method of distributed model checking of multiagent systems specified by a branching-time temporal-epistemic logic. We introduce a serial algorithm, central to the dis...
Andrew V. Jones, Alessio Lomuscio
IWFM
2000
107views Formal Methods» more  IWFM 2000»
8 years 11 months ago
A Comparison of Three Model Checkers Applied to a Distributed Database Problem
ct Increasingly, model checking is being applied to more abstract problem domains than the traditional protocol analysis. The extent to which such an approach is able to provide us...
A. J. Currie
NSDI
2004
8 years 11 months ago
Model Checking Large Network Protocol Implementations
Network protocols must work. The effects of protocol specification or implementation errors range from reduced performance, to security breaches, to bringing down entire networks....
Madanlal Musuvathi, Dawson R. Engler
I3E
2001
196views Business» more  I3E 2001»
8 years 11 months ago
Security Modelling for Electronic Commerce: The Common Electronic Purse Specifications
: Designing security-critical systems correctly is very difficult. We present work on software engineering of security critical systems, supported by the CASE tool AUTOFOCUS. Secur...
Jan Jürjens, Guido Wimmel
CASCON
2001
115views Education» more  CASCON 2001»
8 years 11 months ago
Lightweight reasoning about program correctness
Automated verification tools vary widely in the types of properties they are able to analyze, the complexity of their algorithms, and the amount of necessary user involvement. In ...
Marsha Chechik, Wei Ding
books