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 …

ViBe: a powerful random technique to estimate the background in video sequences

O Barnich… - 2009 IEEE international …, 2009 - ieeexplore.ieee.org
Background subtraction is a crucial step in many automatic video content analysis
applications. While numerous acceptable techniques have been proposed so far for …

A systematic literature review on counterexample explanation

AP Kaleeswaran, A Nordmann, T Vogel… - Information and Software …, 2022 - Elsevier
Context: Safety is of paramount importance for cyber–physical systems in domains such as
automotive, robotics, and avionics. Formal methods such as model checking are one way to …

Directed symbolic execution

KK Ma, K Yit Phang, JS Foster, M Hicks - Static Analysis: 18th International …, 2011 - Springer
In this paper, we study the problem of automatically finding program executions that reach a
particular target line. This problem arises in many debugging scenarios; for example, a …

[책][B] Heuristic search: theory and applications

S Edelkamp, S Schrödl - 2011 - books.google.com
Search has been vital to artificial intelligence from the very beginning as a core technique in
problem solving. The authors present a thorough overview of heuristic search with a balance …

Towards a framework for certification of reliable autonomous systems

M Fisher, V Mascardi, KY Rozier, BH Schlingloff… - Autonomous Agents and …, 2021 - Springer
A computational system is called autonomous if it is able to make its own decisions, or take
its own actions, without human supervision or control. The capability and spread of such …

Statically-directed dynamic automated test generation

D Babić, L Martignoni, S McCamant… - Proceedings of the 2011 …, 2011 - dl.acm.org
We present a new technique for exploiting static analysis to guide dynamic automated test
generation for binary programs, prioritizing the paths to be explored. Our technique is a …

Engraft: Enclave-guarded Raft on Byzantine faulty nodes

W Wang, S Deng, J Niu, MK Reiter… - Proceedings of the 2022 …, 2022 - dl.acm.org
This paper presents the first critical analysis of building highly secure, performant, and
confidential Byzantine fault-tolerant (BFT) consensus by integrating off-the-shelf crash fault …

Quantitative verification: models techniques and tools

M Kwiatkowska - Proceedings of the the 6th joint meeting of the …, 2007 - dl.acm.org
Automated verification is a technique for establishing if certain properties, usually expressed
in temporal logic, hold for a system model. The model can be defined using a high-level …

A note on on-the-fly verification algorithms

S Schwoon, J Esparza - International Conference on Tools and Algorithms …, 2005 - Springer
The automata-theoretic approach to LTL verification relies on an algorithm for finding
accepting cycles in a Büchi automaton. Explicit-state model checkers typically construct the …