Doomed program points
DOI10.1007/S10703-010-0102-0zbMATH Open1211.68090OpenAlexW2123401705MaRDI QIDQ633286FDOQ633286
Authors: Jochen Hoenicke, K. Rustan M. Leino, Andreas Podelski, Martin Schäf, Thomas Wies
Publication date: 31 March 2011
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-010-0102-0
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer Science Logic
- Computer Aided Verification
- A fast algorithm for finding dominators in a flowgraph
- Tools and Algorithms for the Construction and Analysis of Systems
- On the Notion of Vacuous Truth
- Efficient weakest preconditions
- Title not available (Why is that?)
- Avoiding exponential explosion: generating compact verification conditions
- Compositional may-must program analysis: unleashing the power of alternation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Verification of Array, Record, and Pointer Operations in Pascal
Cited In (1)
Uses Software
This page was built for publication: Doomed program points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633286)