Sciweavers

1894 search results - page 179 / 379
» A TLA Proof System
Sort
View
166
Voted
SNPD
2004
15 years 8 months ago
Addressing State Explosion in Behavior Protocol Verification
A typical problem formal verification faces is the size of the model of a system being verified. Even for a small system, the state space of the model tends to grow exponentially (...
Martin Mach, Frantisek Plasil
CONCUR
2010
Springer
15 years 8 months ago
Theory by Process
Abstract. Theories defined in a process model are formalized and studied. A theory in a process calculus is a set of perpetually available processes with finite interactability, ea...
Yuxi Fu
CORR
2010
Springer
158views Education» more  CORR 2010»
15 years 7 months ago
A Minimal Propositional Type Theory
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show ...
Mark Kaminski, Gert Smolka
187
Voted
ENTCS
2008
125views more  ENTCS 2008»
15 years 7 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
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
15 years 1 months ago
Multi-resolution path planning: Theoretical analysis, efficient implementation, and extensions to dynamic environments
A multi-resolution path planning algorithm based on the wavelet transform of the environment has been reported previously in the literature. In this paper, we provide a proof of co...
Raghvendra V. Cowlagi, Panagiotis Tsiotras