99 citations · 238 across the 17 of their papers we have counts for
11 papers · 1 filter
Type-directed Bounding of Collections in Reactive Programs
Tianhan Lu, Pavol Cerny, Bor-Yuh Evan Chang +1
Our aim is to statically verify that in a given reactive program, the length of collection variables does not grow beyond a given bound. We propose a scalable type-based technique…
Discriminating Traces with Time
Saeid Tizpaz-Niari, Pavol Cerny, Bor-Yuh Evan Chang +2
What properties about the internals of a program explain the possible differences in its overall running time for different inputs? In this paper, we propose a formal framework for…
Optimizing Solution Quality in Synchronization Synthesis
Pavol Černý, Edmund M. Clarke, Thomas A. Henzinger +4
Given a multithreaded program written assuming a friendly, non-preemptive scheduler, the goal of synchronization synthesis is to automatically insert synchronization primitives to…
Event-Driven Network Programming
Jedidiah McClurg, Hossein Hojjat, Nate Foster +1
Software-defined networking (SDN) programs must simultaneously describe static forwarding behavior and dynamic updates in response to events. Event-driven updates are critical to g…
Synthesis through Unification
Rajeev Alur, Pavol Cerny, Arjun Radhakrishna
Given a specification and a set of candidate programs (program space), the program synthesis problem is to find a candidate program that satisfies the specification. We present the…
From Non-preemptive to Preemptive Scheduling using Synchronization Synthesis
Pavol Černý, Edmund M. Clarke, Thomas A. Henzinger +4
We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedu…
Regression-free Synthesis for Concurrency
Pavol Černý, Thomas A. Henzinger, Arjun Radhakrishna +2
While fixing concurrency bugs, program repair algorithms may introduce new concurrency bugs. We present an algorithm that avoids such regressions. The solution space is given by a…
Toward Synthesis of Network Updates
Andrew Noyes, Todd Warszawski, Pavol Černý +1
Updates to network configurations are notoriously difficult to implement correctly. Even if the old and new configurations are correct, the update process can introduce transient e…
Efficient Synthesis of Network Updates
Jedidiah McClurg, Hossein Hojjat, Pavol Cerny +1
Software-defined networking (SDN) is revolutionizing the networking industry, but current SDN programming platforms do not provide automated mechanisms for updating global configur…
Quantitative Synthesis for Concurrent Programs
Pavol Cerny, Krishnendu Chatterjee, Thomas Henzinger +2
We present an algorithmic method for the quantitative, performance-aware synthesis of concurrent programs. The input consists of a nondeterministic partial program and of a paramet…
Algorithmic Verification of Single-Pass List Processing Programs
Rajeev Alur, Pavol Cerny
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) sequen…