Results 1  10
of
10
Logical Concepts in Cryptography
, 2006
"... This paper is about the exploration of logical concepts in cryptography and their linguistic abstraction and modeltheoretic combination in a logical system, called CPL (for Cryptographic Protocol Logic). ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
This paper is about the exploration of logical concepts in cryptography and their linguistic abstraction and modeltheoretic combination in a logical system, called CPL (for Cryptographic Protocol Logic).
The rewriting logic semantics project: a progress report
 IN: OWE O, STEFFEN M, TELLE J (EDS) FUNDAMENTALS OF COMPUTATION THEORY, VOLUME 6914 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2011
"... Rewriting logic is an executable logical framework well suited for the semantic definition of languages. Any such framework has to be judged by its effectiveness to bridge the existing gap between language definitions on the one hand, and language implementations and language analysis tools on the ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Rewriting logic is an executable logical framework well suited for the semantic definition of languages. Any such framework has to be judged by its effectiveness to bridge the existing gap between language definitions on the one hand, and language implementations and language analysis tools on the other. We give a progress report on how researchers in the rewriting logic semantics project are narrowing the gap between theory and practice in areas such as: modular semantic definitions of languages; scalability to real languages; support for real time; semantics of software and hardware modeling languages; and semanticsbased analysis tools such as static analyzers, model checkers, and program provers.
A Rewriting Logic Approach to Operational Semantics (Extended Abstract)
 SOS
, 2007
"... This paper shows how rewriting logic semantics (RLS) can be used as a computational logic framework for operational semantic definitions of programming languages. Several operational semantics styles are addressed: bigstep and smallstep structural operational semantics (SOS), modular SOS, reductio ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper shows how rewriting logic semantics (RLS) can be used as a computational logic framework for operational semantic definitions of programming languages. Several operational semantics styles are addressed: bigstep and smallstep structural operational semantics (SOS), modular SOS, reduction semantics with evaluation contexts, and continuationbased semantics. Each of these language definitional styles can be faithfully captured as an RLS theory, in the sense that there is a onetoone correspondence between computational steps in the original language definition and computational steps in the corresponding RLS theory. A major goal of this paper is to show that RLS does not force or preimpose any given language definitional style, and that its flexibility and ease of use makes RLS an appealing framework for exploring new definitional styles.
The Representational Adequacy of HYBRID
"... The Hybrid system (Ambler et al., 2002b), implemented within Isabelle/HOL, allows object logics to be represented using higher order abstract syntax (HOAS), and reasoned about using tactical theorem proving in general and principles of (co)induction in particular. The form of HOAS provided by Hybrid ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The Hybrid system (Ambler et al., 2002b), implemented within Isabelle/HOL, allows object logics to be represented using higher order abstract syntax (HOAS), and reasoned about using tactical theorem proving in general and principles of (co)induction in particular. The form of HOAS provided by Hybrid is essentially a lambda calculus with constants. Of fundamental interest is the form of the lambda abstractions provided by Hybrid. The user has the convenience of writing lambda abstractions using names for the binding variables. However each abstraction is actually a definition of a de Bruijn expression, and Hybrid can unwind the user’s abstractions (written with names) to machine friendly de Bruijn expressions (without names). In this sense the formal system contains a hybrid of named and nameless bound variable notation. In this paper, we present a formal theory in a logical framework which can be viewed as a model of core Hybrid, and state and prove that the model is representationally adequate for HOAS. In particular, it is the canonical translation function from λexpressions to Hybrid that witnesses adequacy. We also prove two results that characterise how Hybrid represents certain classes of λexpressions. The Hybrid system contains a number of different syntactic classes of expression, and associated abstraction mechanisms. Hence this paper also aims to provide a selfcontained theoretical introduction to both the syntax and key ideas of the system; background in automated theorem proving is not essential, although this paper will be of considerable interest to those who wish to work with Hybrid in Isabelle/HOL.
3.5. Deep Inference and Categorical Axiomatizations 5 3.6. Proof Nets and Combinatorial Characterization of Proofs 5
"... c t i v it y e p o r t ..."
(Show Context)
ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE
"... ingénieur informaticien diplômé EPF de nationalité suisse et originaire de Charmey (Lac) (FR) acceptée sur proposition du jury: ..."
Abstract
 Add to MetaCart
(Show Context)
ingénieur informaticien diplômé EPF de nationalité suisse et originaire de Charmey (Lac) (FR) acceptée sur proposition du jury: