Sciweavers

442 search results - page 24 / 89
» Proof Abstraction for Imperative Languages
Sort
View
TPHOL
1999
IEEE
14 years 27 days ago
Three Tactic Theorem Proving
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
Don Syme
JCS
2007
141views more  JCS 2007»
13 years 8 months ago
Compositional information flow security for concurrent programs
We present a general unwinding framework for the definition of information flow security properties of concurrent programs, described in a simple imperative language enriched wi...
Annalisa Bossi, Carla Piazza, Sabina Rossi
TGC
2010
Springer
13 years 6 months ago
Certified Result Checking for Polyhedral Analysis of Bytecode Programs
Static analysers are becoming so complex that it is crucial to ascertain the soundness of their results in a provable way. In this paper we develop a certified checker in Coq that ...
Frédéric Besson, Thomas P. Jensen, D...
FPLE
1995
14 years 5 days ago
A Second Year Course on Data Structures Based on Functional Programming
In this paper, we make a proposal for a second year course on advanced programming, based on the functional paradigm. It assumes the existence of a first course on programming, al...
Manuel Núñez, Pedro Palao, Ricardo P...
LFCS
2009
Springer
14 years 3 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