91 search results - page 5 / 19 » Abstract State Machines and Computationally Complete Query L... |
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We describe a simple, conceptual forward analysis procedure for complete WSTS S. This computes the clover of a state s0, i.e., a finite description of the closure of the ...
SOFSEM
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. Research on processing XML documents gained much activity in recent times. XML query languages are mostly based on XPath expressions, which are used to select parts of XM...
ICGI
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of th...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
act Interpretation SILVIA CRAFA FRANCESCO RANZATO University of Padova, Italy We show how bisimulation equivalence and simulation preorder on probabilistic LTSs (PLTSs), namely the...
ASM
2003
ASM
14 years 21 days ago
2003
ASM
Abstract. We compare three specification frameworks for the operationtics of programming languages, abstract state machines (ASMs) and the two incarnations of natural semantics, b...