Results 1  10
of
15
Five axioms of alphaconversion
 Ninth international Conference on Theorem Proving in Higher Order Logics TPHOL
, 1996
"... Abstract. We present five axioms of namecarrying lambdaterms identified up to alphaconversion—that is, up to renaming of bound variables. We assume constructors for constants, variables, application and lambdaabstraction. Other constants represent a function Fv that returns the set of free variab ..."
Abstract

Cited by 52 (0 self)
 Add to MetaCart
Abstract. We present five axioms of namecarrying lambdaterms identified up to alphaconversion—that is, up to renaming of bound variables. We assume constructors for constants, variables, application and lambdaabstraction. Other constants represent a function Fv that returns the set of free variables in a term and a function that substitutes a term for a variable free in another term. Our axioms are (1) equations relating Fv and each constructor, (2) equations relating substitution and each constructor, (3) alphaconversion itself, (4) unique existence of functions on lambdaterms defined by structural iteration, and (5) construction of lambdaabstractions given certain functions from variables to terms. By building a model from de Bruijn’s nameless lambdaterms, we show that our five axioms are a conservative extension of HOL. Theorems provable from the axioms include distinctness, injectivity and an exhaustion principle for the constructors, principles of structural induction and primitive recursion on lambdaterms, Hindley and Seldin’s substitution lemmas and
A Framework for High Assurance Security of Distributed Objects
 IN DATABASE SECURITY, X: STATUS AND PROSPECTS
, 1997
"... High assurance security is difficult to achieve in distributed computer systems and databases because of their complexity, nondeterminism and inherent heterogeneity. The practical application of formal methods is the key to high assurance security in open, distributed environments. This paper pro ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
High assurance security is difficult to achieve in distributed computer systems and databases because of their complexity, nondeterminism and inherent heterogeneity. The practical application of formal methods is the key to high assurance security in open, distributed environments. This paper proposes the use of formal methods and a special layered architecture to achieve secure interoperation of heterogeneous distributed objects. The foundation is provided by ROC, a process calculus tailored for concurrent objects. Lying aboveROC in the layered architecture is a metaobject model for creating object models with various programming constructs, megaprogramming facilities and securitymechanisms. Successive layers of the architecture represent more sophisticated toolkits for modeling distributed objects. Since eachlayer inherits ROC's formal foundation, it automatically has an unambiguous semantics and supports verification.
A Formalization of the Process Algebra CCS in Higher Order Logic
, 1992
"... : This paper describes a mechanization in higher order logic of the theory for a subset of Milner's ccs. The aim is to build a sound and effective tool to support verification and reasoning about process algebra specifications. To achieve this goal, the formal theory for pure ccs (no value passing) ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
: This paper describes a mechanization in higher order logic of the theory for a subset of Milner's ccs. The aim is to build a sound and effective tool to support verification and reasoning about process algebra specifications. To achieve this goal, the formal theory for pure ccs (no value passing) is defined in the interactive theorem prover hol, and a set of proof tools, based on the algebraic presentation of ccs, is provided. y Research supported by Consiglio Nazionale delle Ricerche (C.N.R.), Italy. Contents 1 Introduction 2 2 The HOL System 3 3 CCS 4 3.1 Syntax and Operational Semantics : : : : : : : : : : : : : : : : : : : : : : : 4 3.2 Observational Semantics : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 3.3 Axiomatic Characterization of Observational Congruence : : : : : : : : : : 6 3.4 A Modal Logic : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 4 Mechanization of CCS in HOL 8 4.1 The Syntax : : : : : : : : : : : : : : : : : : : : : ...
Process Algebra in PVS
 Proc. of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '99), volume 1579 of Lecture Notes in Computer Science
