Not all bugs are created equal, but robust reachability can tell the difference
DOI10.1007/978-3-030-81685-8_32zbMATH Open1493.68109OpenAlexW3187071876MaRDI QIDQ832220FDOQ832220
Authors: Guillaume Girol, Benjamin Farinier, Sébastien Bardin
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81685-8_32
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cites Work
- A logic for reasoning about time and reliability
- Title not available (Why is that?)
- Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
- Beyond quantifier-free interpolation in extensions of Presburger arithmetic
- Efficient E-Matching for SMT Solvers
- Model counting: a new stategy for obtaining good bounds
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Information theory and security: Quantitative information flow
- Efficient CTL model-checking for pushdown systems
- Title not available (Why is that?)
- Termination of Probabilistic Concurrent Program
- Arrays made simpler: an efficient, scalable and thorough preprocessing
- Verification, Model Checking, and Abstract Interpretation
- Model generation for quantified formulas: a taint-based approach
Cited In (2)
Uses Software
This page was built for publication: Not all bugs are created equal, but robust reachability can tell the difference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832220)