Software model checking
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
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 …
Satisfiability modulo theories
Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …
SMT-based bounded model checking for embedded ANSI-C software
Propositional bounded model checking has been applied successfully to verify embedded
software, but remains limited by increasing propositional formula sizes and the loss of high …
software, but remains limited by increasing propositional formula sizes and the loss of high …
Supporting task migration in multi-processor systems-on-chip: a feasibility study
S Bertozzi, A Acquaviva, D Bertozzi… - Proceedings of the …, 2006 - ieeexplore.ieee.org
With the advent of multi-processor systems-on-chip, the interest in process migration is
again on the rise both in research and in product development. New challenges associated …
again on the rise both in research and in product development. New challenges associated …
Backward reachability of array-based systems by SMT solving: Termination and invariant synthesis
The safety of infinite state systems can be checked by a backward reachability procedure.
For certain classes of systems, it is possible to prove the termination of the procedure and …
For certain classes of systems, it is possible to prove the termination of the procedure and …
Satisfiability modulo theories
Applications in artificial intelligence, formal verification, and other areas have greatly
benefited from the recent advances in SAT. It is often the case, however, that applications in …
benefited from the recent advances in SAT. It is often the case, however, that applications in …
Scaling up the formal verification of Lustre programs with SMT-based techniques
G Hagen, C Tinelli - 2008 Formal Methods in Computer-Aided …, 2008 - ieeexplore.ieee.org
We present a general approach for verifying safety properties of Lustre programs
automatically. Key aspects of the approach are the choice of an expressive first-order logic …
automatically. Key aspects of the approach are the choice of an expressive first-order logic …
SMT proof checking using a logical framework
Producing and checking proofs from SMT solvers is currently the most feasible method for
achieving high confidence in the correctness of solver results. The diversity of solvers and …
achieving high confidence in the correctness of solver results. The diversity of solvers and …
Accelerating high-level bounded model checking
SAT-based Bounded Model Checking (BMC) has been found promising in finding deep
bugs in industry designs and scaling well with design sizes. However, it has limitations due …
bugs in industry designs and scaling well with design sizes. However, it has limitations due …