Reachability Analysis of Procedural Programs with Affine Integer Arithmetic

DOI10.1007/11812128_29MaRDI QIDQ5757242zbMATH OpenOpenAlexFDO

Authors Michael Luttenberger

Publication date 6 September 2007

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11812128_29

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Formal languages and automata (68Q45)

Recommendations

• Interprocedural reachability for flat integer programs
• Reachability analysis of synchronized PA systems
• scientific article; zbMATH DE number 1407672
• On Bounded Reachability of Programs with Set Comprehensions
• Precise interprocedural analysis through linear algebra

Cited in

(6)

• Resourceful reachability as HORN-LA
• Reachability analysis of program variables
• Interprocedural reachability for flat integer programs
• Analyzing automata with Presburger arithmetic and uninterpreted function symbols
• scientific article; zbMATH DE number 1407672 (Why is no real title available?)
• On Bounded Reachability of Programs with Set Comprehensions

This page was built for publication: Reachability Analysis of Procedural Programs with Affine Integer Arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757242)