456 search results - page 47 / 92 » A Proof System for Abstract Non-interference |
107
click to vote
TPHOL
2005
IEEE
15 years 7 months ago
2005
IEEE
Abstract. How close are we to a world where every paper on programming languages is accompanied by an electronic appendix with machinechecked proofs? We propose an initial set of b...
121
click to vote
RTA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
110
click to vote
ACTA
2010
15 years 1 months ago
2010
We study the observational theory of Thielecke's CPS-calculus, a distillation of the target language of Continuation-Passing Style transforms. We define a labelled transition...
111
click to vote
FMCAD
2009
Springer
15 years 8 months ago
2009
Springer
Abstract—Symbolic Trajectory Evaluation is an industrialstrength verification method, based on symbolic simulation and abstraction, that has been highly successful in data path ...
128
click to vote
TLCA
1993
Springer
15 years 5 months ago
1993
Springer
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...