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 …
A survey of automated techniques for formal software verification
V D'silva, D Kroening… - IEEE Transactions on …, 2008 - ieeexplore.ieee.org
The quality and the correctness of software are often the greatest concern in electronic
systems. Formal verification tools can provide a guarantee that a design is free of specific …
systems. Formal verification tools can provide a guarantee that a design is free of specific …
Temporal logics for hyperproperties
MR Clarkson, B Finkbeiner, M Koleini… - … 2014, Held as Part of the …, 2014 - Springer
Two new logics for verification of hyperproperties are proposed. Hyperproperties
characterize security policies, such as noninterference, as a property of sets of computation …
characterize security policies, such as noninterference, as a property of sets of computation …
SLAM and Static Driver Verifier: Technology transfer of formal methods inside Microsoft
The SLAM project originated in Microsoft Research in early 2000. Its goal was to
automatically check that a C program correctly uses the interface to an external library. The …
automatically check that a C program correctly uses the interface to an external library. The …
A decade of software model checking with SLAM
T Ball, V Levin, SK Rajamani - Communications of the ACM, 2011 - dl.acm.org
A decade of software model checking with SLAM Page 1 68 CoMMunICATIonS oF ThE ACM |
july 2011 | vol. 54 | no. 7 contributed articles LArGe-sCALe sOFtWAre DeVeLOpment is a …
july 2011 | vol. 54 | no. 7 contributed articles LArGe-sCALe sOFtWAre DeVeLOpment is a …
A survey of regular model checking
Regular model checking is being developed for algorithmic verification of several classes of
infinite-state systems whose configurations can be modeled as words over a finite alphabet …
infinite-state systems whose configurations can be modeled as words over a finite alphabet …
Sound, complete and scalable path-sensitive analysis
We present a new, precise technique for fully path-and context-sensitive program analysis.
Our technique exploits two observations: First, using quantified, recursive formulas, path-and …
Our technique exploits two observations: First, using quantified, recursive formulas, path-and …
Model checking LTL with regular valuations for pushdown systems
Recent works have proposed pushdown systems as a tool for analyzing programs with
(recursive) procedures, and the model-checking problem for LTL has received special …
(recursive) procedures, and the model-checking problem for LTL has received special …
Reducing context-bounded concurrent reachability to sequential reachability
We give a translation from concurrent programs to sequential programs that reduces the
context-bounded reachability problem in the concurrent program to a reachability problem in …
context-bounded reachability problem in the concurrent program to a reachability problem in …
Pushdown model checking for malware detection
The number of malware is growing extraordinarily fast. Therefore, it is important to have
efficient malware detectors. Malware writers try to obfuscate their code by different …
efficient malware detectors. Malware writers try to obfuscate their code by different …