From non-preemptive to preemptive scheduling using synchronization synthesis

DOI10.1007/s10703-016-0256-5zbMath1360.68346OpenAlexW1865886283WikidataQ42290898 ScholiaQ42290898MaRDI QIDQ5892421

Roopsha Samanta, Pavol Černý, Thorsten Tarrach, Leonid Ryzhyk, Arjun Radhakrishna, Edmund M. Clarke, Thomas A. Henzinger

Publication date: 15 May 2017

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-016-0256-5

zbMATH Keywords

synthesisconcurrencyMAXSATNFA language inclusion

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Abstract semantic diffing of evolving concurrent programs

Uses Software

• CBMC
• Liss
• Limi
• ConRepair
• Antichains
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Succinct Representation of Concurrent Trace Sets
• The notions of consistency and predicate locks in a database system
• Automatic Verification of Determinism for Structured Parallel Programs
• Abstraction-guided synthesis of synchronization
• Tools and Algorithms for the Construction and Analysis of Systems
• Antichains: A New Algorithm for Checking Universality of Finite Automata
• Logical Concurrency Control from Sequential Proofs
• From non-preemptive to preemptive scheduling using synchronization synthesis

This page was built for publication: From non-preemptive to preemptive scheduling using synchronization synthesis