Algorithmic Analysis of Array-Accessing Programs

DOI10.1007/978-3-642-04027-6_9MaRDI QIDQ3644742zbMATH OpenOpenAlexFDO

Authors Pavol Černý, Scott Weinstein, Rajeev Alur

Publication date 12 November 2009

Published in Computer Science Logic (Search for Journal in Brave)

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

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
• Array theory of bounded elements and its applications
• Verification, Model Checking, and Abstract Interpretation
• Verification problem for linear programs with Boolean arrays
• Automatic Verification of Integer Array Programs

Cites work

• A framework for numeric analysis of array operations
• Algorithmic analysis of array-accessing programs
• Decidability of reachability for polymorphic systems with arrays: a complete classification
• Finite state machines for strings over infinite alphabets
• Finite-memory automata
• scientific article; zbMATH DE number 1903378 (Why is no real title available?)
• Lifting abstract interpreters to quantified logical domains
• LTL with the freeze quantifier and register automata
• On Notions of Regularity for Data Languages
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Rewriting Systems with Data
• Shuffle Expressions and Words with Nested Data
• Shuffle languages, Petri nets, and context-sensitive grammars
• Two-variable logic on data words
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation
• What Else Is Decidable about Integer Arrays?

Cited in

(7)

• Dataflow analysis of array and scalar references
• Program extraction for mutable arrays
• Verification problem for linear programs with Boolean arrays
• Decision Problems for Finite Automata over Infinite Algebraic Structures
• Algorithmic analysis of array-accessing programs
• Analyzing Array Manipulating Programs by Program Transformation
• Aligators for Arrays (Tool Paper)

Describes a project that uses

Uses Software

• SLAM

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 Q3644742)