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 …

Satisfiability solvers

CP Gomes, H Kautz, A Sabharwal, B Selman - Foundations of Artificial …, 2008 - Elsevier
Publisher Summary The past few years have seen enormous progress in the performance of
Boolean satisfiability (SAT) solvers. Despite the worst-case exponential run time of all known …

[图书][B] Formal methods for discrete-time dynamical systems

C Belta, B Yordanov, EA Gol - 2017 - Springer
In control theory, complex models of physical processes, such as systems of differential or
difference equations, are usually checked against simple specifications, such as stability …

Model checking

EM Clarke - Foundations of Software Technology and Theoretical …, 1997 - Springer
Abstract Model checking is an automatic technique for verifying finite-state reactive systems,
such as sequential circuit designs and communication protocols. Specifications are …

[图书][B] An introduction to multiagent systems

M Wooldridge - 2009 - books.google.com
The study of multi-agent systems (MAS) focuses on systems in which many intelligent agents
interact with each other. These agents are considered to be autonomous entities such as …

An extensible SAT-solver

N Eén, N Sörensson - International conference on theory and applications …, 2003 - Springer
In this article, we present a small, complete, and efficient SAT-solver in the style of conflict-
driven learning, as exemplified by Chaff. We aim to give sufficient details about …

Conflict-driven clause learning SAT solvers

J Marques-Silva, I Lynce, S Malik - Handbook of satisfiability, 2021 - ebooks.iospress.nl
One of the most important paradigm shifts in the use of SAT solvers for solving industrial
problems has been the introduction of clause learning. Clause learning entails adding a …

On the glucose SAT solver

G Audemard, L Simon - International Journal on Artificial …, 2018 - World Scientific
The set of novelties introduced with the SAT solver Glucose is now considered as a standard
for practical SAT solving. In this paper, we review the different strategies and technologies …

Counterexample-guided abstraction refinement

E Clarke, O Grumberg, S Jha, Y Lu, H Veith - … Chicago, IL, USA, July 15-19 …, 2000 - Springer
We present an automatic iterative abstraction-refinement methodology in which the initial
abstract model is generated by an automatic analysis of the control structures in the program …

[图书][B] Constraint processing

R Dechter - 2003 - books.google.com
This book provides a comprehensive and much needed introduction to the field by one of its
foremost experts. It is beautifully written and presents a unifying framework capturing a wide …