CPBPV: a constraint-programming framework for bounded program verification
From MaRDI portal
Publication:968353
Recommendations
Cites work
- scientific article; zbMATH DE number 1670555 (Why is no real title available?)
- scientific article; zbMATH DE number 1701764 (Why is no real title available?)
- scientific article; zbMATH DE number 4162324 (Why is no real title available?)
- scientific article; zbMATH DE number 1956607 (Why is no real title available?)
- scientific article; zbMATH DE number 1406234 (Why is no real title available?)
- Abstraction Refinement of Linear Programs with Arrays
- Automatic software model checking via constraint logic
- Bounded model checking using satisfiability solving
- CPBPV: a constraint-programming framework for bounded program verification
- Challenges in Satisfiability Modulo Theories
- Computer Aided Verification
- Efficient SAT-based bounded model checking for software verification
- Model Checking Software
- Model Checking Software
- Predicate abstraction of ANSI-C programs using SAT
- Test Data Generation of Bytecode by CLP Partial Evaluation
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(3)
This page was built for publication: CPBPV: a constraint-programming framework for bounded program verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968353)