Sciweavers

523 search results - page 4 / 105
» A General Model for Reachability Testing of Concurrent Progr...
Sort
View
DAC
1996
ACM
14 years 17 days 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
TACAS
2012
Springer
263views Algorithms» more  TACAS 2012»
12 years 4 months ago
Reachability under Contextual Locking
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
Rohit Chadha, P. Madhusudan, Mahesh Viswanathan
TACAS
2010
Springer
181views Algorithms» more  TACAS 2010»
14 years 3 months ago
Boom: Taking Boolean Program Model Checking One Step Further
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
Gérard Basler, Matthew Hague, Daniel Kroeni...
CP
2005
Springer
14 years 1 months ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville
SIGSOFT
2010
ACM
13 years 6 months ago
Basset: a tool for systematic testing of actor programs
This paper presents Basset, a tool for systematic testing of JVM-based actor programs. The actor programming model offers a promising approach for developing reliable concurrent a...
Steven Lauterburg, Rajesh K. Karmani, Darko Marino...