Sciweavers

125 search results - page 20 / 25
» Importing HOL into Isabelle HOL
Sort
View
ENTCS
2007
97views more  ENTCS 2007»
13 years 7 months ago
A Head-to-Head Comparison of de Bruijn Indices and Names
Often debates about pros and cons of various techniques for formalising lambda-calculi rely on subjective arguments, such as de Bruijn indices are hard to read for humans or nomin...
Stefan Berghofer, Christian Urban
CCS
2010
ACM
13 years 5 months ago
Developing security protocols by refinement
We propose a development method for security protocols based on stepwise refinement. Our refinement strategy guides sformation of abstract security goals into protocols that are s...
Christoph Sprenger, David A. Basin
FMCO
2009
Springer
120views Formal Methods» more  FMCO 2009»
13 years 5 months ago
A Framework for Reasoning on Component Composition
The main characteristics of component models is their strict structure enabling better code reuse. Correctness of component composition is well understood formally but existing wor...
Ludovic Henrio, Florian Kammüller, Muhammad U...
JLP
2010
142views more  JLP 2010»
13 years 2 months ago
Relational bytecode correlations
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...
Lennart Beringer
TPHOL
2006
IEEE
14 years 1 months ago
Otter/Ivy
Abstract. We compare the styles of several proof assistants for mathematics. We present Pythagoras’ proof of the irrationality of √ 2 both informal and formalized in (1) HOL, (...
Michael Beeson, William McCune