Proving Liveness of Parameterized Programs

DOI10.1145/2933575.2935310zbMath1401.68038arXiv1605.02350OpenAlexW2963088485MaRDI QIDQ4635874

Zachary Kincaid, Andreas Podelski, Azadeh Farzan

Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.02350

Mathematics Subject Classification ID

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

Sound verification procedures for temporal properties of infinite-state systems, Verifying the correctness of distributed systems via mergeable parallelism, Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems, Reachability in Parameterized Systems: All Flavors of Threshold Automata, Temporal prophecy for proving temporal properties of infinite-state systems, Domains for Higher-Order Games