Efficient Symbolic Representations for Arithmetic Constraints in Verification
From MaRDI portal
Publication:5696928
Recommendations
Cites work
Cited in
(12)- Symbolic String Verification: Combining String Analysis and Size Analysis
- scientific article; zbMATH DE number 1962792 (Why is no real title available?)
- Action language verifier: An infinite-state model checker for reactive software specifications
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
- scientific article; zbMATH DE number 2086591 (Why is no real title available?)
- Structural Presburger digit vector automata
- Efficient image computation in infinite state model checking.
- Automata-based symbolic string analysis for vulnerability detection
- The convex hull of a regular set of integer vectors is polyhedral and effectively computable
- LTL over integer periodicity constraints
- scientific article; zbMATH DE number 1956595 (Why is no real title available?)
- Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space
This page was built for publication: Efficient Symbolic Representations for Arithmetic Constraints in Verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696928)