Sciweavers

490 search results - page 31 / 98
» Equivalent Keys of HPC
Sort
View
ENTCS
2006
129views more  ENTCS 2006»
13 years 8 months ago
Confluence Thanks to Extensional Determinism
A process is extensionally deterministic if, after any trace s and given any event a, it is either certain to accept or certain to refuse a (stably) after s. We show how several p...
A. W. Roscoe
IPL
2008
147views more  IPL 2008»
13 years 8 months ago
Streaming tree automata
Streaming validation and querying of XML documents are often based on automata for tree-like structures. We propose a new notion of streaming tree automata in order to unify the t...
Olivier Gauwin, Joachim Niehren, Yves Roos
CORR
2007
Springer
148views Education» more  CORR 2007»
13 years 8 months ago
Linear time algorithms for Clobber
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
Vincent D. Blondel, Julien M. Hendrickx, Raphael M...
CORR
2007
Springer
51views Education» more  CORR 2007»
13 years 8 months ago
Projection semantics for rigid loops
A rigid loop is a for-loop with a counter not accessible to the loop body or any other part of a program. Special instructions for rigid loops are introduced on top of the syntax ...
Jan A. Bergstra, Alban Ponse
JLP
2007
98views more  JLP 2007»
13 years 8 months ago
Tempus fugit: How to plug it
Secret or private information may be leaked to an external attacker through the timing behaviour of the system running the untrusted code. After introducing a formalisation of thi...
Alessandra Di Pierro, Chris Hankin, Igor Siveroni,...