Sciweavers

523 search results - page 3 / 105
» A General Model for Reachability Testing of Concurrent Progr...
Sort
View
LPNMR
2001
Springer
15 years 1 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
SOFTVIS
2010
ACM
14 years 9 months ago
TIE: an interactive visualization of thread interleavings
Multi-core processors have become increasingly prevalent, driving a software shift toward concurrent programs which best utilize these processors. Testing and debugging concurrent...
Gowritharan Maheswara, Jeremy S. Bradbury, Christo...
FORTE
2008
14 years 11 months ago
An SMT Approach to Bounded Reachability Analysis of Model Programs
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
Margus Veanes, Nikolaj Bjørner, Alexander R...
CAV
2006
Springer
209views Hardware» more  CAV 2006»
15 years 1 months ago
CUTE and jCUTE: Concolic Unit Testing and Explicit Path Model-Checking Tools
CUTE, a Concolic Unit Testing Engine for C and Java, is a tool to systematically and automatically test sequential C programs (including pointers) and concurrent Java programs. CUT...
Koushik Sen, Gul Agha
CONCUR
2006
Springer
15 years 1 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...