Sciweavers

CAV
2006
Springer
165views Hardware» more  CAV 2006»
14 years 12 days ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...
DATE
2004
IEEE
128views Hardware» more  DATE 2004»
14 years 12 days ago
A Crosstalk Aware Interconnect with Variable Cycle Transmission
Lin Li, Narayanan Vijaykrishnan, Mahmut T. Kandemi...
DATE
2004
IEEE
111views Hardware» more  DATE 2004»
14 years 12 days ago
State-Preserving vs. Non-State-Preserving Leakage Control in Caches
This paper compares the effectiveness of statepreserving and non-state-preserving techniques for leakage control in caches by comparing drowsy cache and gated-V
Yingmin Li, Dharmesh Parikh, Yan Zhang, Karthik Sa...
CAV
2006
Springer
90views Hardware» more  CAV 2006»
14 years 12 days ago
Termination of Integer Linear Programs
We show that termination of a simple class of linear loops over the integers is decidable. Namely we show that termination of deterministic linear loops is decidable over the integ...
Mark Braverman
DATE
2004
IEEE
116views Hardware» more  DATE 2004»
14 years 12 days ago
A Novel SAT All-Solutions Solver for Efficient Preimage Computation
In this paper, we present a novel all-solutions preimage SAT solver, SOLALL, with the following features: (1) a new success-driven learning algorithm employing smaller cut sets; (...
Bin Li, Michael S. Hsiao, Shuo Sheng
CAV
2006
Springer
133views Hardware» more  CAV 2006»
14 years 12 days ago
Programs with Lists Are Counter Automata
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Ra...
CAV
2006
Springer
86views Hardware» more  CAV 2006»
14 years 12 days ago
The Power of Hybrid Acceleration
This paper addresses the problem of computing symbolically the set of reachable configurations of a linear hybrid automaton. A solution proposed in earlier work consists in explori...
Bernard Boigelot, Frédéric Herbretea...
CAV
2006
Springer
143views Hardware» more  CAV 2006»
14 years 12 days ago
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
Josh Berdine, Byron Cook, Dino Distefano, Peter W....
CAV
2006
Springer
129views Hardware» more  CAV 2006»
14 years 12 days ago
Languages of Nested Trees
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
CAV
2006
Springer
101views Hardware» more  CAV 2006»
14 years 12 days ago
Ticc: A Tool for Interface Compatibility and Composition
Abstract. We present a brief overview of the tool Ticc (Tool for Interface Compatibility and Composition). In Ticc, a component interface describes both the behavior of a component...
B. Thomas Adler, Luca de Alfaro, Leandro Dias da S...