A Reachability Predicate for Analyzing Low-Level Software
From MaRDI portal
Publication:5758100
DOI10.1007/978-3-540-71209-1_4zbMath1186.68108MaRDI QIDQ5758100
Shaunak Chatterjee, Zvonimir Rakamarić, Shuvendu K. Lahiri, Shaz Qadeer
Publication date: 3 September 2007
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-71209-1_4
68P05: Data structures
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Verification of Equivalent-Results Methods, Verification of heap manipulating programs with ordered data by extended forest automata, Generalizing the Template Polyhedral Domain, Satisfiability Modulo Theories, Region Analysis for Race Detection, Verifying Heap-Manipulating Programs in an SMT Framework
Uses Software