Efficient algorithms for pre* and post* on interprocedural parallel flow graphs

DOI10.1145/325694.325697zbMath1323.68407OpenAlexW2147248565MaRDI QIDQ5178837

Andreas Podelski, Javier Esparza

Publication date: 17 March 2015

Published in: Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/325694.325697

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Distributed algorithms (68W15)

Related Items (17)

Precise interprocedural dependence analysis of parallel programs ⋮ Summarization for termination: No return! ⋮ Verifying parallel programs with dynamic communication structures ⋮ On the Reachability Analysis of Acyclic Networks of Pushdown Systems ⋮ Verification of well-formed communicating recursive state machines ⋮ An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems ⋮ Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism ⋮ Verifying Multithreaded Recursive Programs with Integer Variables ⋮ Decidable models of integer-manipulating programs with recursive parallelism ⋮ The regular viewpoint on PA-processes ⋮ Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation ⋮ Verifying Parallel Programs with Dynamic Communication Structures ⋮ Reachability is decidable for weakly extended process rewrite systems ⋮ Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order ⋮ Decidable first-order transition logics for PA-processes ⋮ Iterating transducers ⋮ On Symbolic Verification of Weakly Extended PAD

Uses Software

• HyTech
• Uppaal

This page was built for publication: Efficient algorithms for pre* and post* on interprocedural parallel flow graphs