Interprocedural analysis of asynchronous programs

DOI10.1145/1190216.1190266MaRDI QIDQ3189813zbMATH OpenOpenAlexFDO

Authors Ranjit Jhala, Rupak Majumdar

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

asynchronous (event-driven) programmingdataflow analysis

Mathematics Subject Classification ID

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

Recommendations

• Synchronizing the asynchronous
• Data flow analysis of asynchronous systems using infinite abstract domains
• Verifiable design of asynchronous software
• scientific article; zbMATH DE number 1538033
• Interprocedural Analysis of Concurrent Programs Under a Context Bound

Cited in

(25)

• General decidability results for asynchronous shared-memory programs: higher-order and beyond
• Data flow analysis of asynchronous systems using infinite abstract domains
• On the sequential nature of interprocedural program-analysis problems
• Analysis of asynchronous programs with event-based synchronization
• Bounded phase analysis of message-passing programs
• Reasoning about threads with bounded lock chains
• Analyzing Asynchronous Programs with Preemption
• On the Reachability Analysis of Acyclic Networks of Pushdown Systems
• Verifiable design of asynchronous software
• Analyzing Real-Time Event-Driven Programs
• Interprocedural analysis and optimization
• Interprocedural analyses: a comparison
• Synchronizing the asynchronous
• General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
• Verification of timed asynchronous programs
• Verification of asynchronous programs with nested locks
• Verifying liveness for asynchronous programs
• Context-Bounded Analysis of Concurrent Queue Systems
• Verification, Model Checking, and Abstract Interpretation
• Automated synthesis of asynchronizations
• Verifying asynchronous event-driven programs using partial abstract transformers
• Coupling asynchrony and interrupts: Place Chart Nets
• Deciding branching time properties for asynchronous programs
• Summarization for termination: No return!
• Backwards type analysis of asynchronous method calls

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

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