Results 1  10
of
142,281
Variants of the Basic Calculus of Constructions
, 2004
"... In this paper, a number of different versions of the basic calculus of constructions that have appeared in the literature are compared and the exact relationships between them are determined. The biggest differences between versions are those between the original version of Coquand and the version i ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper, a number of different versions of the basic calculus of constructions that have appeared in the literature are compared and the exact relationships between them are determined. The biggest differences between versions are those between the original version of Coquand and the version
A Basic Calculus for Verifying Properties of Interacting Objects
"... Abstract We introduce a basic calculus for expressing and proving properties of interacting objects. The objects considered have dynamic behaviour and are organized into object communities in a hierarchical way. After a detailed and formal presentation of the calculus, essential properties of the ca ..."
Abstract
 Add to MetaCart
Abstract We introduce a basic calculus for expressing and proving properties of interacting objects. The objects considered have dynamic behaviour and are organized into object communities in a hierarchical way. After a detailed and formal presentation of the calculus, essential properties
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the ..."
Abstract

Cited by 919 (55 self)
 Add to MetaCart
We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols
Computational LambdaCalculus and Monads
, 1988
"... The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the ..."
Abstract

Cited by 505 (7 self)
 Add to MetaCart
The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise
A Basic Calculus for Modelling Service Level Agreements
 of Lecture Notes in Computer Science
, 2005
"... Abstract. The definition of suitable abstractions and models for identifying, understanding and managing Quality of Service (QoS) constraints is a challenging issue of the Service Oriented Computing paradigm. In this paper we introduce a process calculus where QoS attributes are first class objects ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract. The definition of suitable abstractions and models for identifying, understanding and managing Quality of Service (QoS) constraints is a challenging issue of the Service Oriented Computing paradigm. In this paper we introduce a process calculus where QoS attributes are first class
A Basic Calculus for Verifying Properties of Synchronously Interacting Objects
, 1994
"... The present paper introduces a basic calculus for expressing and proving properties of synchronously interacting objects. The objects considered have dynamic behavior and are organized into object communities in a hierarchical way. We present syntax and semantics of the calculus in detail. Moreo ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The present paper introduces a basic calculus for expressing and proving properties of synchronously interacting objects. The objects considered have dynamic behavior and are organized into object communities in a hierarchical way. We present syntax and semantics of the calculus in detail
An Object Calculus for Asynchronous Communication
 Proceedings of the European Conference on ObjectOriented Programming (ECOOP
, 1991
"... This paper presents a formal system based on the notion of objects and asynchronous communication. Built on Milner's work on ßcalculus, the communication primitive of the formal system is purely asynchronous, which makes it unique among various concurrency formalisms. Computationally this resu ..."
Abstract

Cited by 392 (34 self)
 Add to MetaCart
this results in a consistent reduction of Milner's calculus, while retaining the same expressive power. Seen semantically asynchronous communication induces a surprisingly different framework where bisimulation is strictly more general than its synchronous counterpart. This paper shows basic construction
Guarded Commands, Nondeterminacy and Formal Derivation of Programs
, 1975
"... Socalled "guarded commands" are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniqilely determined by the initial state. ..."
Abstract

Cited by 521 (0 self)
 Add to MetaCart
. For the formal derivation of programs expressed in terms of these constructs, a calculus will be be shown.
1 Analysis of Stochastic Service Guarantees in Communication Networks: A Basic Calculus
"... Abstract — A basic calculus is presented for stochastic service guarantee analysis in communication networks. Central to the calculus are two definitions, maximum(virtual)backlogcentric (m.b.c) stochastic arrival curve and stochastic service curve, which respectively generalize arrival curve and ..."
Abstract
 Add to MetaCart
Abstract — A basic calculus is presented for stochastic service guarantee analysis in communication networks. Central to the calculus are two definitions, maximum(virtual)backlogcentric (m.b.c) stochastic arrival curve and stochastic service curve, which respectively generalize arrival curve
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 574 (50 self)
 Add to MetaCart
in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a calculus on computation trees over realnumbered time. Unfortunately
Results 1  10
of
142,281