, 1999
"... The aim of this work is to investigate mechanical support for process algebra, both for concrete applications and theoretical properties. Two approaches are presented using the verification system PVS. One approach declares process terms as an uninterpreted type and specifies equality on terms by ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
The aim of this work is to investigate mechanical support for process algebra, both for concrete applications and theoretical properties. Two approaches are presented using the verification system PVS. One approach declares process terms as an uninterpreted type and specifies equality on terms by axioms. This is convenient for concrete applications where the rewrite mechanisms of PVS can be exploited. For the verification of theoretical results, often induction principles are needed. They are provided by the second approach where process terms are defined as an abstract datatype with a separate equivalence relation. 1 Introduction We investigate the possibilities of obtainingmechanical support for equational reasoning in process algebra. In particular, we consider ACPstyle process algebras [2, 3]. In this framework, processes are represented by terms constructed from atoms (denoting atomic actions) and operators such as choice (nondeterminism), sequential composition, and para...
A Full Formalisation of πCalculus Theory in the Calculus of Constructions
, 1997
"... A formalisation of picalculus in the Coq system is presented. Based on a de Bruijn notation for names, our... ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
A formalisation of picalculus in the Coq system is presented. Based on a de Bruijn notation for names, our...
Analysis of a Guard Condition in Type Theory
, 1997
"... We present a realizability interpretation of coinductive types based on partial equivalence relations (per's). We extract from the per's interpretation sound rules to type recursive definitions. These recursive definitions are needed to introduce "infinite" and "total" objects of coinductive type ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We present a realizability interpretation of coinductive types based on partial equivalence relations (per's). We extract from the per's interpretation sound rules to type recursive definitions. These recursive definitions are needed to introduce "infinite" and "total" objects of coinductive type such as an infinite stream or a nonterminating process. We show that the proposed type system enjoys the basic syntactic properties of subject reduction and strong normalization with respect to a confluent rewriting system first studied by Gimenez. We also compare the proposed type system with those studied by Coquand and Gimenez. In particular, we provide a semantic reconstruction of Gimenez's system which suggests a rule to type nested recursive definitions.
A FirstOrder Syntax for the piCalculus in Isabelle/HOL using Permutations
"... . A formalized theory of alphaconversion for the #calculus in ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. A formalized theory of alphaconversion for the #calculus in
A Hybrid Model for Reasoning about Composed Hardware Systems
 Conference on ComputerAided Verification
, 1994
"... . To formally specify and reason about composed systems, a process algebra is developed that integrates an extended interpreter model. This approach utilizes the interpreter model for device decomposition, while also being able to reason about larger systems that require interdevice communication. B ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. To formally specify and reason about composed systems, a process algebra is developed that integrates an extended interpreter model. This approach utilizes the interpreter model for device decomposition, while also being able to reason about larger systems that require interdevice communication. By combining these approaches, convenient notations are available to specify and verify both device independent properties (e.g., instruction sets) and device interdependent properties (e.g., communication protocols). 1 Introduction Previous approaches to system verification have decomposed systems into several hardware and software layers that may be independently verified [3, 9, 11, 17]. Each layer consists of an implementation description and a more abstract specification. The layers are joined, or "stacked", with each implementation description serving as the specification for the next lower layer. The hardware layers of these systems have been modeled as a microprocessor with memory. Th...
A Formal Process Calculus And Execution Model For Distributed Agent Computing
, 1997
"... Jody R. Threet (Ph.D. in Computer Science) A Formal Process Calculus and Execution Model for Distributed Agent Computing (55 pp.  V Chapters ) Directed by Professor Sujeet Shenoi (237 words) Most low level machine languages reflect the hardware on which they execute. Current hardware promotes the d ..."
Abstract
 Add to MetaCart
Jody R. Threet (Ph.D. in Computer Science) A Formal Process Calculus and Execution Model for Distributed Agent Computing (55 pp.  V Chapters ) Directed by Professor Sujeet Shenoi (237 words) Most low level machine languages reflect the hardware on which they execute. Current hardware promotes the development of sequential machine languages. Such languages do not provide atomic forms of communication which is a fundamental operation in distributed computing and severely restricts the expression of finegrained concurrency. Furthermore, most high and low level programming languages lack formal semantics. This makes the analysis, i.e. the specification and proof of abstract properties, practically impossible. This work involves the design of a formal concurrent language which is a robust extension of an exiting flawed concurrent language. The fundamental event in the formal concurrent language is communication, so that computation consists of distributed agents communicating values. A co...
Verification de l'equivalence du picalcul dans HOL
, 1994
"... : pto) : amohamed@loria.fr Unite de recherche INRIA Lorraine Technopole de NancyBrabois, Campus scientifique, 615 rue de Jardin Botanique, BP 101, 54600 VILLERS LE S NANCY (France) Telephone : (33) 83 59 30 30  Telecopie : (33) 83 27 83 19 Antenne de Metz, technopole de Metz 2000, 4 rue Marconi, ..."
Abstract
 Add to MetaCart
: pto) : amohamed@loria.fr Unite de recherche INRIA Lorraine Technopole de NancyBrabois, Campus scientifique, 615 rue de Jardin Botanique, BP 101, 54600 VILLERS LE S NANCY (France) Telephone : (33) 83 59 30 30  Telecopie : (33) 83 27 83 19 Antenne de Metz, technopole de Metz 2000, 4 rue Marconi, 55070 METZ Telephone : (33) 87 20 35 00  Telecopie : (33) 87 76 39 Verification of ßcalculus equivalence in HOL Abstract: This paper describes a definitionnelle presentation in higher order logic of the theory for Milner's ßcalculus. The algebraic laws for the ßcalculus are proved as theorems in the HOL logic and a set of proof tools is provided. So our system is in fact a secure environment for reasonning about equivalence in the ßcalulus. As a case study, we show by induction the correction of the specification of the addition in ßcalculus. Keywords: ßcalculus, HOL 1 1 Introduction Les alg`ebres de processus sont un cadre naturel pour d'ecrire et analyser les syst`emes conc...