Verifying liveness for asynchronous programs

DOI10.1145/1480881.1480895zbMATH Open1315.68064OpenAlexW2158126713MaRDI QIDQ5261509FDOQ5261509

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

Recommendations

• General decidability results for asynchronous shared-memory programs: higher-order and beyond
• Deciding branching time properties for asynchronous programs
• Verification of asynchronous programs with nested locks
• Proving Liveness by Backwards Reachability
• Interprocedural analysis of asynchronous programs

zbMATH Keywords

Petri netslivenessfair terminationasynchronous (event-driven) programming

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (4)

• On Yen’s Path Logic for Petri Nets
• Analyzing Real-Time Event-Driven Programs
• Forward Analysis and Model Checking for Trace Bounded WSTS
• Data flow analysis of asynchronous systems using infinite abstract domains

This page was built for publication: Verifying liveness for asynchronous programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261509)