A Generic Approach to the Static Analysis of Concurrent Programs with Procedures

DOI10.1142/S0129054103001893zbMath1101.68457OpenAlexW2081431431MaRDI QIDQ5696926

Javier Esparza, Ahmed Bouajjani, Tayssir Touili

Publication date: 19 October 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054103001893

zbMATH Keywords

verificationstatic analysisabstractionpushdown systemsKleene algebrasconcurrent programs with procedures

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (8)

Model Checking Concurrent Programs ⋮ Convergence of Newton's method over commutative semirings ⋮ On the Reachability Analysis of Acyclic Networks of Pushdown Systems ⋮ Unboundedness Problems for Languages of Vector Addition Systems. ⋮ FPSOLVE: A Generic Solver for Fixpoint Equations Over Semirings ⋮ Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism ⋮ Realizability of Concurrent Recursive Programs ⋮ Reachability is decidable for weakly extended process rewrite systems

This page was built for publication: A Generic Approach to the Static Analysis of Concurrent Programs with Procedures