Software model checking
R Jhala, R Majumdar - ACM Computing Surveys (CSUR), 2009 - dl.acm.org
Software model checking Page 1 21 Software Model Checking RANJIT JHALA University of
California, San Diego and RUPAK MAJUMDAR University of California, Los Angeles We survey …
California, San Diego and RUPAK MAJUMDAR University of California, Los Angeles We survey …
Reactive modules
R Alur, TA Henzinger - Formal methods in system design, 1999 - Springer
We present a formal model for concurrent systems. The model represents synchronous and
asynchronous components in a uniform framework that supports compositional (assume …
asynchronous components in a uniform framework that supports compositional (assume …
Theory of latency-insensitive design
LP Carloni, KL McMillan… - … on computer-aided …, 2001 - ieeexplore.ieee.org
The theory of latency-insensitive design is presented as the foundation of a new correct-by-
construction methodology to design complex systems by assembling intellectual property …
construction methodology to design complex systems by assembling intellectual property …
Learning assumptions for compositional verification
JM Cobleigh, D Giannakopoulou… - … 2003 Held as Part of the …, 2003 - Springer
Compositional verification is a promising approach to addressing the state explosion
problem associated with model checking. One compositional technique advocates proving …
problem associated with model checking. One compositional technique advocates proving …
MOCHA: Modularity in model checking
MOCHA: Modularity in model checking Page 1 MOCHA: Modularity in Model Checking* R. Alur
l, TA Henzinger 2, EY.C. Mang 2, S. Qadeer 2, SK Rajamani z, and S. Tasiran 2 ! Computer & …
l, TA Henzinger 2, EY.C. Mang 2, S. Qadeer 2, SK Rajamani z, and S. Tasiran 2 ! Computer & …
Bebop: A symbolic model checker for boolean programs
T Ball, SK Rajamani - SPIN Model Checking and Software Verification: 7th …, 2000 - Springer
We present the design, implementation and empirical evaluation of Bebop—a symbolic
model checker for boolean programs. Bebop represents control flow explicitly, and sets of …
model checker for boolean programs. Bebop represents control flow explicitly, and sets of …
Modular fine-grained concurrency verification
V Vafeiadis - 2008 - cl.cam.ac.uk
Traditionally, concurrent data structures are protected by a single mutual exclusion lock so
that only one thread may access the data structure at any time. This coarse-grained …
that only one thread may access the data structure at any time. This coarse-grained …
Analysis of timed systems using time-abstracting bisimulations
S Tripakis, S Yovine - Formal Methods in System Design, 2001 - Springer
The objective of this paper is to show how verification of dense-time systems modeled as
timed automata can be effectively performed using untimed verification techniques. In that …
timed automata can be effectively performed using untimed verification techniques. In that …
Proof rules for automated compositional verification through learning
H Barringer, D Giannakopoulou, CS Pasareanu - SAVBS 2003, 2003 - ntrs.nasa.gov
Compositional proof systems not only enable the stepwise development of concurrent
processes but also provide a basis to alleviate the state explosion problem associated with …
processes but also provide a basis to alleviate the state explosion problem associated with …
Compositional abstraction and safety synthesis using overlapping symbolic models
In this paper, we develop a compositional approach to abstraction and safety synthesis for a
general class of discrete-time nonlinear systems. Our approach makes it possible to define a …
general class of discrete-time nonlinear systems. Our approach makes it possible to define a …