Algorithmic analysis of array-accessing programs

DOI10.1145/2287718.2287727MaRDI QIDQ2946676zbMATH OpenOpenAlexFDO

Authors Pavol Černý, Scott Weinstein, Rajeev Alur

Publication date 17 September 2015

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://repository.upenn.edu/cis_reports/894

zbMATH Keywords

algorithmic software verificationarraysautomata

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Algorithmic Analysis of Array-Accessing Programs
• Verification, Model Checking, and Abstract Interpretation
• Array theory of bounded elements and its applications
• Verification problem for linear programs with Boolean arrays
• Automatic Verification of Integer Array Programs

Cited in

(12)

• Dataflow analysis of array and scalar references
• Program extraction for mutable arrays
• An automata-theoretic approach to the verification of distributed algorithms
• Verification problem for linear programs with Boolean arrays
• Reachability in pushdown register automata
• Analyzing Array Manipulating Programs by Program Transformation
• Deductive formal verification of search programs in arrays of arbitrary size for abstract register machines
• On temporal logics with data variable quantifications: decidability and complexity
• Automatic Verification of Integer Array Programs
• Algorithmic Analysis of Array-Accessing Programs
• Aligators for Arrays (Tool Paper)
• A Note on C² Interpreted over Finite Data-Words

This page was built for publication: Algorithmic analysis of array-accessing programs

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