Verifying liveness for asynchronous programs
From MaRDI portal
Publication:5261509
DOI10.1145/1480881.1480895zbMath1315.68064MaRDI QIDQ5261509
Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko
Publication date: 3 July 2015
Published in: Proceedings of the 36th 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/1480881.1480895
68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, 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
Data flow analysis of asynchronous systems using infinite abstract domains, Forward Analysis and Model Checking for Trace Bounded WSTS, On Yen’s Path Logic for Petri Nets, Analyzing Real-Time Event-Driven Programs