Sciweavers

544 search results - page 62 / 109
» The Algebra of Equality Proofs
Sort
View
DLT
2006
13 years 9 months ago
On Critical Exponents in Fixed Points of Non-erasing Morphisms
Let be an alphabet of size t, let f : be a non-erasing morphism, let w be an infinite fixed point of f, and let E(w) be the critical exponent of w. We prove that if E(w) is fi...
Dalia Krieger
ENTCS
2008
125views more  ENTCS 2008»
13 years 8 months ago
Can Refinement be Automated?
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
Peter Höfner, Georg Struth
CORR
2011
Springer
171views Education» more  CORR 2011»
13 years 3 months ago
A Class of Probabilistic Automata with a Decidable Value 1 Problem
The value 1 problem is a decision problem for probabilistic automata on finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril...
Nathanaël Fijalkow, Hugo Gimbert, Youssouf Ou...
CSL
2007
Springer
14 years 2 months ago
Qualitative Temporal and Spatial Reasoning Revisited
Abstract. Establishing local consistency is one of the main algorithmic techniques in temporal and spatial reasoning. In this area, one of the central questions for the various pro...
Manuel Bodirsky, Hubie Chen
CN
2006
117views more  CN 2006»
13 years 8 months ago
Using equivalence-checking to verify robustness to denial of service
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
Stéphane Lafrance