213 search results - page 10 / 43 » A framework for checking proofs naturally |
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
CCS
2007
ACM
14 years 1 months ago
2007
ACM
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier...
ESOP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
APCSAC
2004
IEEE
13 years 11 months ago
2004
IEEE
As device sizes continue shrinking, lower charges are needed to activate gates, and consequently ever smaller external events (such as single ionizing particles of naturally occurr...
TAPSOFT
1997
Springer
13 years 11 months ago
1997
Springer
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...