Sciweavers

456 search results - page 14 / 92
» A Proof System for Abstract Non-interference
Sort
View
LFCS
2009
Springer
15 years 4 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
IFL
2007
Springer
221views Formal Methods» more  IFL 2007»
15 years 3 months ago
From Contracts Towards Dependent Types: Proofs by Partial Evaluation
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
Stephan Herhut, Sven-Bodo Scholz, Robert Bernecky,...
SAT
2007
Springer
118views Hardware» more  SAT 2007»
15 years 3 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
FROCOS
2007
Springer
15 years 1 months ago
Certification of Automated Termination Proofs
Abstract. Nowadays, formal methods rely on tools of different kinds: proof assistants with which the user interacts to discover a proof step by step; and fully automated tools whic...
Evelyne Contejean, Pierre Courtieu, Julien Forest,...
75
Voted
ICALP
2007
Springer
15 years 3 months ago
Complexity of Propositional Proofs Under a Promise
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
Nachum Dershowitz, Iddo Tzameret