Sciweavers

MSCS
2008
97views more  MSCS 2008»
13 years 4 months ago
Logical relations for monadic types
Abstract. Software security can be ensured by specifying and verifying security properties of software using formal methods with strong theoretical bases. In particular, programs c...
Jean Goubault-Larrecq, Slawomir Lasota, David Nowa...
ENTCS
2007
82views more  ENTCS 2007»
13 years 4 months ago
Syntactic Logical Relations for Polymorphic and Recursive Types
The method of logical relations assigns a relational interpretation to types that expresses operational invariants satisfied by all terms of a type. The method is widely used in ...
Karl Crary, Robert Harper
ENTCS
2008
85views more  ENTCS 2008»
13 years 4 months ago
Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking
In the book on Advanced Topics in Types and Programming Languages, Crary illustrates the reasoning technique of logical relations in a case study about equivalence checking. He pr...
Julien Narboux, Christian Urban
ICALP
2000
Springer
13 years 7 months ago
Lax Logical Relations
Lax logical relations are a categorical generalisation of logical relations; though they preserve product types, they need not preserve exponential types. But, like logical relatio...
Gordon D. Plotkin, John Power, Donald Sannella, Ro...
ESOP
2006
Springer
13 years 8 months ago
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
Amal J. Ahmed
ECAI
2006
Springer
13 years 8 months ago
Discovering Missing Background Knowledge in Ontology Matching
Semantic matching determines the mappings between the nodes of two graphs (e.g., ontologies) by computing logical relations (e.g., subsumption) holding among the nodes that corresp...
Fausto Giunchiglia, Pavel Shvaiko, Mikalai Yatskev...
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
13 years 8 months ago
On Completeness of Logical Relations for Monadic Types
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
Slawomir Lasota, David Nowak, Yu Zhang
CSL
1999
Springer
13 years 8 months ago
Pre-logical Relations
Abstract. We study a weakening of the notion of logical relations, called prelogical relations, that has many of the features that make logical relations so useful but having furth...
Furio Honsell, Donald Sannella
CSL
2004
Springer
13 years 9 months ago
Complete Lax Logical Relations for Cryptographic Lambda-Calculi
Abstract. Security properties are profitably expressed using notions of contextual equivalence, and logical relations are a powerful proof technique to establish contextual equiva...
Jean Goubault-Larrecq, Slawomir Lasota, David Nowa...
LICS
2008
IEEE
13 years 10 months ago
Structural Logical Relations
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed λ-calculi. Histo...
Carsten Schürmann, Jeffrey Sarnat