Sciweavers

1199 search results - page 144 / 240
» Parameterized Proof Complexity
Sort
View
ENTCS
2008
125views more  ENTCS 2008»
13 years 9 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
FUIN
2006
111views more  FUIN 2006»
13 years 9 months ago
Typing the Behavior of Software Components using Session Types
This paper proposes the use of session types to extend with behavioural information the simple descriptions usually provided by software component interfaces. We show how session t...
Antonio Vallecillo, Vasco Thudichum Vasconcelos, A...
SRDS
1999
IEEE
14 years 1 months ago
Formal Hazard Analysis of Hybrid Systems in cTLA
Hybrid systems like computer-controlled chemical plants are typical safety critical distributed systems. In present practice, the safety of hybrid systems is guaranteed by hazard ...
Peter Herrmann, Heiko Krumm
ICCV
1999
IEEE
14 years 11 months ago
Capturing Articulated Human Hand Motion: A Divide-and-Conquer Approach
The use of human hand as a natural interface device serves as a motivating force for research in the modeling, analyzing and capturing of the motion of articulated hand. Model-bas...
Ying Wu, Thomas S. Huang
POPL
2008
ACM
14 years 9 months ago
Relational inductive shape analysis
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
Bor-Yuh Evan Chang, Xavier Rival