Sciweavers

265 search results - page 26 / 53
» entcs 2007
Sort
View
ENTCS
2007
113views more  ENTCS 2007»
15 years 4 months ago
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
Kevin Donnelly, Hongwei Xi
ENTCS
2007
85views more  ENTCS 2007»
15 years 3 months ago
Stochastic Modelling of Communication Protocols from Source Code
A major development in qualitative model checking was the jump to verifying properties of source code directly, rather than requiring a separately specified model. We describe an...
Michael J. A. Smith
ENTCS
2007
107views more  ENTCS 2007»
15 years 3 months ago
Formal Translation of Bytecode into BoogiePL
Many modern program verifiers translate the program to be verified and its specification into a simple intermediate representation and then compute verification conditions on ...
Hermann Lehner, Peter Müller
ENTCS
2007
69views more  ENTCS 2007»
15 years 4 months ago
Modal Logic Characterization of Markovian Testing and Trace Equivalences
Markovian testing and trace equivalences have been recently proposed as reasonable alternatives to Markovian bisimilarity, as both of them induce at the Markov chain level an aggr...
Marco Bernardo, Stefania Botta
111
Voted
ENTCS
2007
116views more  ENTCS 2007»
15 years 4 months ago
A Logical Characterisation of Static Equivalence
The work of Abadi and Fournet introduces the notion of a frame to describe the knowledge of the environment of a cryptographic protocol. Frames are lists of terms; two frames are ...
Hans Hüttel, Michael D. Pedersen