Sciweavers

3931 search results - page 192 / 787
» Separation logic and abstraction
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 6 months ago
Characterising Probabilistic Processes Logically
Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the...
Yuxin Deng, Rob J. van Glabbeek
CORR
2004
Springer
151views Education» more  CORR 2004»
15 years 6 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
ICALP
2000
Springer
15 years 10 months ago
On the Power of Tree-Walking Automata
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
Frank Neven, Thomas Schwentick
EPEW
2009
Springer
16 years 1 months ago
Passage-End Analysis
Abstract. Passage-end calculations are a new style of passage measurement for eXtended Stochastic Probes (XSP) [1] which add the ability to split the analysis into several cases de...
Allan Clark, Adam Duguid, Stephen Gilmore
ICANN
2009
Springer
16 years 1 months ago
Selective Attention Improves Learning
Abstract. We demonstrate that selective attention can improve learning. Considerably fewer samples are needed to learn a source separation problem when the inputs are pre-segmented...
Antti Yli-Krekola, Jaakko Särelä, Harri ...