CAV
2008
Springer
13 years 10 months ago
2008
Springer
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
CAV
2008
Springer
13 years 10 months ago
2008
Springer
Counterexample-guided abstraction refinement (CEGAR) has been en vogue for the automatic verification of very large systems in the past years. When trying to apply CEGAR to the ver...
CAV
2008
Springer
13 years 10 months ago
2008
Springer
CAV
2008
Springer
13 years 10 months ago
2008
Springer
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...
CAV
2008
Springer
13 years 10 months ago
2008
Springer
c Abstraction for Programs with Dynamic Memory Heaps Parosh Aziz Abdulla1 , Ahmed Bouajjani2 , Jonathan Cederberg1 , Fr
CAV
2008
Springer
13 years 10 months ago
2008
Springer
We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem v...
CAV
2008
Springer
13 years 10 months ago
2008
Springer
CAV
2008
Springer
13 years 10 months ago
2008
Springer
CASES
2008
ACM
13 years 10 months ago
2008
ACM
In this paper, we introduce Optimus: an optimizing synthesis compiler for streaming applications. Optimus compiles programs written in a high level streaming language to either so...
CARDIS
2008
Springer
13 years 10 months ago
2008
Springer
We investigate an application of RFIDs referred to in the literature as group scanning, in which several tags are "simultaneously" scanned by a reader device. Our goal is...