Efficient Symbolic Representations for Arithmetic Constraints in Verification
From MaRDI portal
Publication:5696928
DOI10.1142/S0129054103001911zbMath1101.68642MaRDI QIDQ5696928
Tevfik Bultan, Constantinos Bartzis
Publication date: 19 October 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items
Structural Presburger digit vector automata ⋮ Action language verifier: An infinite-state model checker for reactive software specifications ⋮ Automata-based symbolic string analysis for vulnerability detection ⋮ LTL over integer periodicity constraints ⋮ Symbolic String Verification: Combining String Analysis and Size Analysis ⋮ The convex hull of a regular set of integer vectors is polyhedral and effectively computable
Uses Software
Cites Work
This page was built for publication: Efficient Symbolic Representations for Arithmetic Constraints in Verification
