Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...
A scalechart is a set of statecharts, operating in a dense time domain, whose behavior is self-similar at different scales. The simplicity of extracting proofs of behavior from sc...
Proof-carryingcode provides a mechanism for insuring that a host, or code consumer, can safely run code delivered by a code producer. The host specifies a safety policy as a set o...