Algorithmic Analysis of Array-Accessing Programs

DOI10.1007/978-3-642-04027-6_9zbMath1257.68102OpenAlexW1507914724MaRDI QIDQ3644742

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

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

Related Items (1)

Decision Problems for Finite Automata over Infinite Algebraic Structures

Uses Software

• SLAM

Cites Work

• Unnamed Item
• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Finite-memory automata
• LTL with the freeze quantifier and register automata
• Two-variable logic on data words
• Algorithmic analysis of array-accessing programs
• Lifting abstract interpreters to quantified logical domains
• Shuffle Expressions and Words with Nested Data
• Shuffle languages, Petri nets, and context-sensitive grammars
• A framework for numeric analysis of array operations
• Finite state machines for strings over infinite alphabets
• Rewriting Systems with Data
• On Notions of Regularity for Data Languages
• What Else Is Decidable about Integer Arrays?
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Algorithmic Analysis of Array-Accessing Programs