Computing Program Reliability Using Forward-Backward Precondition Analysis and Model Counting
From MaRDI portal
Publication:5039530
DOI10.1007/978-3-030-45234-6_9OpenAlexW3018156379MaRDI QIDQ5039530
Axel Legay, Aleksandar S. Dimovski
Publication date: 13 October 2022
Published in: Fundamental Approaches to Software Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-45234-6_9
Related Items (2)
Quantifying software reliability via model-counting ⋮ A decision tree lifted domain for analyzing program families with numerical features
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Program verification using symbolic game semantics
- The octagon abstract domain
- Constructive versions of Tarski's fixed point theorems
- Dynamic partitioning in linear relation analysis: application to the verification of reactive systems
- Finding suitable variability abstractions for family-based analysis
- Finding suitable variability abstractions for lifted analysis
- Probabilistic Abstract Interpretation
- Precondition Inference from Intermittent Assertions and Application to Contracts on Collections
- Grammar Analysis and Parsing by Abstract Interpretation
- Abstract interpretation and application to logic programs
- Abstraction, Refinement and Proof for Probabilistic Systems
- Linear-Invariant Generation for Probabilistic Programs:
- An abstract Monte-Carlo method for the analysis of probabilistic programs
- An Abstract Domain to Infer Ordinal-Valued Ranking Functions
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
- Static Analysis
This page was built for publication: Computing Program Reliability Using Forward-Backward Precondition Analysis and Model Counting
