Results 1  10
of
2,833,587
A Behavioral Module System for the PiCalculus
 In Proc. of Static Analysis Symposium (SAS
, 2001
"... Distributed messagepassing based asynchronous systems are becoming increasingly important. Such systems are notoriously hard to design and test. A promising approach to help programmers design such programs is to provide a behavioral type system that checks for behavioral properties such as deadloc ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
in designing such a module system. Concretely, we propose a behavioral module system for picalculus programs. Types are CCS processes that correctly approximate the behavior of programs, and by applying model checking techniques to process types one can check many interesting program properties, including
Conformance and Refinement of Behavior in picalculus
"... Process algebras are widely accepted for the specification of software systems. In particular, calculus addresses the description of dynamic systems, and permits their analysis for bisimilarity and other interesting properties. Though bisimilarity determines the equivalence of behavior, more fl ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Process algebras are widely accepted for the specification of software systems. In particular, calculus addresses the description of dynamic systems, and permits their analysis for bisimilarity and other interesting properties. Though bisimilarity determines the equivalence of behavior, more
On the Criteria To Be Used in Decomposing Systems into Modules
 Communications of the ACM
, 1972
"... This paper discusses modularization as a mechanism for improving the flexibility and comprehensibility of a system while allowing the shortening of its development time. The effectiveness of a “modularization ” is dependent upon the criteria used in dividing the system into modules. A system design ..."
Abstract

Cited by 1572 (16 self)
 Add to MetaCart
This paper discusses modularization as a mechanism for improving the flexibility and comprehensibility of a system while allowing the shortening of its development time. The effectiveness of a “modularization ” is dependent upon the criteria used in dividing the system into modules. A system design
Pict: A programming language based on the picalculus
 PROOF, LANGUAGE AND INTERACTION: ESSAYS IN HONOUR OF ROBIN MILNER
, 1997
"... The πcalculus offers an attractive basis for concurrent programming. It is small, elegant, and well studied, and supports (via simple encodings) a wide range of highlevel constructs including data structures, higherorder functional programming, concurrent control structures, and objects. Moreover ..."
Abstract

Cited by 283 (9 self)
 Add to MetaCart
. Moreover, familiar type systems for the calculus have direct counterparts in the πcalculus, yielding strong, static typing for a highlevel language using the πcalculus as its core. This paper describes Pict, a stronglytyped concurrent programming language constructed in terms of an explicitlytypedcalculus
Verbal behavior
, 1957
"... Evolutionary theory has always been plagued by scantiness of evidence. We see the products of evolution but not much of the process. Most of the story happened long ago, and little remains of the early stages. Especially few traces of behavior remain; only recently were there artefacts that could en ..."
Abstract

Cited by 785 (5 self)
 Add to MetaCart
endure. Verbal behavior left no artifacts until the appearence of writing, and that was a very late stage. We shall probably never know precisely what happened, but we ougth to be able to say what might have happended – that is what kind of variations and what kind of contingencies of selection could
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
A Behavioral Notion of Subtyping
 ACM Transactions on Programming Languages and Systems
, 1994
"... The use of hierarchy is an important component of objectoriented design. Hierarchy allows the use of type families, in which higher level supertypes capture the behavior that all of their subtypes have in common. For this methodology to be effective, it is necessary to have a clear understanding of ..."
Abstract

Cited by 514 (18 self)
 Add to MetaCart
The use of hierarchy is an important component of objectoriented design. Hierarchy allows the use of type families, in which higher level supertypes capture the behavior that all of their subtypes have in common. For this methodology to be effective, it is necessary to have a clear understanding
Expressiveness of the piCalculus and the $Calculus
"... Abstract: In this paper we investigate the expressiveness of two process algebras, the picalculus of mobile processes and the $calculus of bounded rational agents. We demonstrate that both models are more expressive than Turing Machines, i.e., they belong to superTuring models of computation. In ..."
Abstract
 Add to MetaCart
Abstract: In this paper we investigate the expressiveness of two process algebras, the picalculus of mobile processes and the $calculus of bounded rational agents. We demonstrate that both models are more expressive than Turing Machines, i.e., they belong to superTuring models of computation
The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm
, 1997
"... In this paper, we analyze a performance model for the TCP Congestion Avoidance algorithm. The model predicts the bandwidth of a sustained TCP connection subjected to light to moderate packet losses, such as loss caused by network congestion. It assumes that TCP avoids retransmission timeouts and alw ..."
Abstract

Cited by 648 (18 self)
 Add to MetaCart
In this paper, we analyze a performance model for the TCP Congestion Avoidance algorithm. The model predicts the bandwidth of a sustained TCP connection subjected to light to moderate packet losses, such as loss caused by network congestion. It assumes that TCP avoids retransmission timeouts
Results 1  10
of
2,833,587