Sciweavers

2436 search results - page 35 / 488
» Comonadic Notions of Computation
Sort
View
PODC
2000
ACM
14 years 2 months ago
Debugging distributed programs using controlled re-execution
Distributed programs are hard to write. A distributed debugger equipped with the mechanism to re-execute the traced computation in a controlled fashion can greatly facilitate the ...
Neeraj Mittal, Vijay K. Garg
IFIP
2004
Springer
14 years 3 months ago
Asymptotic Behaviors of Type-2 Algorithms and Induced Baire Topologies
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
Chung-Chih Li
LOGCOM
2007
59views more  LOGCOM 2007»
13 years 9 months ago
Forgetting Literals with Varying Propositional Symbols
Recently, the old logical notion of forgetting propositional symbols (or reducing the logical vocabulary) has been generalized to a new notion: forgetting literals. The aim was to...
Yves Moinard
CONCUR
2009
Springer
14 years 4 months ago
Strict Divergence for Probabilistic Timed Automata
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. In previous work, a probabilistic notion of time divergence for p...
Jeremy Sproston
RELMICS
2001
Springer
14 years 2 months ago
Groups in Allegories
Groups are one of the most fundamental notions in mathematics. This paper provides a foundation of group theory in allegories. Almost all results in the paper can be applied to the...
Yasuo Kawahara