Sciweavers

CAV
2015
Springer
18views Hardware» more  CAV 2015»
8 years 9 days ago
The Inez Mathematical Programming Modulo Theories Framework
Our Mathematical Programming Modulo Theories (MPMT) constraint solving framework extends Mathematical Programming technology with techniques from the field of Automated Reasoning,...
Panagiotis Manolios, Jorge Pais, Vasilis Papavasil...
CAV
2015
Springer
23views Hardware» more  CAV 2015»
8 years 9 days ago
Bbs: A Phase-Bounded Model Checker for Asynchronous Programs
Abstract. A popular model of asynchronous programming consists of a singlethreaded worker process interacting with a task queue. In each step of such a program, the worker takes a ...
Rupak Majumdar, Zilong Wang
CAV
2015
Springer
10views Hardware» more  CAV 2015»
8 years 9 days ago
OptiMathSAT: A Tool for Optimization Modulo Theories
Abstract. Many SMT problems of interest may require the capability of finding models that are optimal wrt. some objective functions. These problems are grouped under the umbrella ...
Roberto Sebastiani, Patrick Trentin
CAV
2015
Springer
12views Hardware» more  CAV 2015»
8 years 9 days ago
OpenJDK's Java.utils.Collection.sort() Is Broken: The Good, the Bad and the Worst Case
We investigate the correctness of TimSort, which is the main sorting algorithm provided by the Java standard library. The goal is functional verification with mechanical proofs. D...
Stijn de Gouw, Jurriaan Rot, Frank S. de Boer, Ric...
CAV
2015
Springer
24views Hardware» more  CAV 2015»
8 years 9 days ago
Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation
Abstract. We apply multivariate Lagrange interpolation to synthesizing polynomial quantitative loop invariants for probabilistic programs. We reduce the computation of an quantitat...
Yu-Fang Chen, Chih-Duo Hong, Bow-Yaw Wang, Lijun Z...
CAV
2015
Springer
15views Hardware» more  CAV 2015»
8 years 9 days ago
From Non-preemptive to Preemptive Scheduling Using Synchronization Synthesis
Abstract. We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthes...
Pavol Cerný, Edmund M. Clarke, Thomas A. He...
CAV
2015
Springer
16views Hardware» more  CAV 2015»
8 years 9 days ago
Approximate Synchrony: An Abstraction for Distributed Almost-Synchronous Systems
ate Synchrony: An Abstraction for Distributed Almost-Synchronous Systems Ankush Desai1 , Sanjit A. Seshia1 , Shaz Qadeer2 , David Broman1,3 , John C. Eidson1 1 University of Califo...
Ankush Desai, Sanjit A. Seshia, Shaz Qadeer, David...
CAV
2015
Springer
21views Hardware» more  CAV 2015»
8 years 9 days ago
Adaptive Concretization for Parallel Program Synthesis
Abstract. Program synthesis tools work by searching for an implementation that satisfies a given specification. Two popular search strategies are symbolic search, which reduces s...
Jinseong Jeon, Xiaokang Qiu, Armando Solar-Lezama,...
CAV
2015
Springer
22views Hardware» more  CAV 2015»
8 years 9 days ago
Poling: SMT Aided Linearizability Proofs
Abstract. Proofs of linearizability of concurrent data structures generally rely on identifying linearization points to establish a simulation argument between the implementation a...
He Zhu, Gustavo Petri, Suresh Jagannathan
CAV
2015
Springer
18views Hardware» more  CAV 2015»
8 years 9 days ago
SMT and POR Beat Counter Abstraction: Parameterized Model Checking of Threshold-Based Distributed Algorithms
POR beat Counter Abstraction: Parameterized Model Checking of Threshold-Based Distributed Algorithms Igor Konnov, Helmut Veith, and Josef Widder TU Wien (Vienna University of Techn...
Igor Konnov, Helmut Veith, Josef Widder