Sciweavers

40 search results - page 5 / 8
» concur 2007
Sort
View
CONCUR
2007
Springer
15 years 4 months ago
Making Random Choices Invisible to the Scheduler
Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to res...
Konstantinos Chatzikokolakis, Catuscia Palamidessi
CONCUR
2007
Springer
15 years 4 months ago
Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures
We present a fixpoint-based algorithm for context-sensitive interprocedural kill/gen-analysis of programs with thread creation. Our algorithm is precise up to abstraction of sync...
Peter Lammich, Markus Müller-Olm
CONCUR
2007
Springer
15 years 1 months ago
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...
Rohit Chadha, Mahesh Viswanathan
CONCUR
2007
Springer
15 years 1 months ago
Temporal Antecedent Failure: Refining Vacuity
We re-examine vacuity in temporal logic model checking. We note two disturbing phenomena in recent results in this area. The first indicates that not all vacuities detected in prac...
Shoham Ben-David, Dana Fisman, Sitvanit Ruah
CONCUR
2007
Springer
15 years 4 months ago
Pushdown Module Checking with Imperfect Information
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
Benjamin Aminof, Aniello Murano, Moshe Y. Vardi