Inductive data flow graphs
From MaRDI portal
Publication:2931789
DOI10.1145/2429069.2429086zbMath1301.68178MaRDI 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
68W05: Nonnumerical algorithms
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
What’s Decidable About Program Verification Modulo Axioms?, Proof tree preserving tree interpolation, Lost in abstraction: monotonicity in multi-threaded programs, A tree-based approach to data flow proofs, \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms, Verification of concurrent programs using Petri net unfoldings, Abstract semantic diffing of evolving concurrent programs, Automated Program Verification, Compositional Reasoning
