534 search results - page 64 / 107 » Proving Termination of Rewrite Systems Using Bounds |
COCO
2008
Springer
13 years 10 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
CSFW
2008
IEEE
14 years 3 months ago
2008
IEEE
DKAL is a new declarative authorization language for distributed systems. It is based on existential fixed-point logic and is considerably more expressive than existing authoriza...
HYBRID
1999
Springer
14 years 1 months ago
1999
Springer
— In this paper we prove that a switched nonlinear system has several useful ISS-type properties under average dwell-time switching signals if each constituent dynamical system i...
CC
2009
Springer
14 years 9 months ago
2009
Springer
This paper presents a compiler which produces machine code from functions defined in the logic of a theorem prover, and at the same time proves that the generated code executes the...
FASE
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Though there has been nearly three decades of work on program slicing, there has been comparatively little work on slicing for state machines. One of the primary challeng...