Sciweavers

7988 search results - page 199 / 1598
» A Useful Undecidable Theory
Sort
View
SEFM
2008
IEEE
14 years 5 months ago
Tagging Make Local Testing of Message-Passing Systems Feasible
The only practical way to test distributed messagepassing systems is to use local testing. In this approach, used in formalisms such as concurrent TTCN-3, some components are repl...
Puneet Bhateja, Madhavan Mukund
TACAS
2007
Springer
144views Algorithms» more  TACAS 2007»
14 years 4 months ago
Detecting Races in Ensembles of Message Sequence Charts
Abstract. The analysis of message sequence charts (MSCs) is highly important in preventing common problems in communication protocols. Detecting race conditions, i.e., possible dis...
Edith Elkind, Blaise Genest, Doron Peled
IJCAI
2001
14 years 4 days ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen
LDTA
2010
13 years 11 months ago
Faster ambiguity detection by grammar filtering
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
H. J. S. Basten, Jurgen J. Vinju
ACTA
2010
191views more  ACTA 2010»
13 years 11 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar