171 citations · 821 across the 108 of their papers we have counts for
9 papers · 1 filter
Abstraction-driven Concolic Testing
Przemysław Daca, Ashutosh Gupta, Thomas A. Henzinger
Concolic testing is a promising method for generating test suites for large programs. However, it suffers from the path-explosion problem and often fails to find tests that cover d…
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…
Lipschitz Robustness of Timed I/O Systems
Thomas A. Henzinger, Jan Otop, Roopsha Samanta
We present the first study of robustness of systems that are both timed as well as reactive (I/O). We study the behavior of such timed I/O systems in the presence of "uncertain inp…
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…
Nested Weighted Automata
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide…
Edit Distance for Pushdown Automata
Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen +1
The edit distance between two words is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform to . The…