Proof Spaces for Unbounded Parallelism
From MaRDI portal
Publication:2819827
DOI10.1145/2676726.2677012zbMath1345.68102OpenAlexW2090547808MaRDI QIDQ2819827
Andreas Podelski, Azadeh Farzan, Zachary Kincaid
Publication date: 29 September 2016
Published in: Proceedings of the 42nd 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/2676726.2677012
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
Verifying the correctness of distributed systems via mergeable parallelism, \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms, What’s Decidable About Program Verification Modulo Axioms?, Automated Program Verification, Domains for Higher-Order Games
Uses Software
