Inductive data flow graphs

DOI10.1145/2429069.2429086zbMath1301.68178OpenAlexW2033942886MaRDI QIDQ2931789

Azadeh Farzan, Zachary Kincaid, Andreas Podelski

Publication date: 27 November 2014

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

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

zbMATH Keywords

verificationstatic analysisconcurrency

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) 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)

Related Items (9)

Proof tree preserving tree interpolation ⋮ A tree-based approach to data flow proofs ⋮ Compositional Reasoning ⋮ \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms ⋮ Verification of concurrent programs using Petri net unfoldings ⋮ What’s Decidable About Program Verification Modulo Axioms? ⋮ Lost in abstraction: monotonicity in multi-threaded programs ⋮ Automated Program Verification ⋮ Abstract semantic diffing of evolving concurrent programs

This page was built for publication: Inductive data flow graphs