Sciweavers

309 search results - page 11 / 62
» Termination proofs for systems code
Sort
View
LICS
2002
IEEE
15 years 4 months ago
A Syntactic Approach to Foundational Proof-Carrying Code
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, S...
94
Voted
LOGCOM
2007
97views more  LOGCOM 2007»
14 years 11 months ago
Termination for Hybrid Tableaus
Abstract. This article extends and improves work on tableau-based decision methods for hybrid logic by Bolander and Bra¨uner [5]. Their paper gives tableau-based decision procedur...
Thomas Bolander, Patrick Blackburn
103
Voted
RTA
2010
Springer
15 years 3 months ago
Modular Complexity Analysis via Relative Complexity
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
Harald Zankl, Martin Korp
LFCS
2009
Springer
15 years 6 months ago
The Logic of Proofs as a Foundation for Certifying Mobile Computation
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...
Eduardo Bonelli, Federico Feller
78
Voted
POPL
1997
ACM
15 years 3 months ago
Proof-Carrying Code
Proof-carrying code is a framework for the mechanical verification of safety properties of machine language programs, but the problem arises of quis custodiat ipsos custodes—wh...
George C. Necula