Sciweavers

2610 search results - page 407 / 522
» The Recognition Strategy Language
Sort
View
CADE
2008
Springer
16 years 6 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
ICALP
2009
Springer
16 years 6 months ago
A Survey of Stochastic Games with Limsup and Liminf Objectives
A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We s...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
ICALP
2009
Springer
16 years 6 months ago
Reachability in Stochastic Timed Games
We define stochastic timed games, which extend two-player timed games with probabilities (following a recent approach by Baier et al), and which extend in a natural way continuous-...
Patricia Bouyer, Vojtech Forejt
PEPM
2009
ACM
16 years 3 months ago
Program interpolation
Program interpolation is a new type of transformation that given an input program written in a specially constructed Domain Specific Language (DSL), produces a family of function...
Andrew Moss, Dan Page
SAC
2009
ACM
16 years 1 months ago
Efficient mobile reasoning for pervasive discovery
Semantic service discovery architectures that operate in mobile environments must cope with the significant challenges of finding relevant services rapidly, while facing constrain...
Luke Steller, Shonali Krishnaswamy