309 search results - page 10 / 62 » Termination proofs for systems code |
CADE
2001
Springer
15 years 12 months ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
100
Voted
TLCA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We investigate the question of what constitutes a proof when quantifiers and multiplicative units are both present. On the technical level this paper provides two new as...
94
Voted
CSFW
2004
IEEE
15 years 3 months ago
2004
IEEE
We present a system, BLF, that combines an authorization logic based on the Binder language with a logical framework, LF, able to express semantic properties of programs. BLF is a...
DIMVA
2010
15 years 1 months ago
2010
We present Conqueror, a software-based attestation scheme for tamper-proof code execution on untrusted legacy systems. Beside providing load-time attestation of a piece of code, Co...
APLAS
2009
ACM
15 years 3 months ago
2009
ACM
Type and effect systems are a tool to analyse statically the behaviour of programs with effects. We present a proof based on the so called reducibility candidates that a suitable ...