Interprocedural analysis of asynchronous programs

DOI10.1145/1190216.1190266zbMath1295.68086OpenAlexW2184209356MaRDI QIDQ3189813

Rupak Majumdar, Ranjit Jhala

Publication date: 12 September 2014

Published in: Proceedings of the 34th 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/1190216.1190266

zbMATH Keywords

dataflow analysisasynchronous (event-driven) programming

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (11)

Summarization for termination: No return! ⋮ General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond ⋮ On the Reachability Analysis of Acyclic Networks of Pushdown Systems ⋮ Data flow analysis of asynchronous systems using infinite abstract domains ⋮ Unnamed Item ⋮ Deciding branching time properties for asynchronous programs ⋮ Context-Bounded Analysis of Concurrent Queue Systems ⋮ General decidability results for asynchronous shared-memory programs: higher-order and beyond ⋮ Reasoning about Threads with Bounded Lock Chains ⋮ Analyzing Real-Time Event-Driven Programs ⋮ Verification of Asynchronous Programs with Nested Locks

This page was built for publication: Interprocedural analysis of asynchronous programs