Algorithmic analysis of array-accessing programs

DOI10.1145/2287718.2287727zbMath1351.68149OpenAlexW2011432313MaRDI QIDQ2946676

Scott Weinstein, Pavol Černý, 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

automataarraysalgorithmic software verification

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 (5)

On temporal logics with data variable quantifications: decidability and complexity ⋮ Reachability in pushdown register automata ⋮ An automata-theoretic approach to the verification of distributed algorithms ⋮ A Note on C² Interpreted over Finite Data-Words ⋮ Algorithmic Analysis of Array-Accessing Programs

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