Automated synthesis of asynchronizations

DOI10.1007/978-3-031-22308-2_7zbMath1524.68074arXiv2209.06648OpenAlexW4312873680MaRDI QIDQ6164424

Constantin Enea, Ahmed Bouajjani, Shuvendu K. Lahiri, Sidi Mohamed Beillahi

Publication date: 28 July 2023

Published in: Static Analysis (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Succinct Representation of Concurrent Trace Sets
• Analysis of recursively parallel programs
• Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency
• Inferring Synchronization under Limited Observability
• Synthesis of Communicating Processes from Temporal Logic Specifications
• Abstraction-guided synthesis of synchronization
• Analysis of Boolean Programs
• From non-preemptive to preemptive scheduling using synchronization synthesis

This page was built for publication: Automated synthesis of asynchronizations