Sciweavers

26 search results - page 1 / 6
» Reducing Context-Bounded Concurrent Reachability to Sequenti...
Sort
View
CAV
2009
Springer
138views Hardware» more  CAV 2009»
13 years 11 months ago
Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
Salvatore La Torre, P. Madhusudan, Gennaro Parlato
CAV
2007
Springer
112views Hardware» more  CAV 2007»
13 years 10 months ago
Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures
Bounded context switch reachability analysis is a useful and efficient approach for detecting bugs in multithreaded programs. In this paper, we address the application of this app...
Ahmed Bouajjani, Séverine Fratani, Shaz Qad...
CAV
2008
Springer
108views Hardware» more  CAV 2008»
13 years 6 months ago
Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
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...
Akash Lal, Thomas W. Reps
SPIN
2000
Springer
13 years 8 months ago
Model Checking Based on Simultaneous Reachability Analysis
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...
Bengi Karaçali, Kuo-Chung Tai
DAC
1996
ACM
13 years 8 months ago
Efficient Partial Enumeration for Timing Analysis of Asynchronous Systems
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
Eric Verlind, Gjalt G. de Jong, Bill Lin