Verifying relative safety, accuracy, and termination for program approximations
DOI10.1007/S10817-017-9421-9zbMATH Open1425.68256OpenAlexW2738309652MaRDI QIDQ682353FDOQ682353
Authors: Shaobo He, Shuvendu K. Lahiri, Zvonimir Rakamarić 
Publication date: 2 February 2018
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-017-9421-9
Recommendations
- A theoretical limit for safety verification techniques with regular fix-point computations
- Accelerating bounded model checking of safety properties
- Using integer programming to verify general safety and liveness properties
- Bounded and Unbounded Safety Verification Using Bisimulation Metrics
- Fine-grained complexity of safety verification
- Fine-grained complexity of safety verification
- scientific article; zbMATH DE number 1982198
- Proving correctness with respect to nondeterministic safety specifications
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?)
- Simple relational correctness proofs for static analyses and program transformations
- Towards modularly comparing programs using automated theorem provers
- Randomized accuracy-aware program transformations for efficient approximate computations
- Structural analysis of narratives with the Coq proof assistant
- Proving mutual termination
Cited In (3)
Uses Software
This page was built for publication: Verifying relative safety, accuracy, and termination for program approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q682353)
