Author of the publication

From Non-preemptive to Preemptive Scheduling Using Synchronization Synthesis.

, , , , , , and . CAV (2), volume 9207 of Lecture Notes in Computer Science, page 180-197. Springer, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

From Non-preemptive to Preemptive Scheduling Using Synchronization Synthesis., , , , , , and . CAV (2), volume 9207 of Lecture Notes in Computer Science, page 180-197. Springer, (2015)Lipschitz Robustness of Timed I/O Systems., , and . VMCAI, volume 9583 of Lecture Notes in Computer Science, page 250-267. Springer, (2016)Robustness Analysis of String Transducers., , and . ATVA, volume 8172 of Lecture Notes in Computer Science, page 427-441. Springer, (2013)Lipschitz Robustness of Finite-state Transducers., , and . FSTTCS, volume 29 of LIPIcs, page 431-443. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)An Algorithmic Framework for Synthesis of Concurrent Programs., and . ATVA, volume 6996 of Lecture Notes in Computer Science, page 522-530. Springer, (2011)Cost-Aware Automatic Program Repair., , and . SAS, volume 8723 of Lecture Notes in Computer Science, page 268-284. Springer, (2014)Direct Manipulation for Imperative Programs., , , and . SAS, volume 11822 of Lecture Notes in Computer Science, page 347-367. Springer, (2019)Synthesis of Distributed Agreement-Based Systems with Efficiently-Decidable Parameterized Verification., , , , and . CoRR, (2022)From non-preemptive to preemptive scheduling using synchronization synthesis., , , , , , and . Formal Methods Syst. Des., 50 (2-3): 97-139 (2017)Synthesis of Distributed Agreement-Based Systems with Efficiently-Decidable Verification., , , , and . TACAS (2), volume 13994 of Lecture Notes in Computer Science, page 289-308. Springer, (2023)