A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
A sort inference algorithm for the polyadic π-calculus
1993
Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93
Preserved Fulltext
In Section 4 the sort inference algorithm is presented as a collection of rules allowing agents to be constructed along with a suitable sorting, in the same way that type inference algorithms for functional ...
Finally in Section 6 the algorithm needed to combine two existing sortings into a sorting for a compound agent is given in a more concrete form, which should make it clear that the sort inference algorithm ...
doi:10.1145/158511.158701
dblp:conf/popl/Gay93
fatcat:nepyulstjfdhhlsjqfwuy6rp6y
Generating Type Systems for Process Graphs
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
We introduce a hypergraph-based process calculus with a generic type system. ...
We demonstrate the key ideas behind the type system, namely that there exists a hypergraph morphism from each process graph into its type, and show how it can be used for the analysis of processes. ...
a type inference algorithm. ...
doi:10.1007/3-540-48320-9_25
fatcat:okwd3nytwjg7rkahw3gmzus5qm
ACVisualizer: A visualization tool for APi-calculus
2008
Multiagent and Grid Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this article, a visualization tool for the APi-calculus is proposed. ...
The ability to provide instant demonstration of a designed system to the user and the support for verification and validation of such systems specified by the calculus would prove to be a great asset for ...
Polyadic Pi-calculus In contrast to Pi-calculus, which is essentially monadic, polyadic Pi-calculus proposed by Milner in 1991 [9] as an extension and refinement of the Pi-calculus, accepts tuples of ...
doi:10.3233/mgs-2008-4303
fatcat:huyrwoi7pbgt5kbd4cnnxr6mva
The Attributed Pi-Calculus with Priorities
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A stochastic simulation algorithm for the attributed π-calculus is derived from its stochastic semantics. ...
Pi-Calculus with Priorities We start from the π-calculus with priorities, for which we provide a nondeterministic and a stochastic operational semantics. ...
Acknowledgements We thank Francois Lemaire for helping us to compute the equilibrium level for our Euglena models, Stefan Rybacki for his support in implementing the attributed π-calculus, and Céline Kuttler ...
doi:10.1007/978-3-642-11712-1_2
fatcat:b2kosq6m2jgufmudmjevvwvany
Trust in the pi-calculus
2001
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '01
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
An algorithm for deducing the most general types for the type system is presented. ...
We introduce a new system of trust analysis for concurrent and distributed systems using the π-calculus [13, 14, 15 ] as a modelling tool. ...
ACKNOWLEDGEMENTS Hepburn was supported by a University of Tasmania Postgraduate Research Scholarship. The authors are grateful to the anonymous referees for their insightful and helpful comments. ...
doi:10.1145/773184.773196
dblp:conf/ppdp/HepburnW01
fatcat:j4d7bcucyne6lp4mvv4iyn2ubu
A Survey of Name-Passing Calculi and Crypto-Primitives
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
As a consequence, we decided to concentrate on few papers that introduce the main ideas, in the hope that discussing them in some detail will provide sufficient insight for further reading. ...
The paper surveys the literature on high-level name-passing process calculi, and their extensions with cryptographic primitives. The survey is by no means exhaustive, for essentially two reasons. ...
Starting from the typed pi-calculus, we can classify channels into different groups (usually called sorts). ...
doi:10.1007/978-3-540-24631-2_3
fatcat:cjtedz44njfzvntbdzpyj5hjga
First-Order Resolution Methods for Modal Logics
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Because of the breadth of the area and the many applications we focus on the use of first-order resolution methods for modal logics. ...
In this paper we give an overview of results for modal logic which can be shown using techniques and methods from first-order logic and resolution. ...
Basic path logic has a sort S W for the set of worlds W and a sort S i for each modality 2 i in the logic. For each i there is a binary, left-associative function [·, ·] i of sort S W ×S i → W . ...
doi:10.1007/978-3-642-37651-1_15
fatcat:pta3fxqsnfal3cigcnryyxjcba
Expressiveness of Generic Process Shape Types
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We evaluate the expressiveness of the extended system by showing that shape types are more expressive than an implicitly typed pi-calculus and an explicitly typed Mobile Ambients. ...
Shape types are a general concept of process types which work for many process calculi. We extend the previously published Poly* system of shape types to support name restriction. ...
Moreover we would like to generalize actions so that calculi with structured messages, like the Spi calculus [5] , can be handled. ...
arXiv:1003.6096v1
fatcat:em3h5n4qxjglpcwktvervdfhnq
Mobile Processes: A Commented Bibliography
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
π-calculus of Milner, Parrow and Walker for example, and motile processes, which can exhibit motion, as modelled in the ambient calculus of Cardelli and Gordon. ...
A common characteristic of the algebraic frameworks presented in this paper is the use of names as first class values and the support for the dynamic generation of new, fresh names. ...
Acknowledgments I would like to thank Uwe Nestmann and Peter Sewell for helpful comments. Luca Cardelli and Andy Gordon commented on a previous version of this text. ...
doi:10.1007/3-540-45510-8_11
fatcat:ksp2ci37rbc5jbwokvcs2ugspq
Linearity, session types and the Pi calculus
2014
Mathematical Structures in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
In the case of the linear pi calculus we also provide a completeness result. ...
We present a type system based on session types that works on a conventional pi calculus. ...
The author would like to thank INRIA and ERCIM for such an opportunity. ...
doi:10.1017/s0960129514000176
fatcat:umamec72qjcp3grcfszonteaq4
A Translation of Beta-binders in a Prioritized Pi-calculus
2009
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
No notion of enclosing compartment can instead be found in pi@, a dialect of the pi-calculus where actions are associated with a priority value driving their execution and where channel names can have ...
As recently shown, pi@ is a suitable language for encoding both Bio-Ambients and Brane Calculi, two of the most well-known formalisms for modelling biological scenarios. ...
Notably, π@ comes with a stochastic extension and a simulation algorithm [14] that could be the basis of automated tools for the analysis of biological behaviours. ...
doi:10.1016/j.entcs.2009.02.008
fatcat:hc5v6yt6j5b6tnw6jlu4nehipm
Typed generic traversal with term rewriting strategies
2003
The Journal of Logic and Algebraic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The calculus employs a many-sorted type system extended by designated generic strategy types γ . ...
A typed model of strategic term rewriting is developed. The key innovation is that generic traversal is covered. To this end, we define a typed rewriting calculus S γ . ...
Many-sorted type-preserving strategies. for strategy types (cf. [pi.1]). ...
doi:10.1016/s1567-8326(02)00028-0
fatcat:slqvn77mvnhztb5vdmudz4ubyu
The Psi-Calculi Workbench
2015
ACM Transactions on Embedded Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
ACKNOWLEDGMENTS We thank the anonymous referees of ACSD 2013 for their comments on an earlier version of this paper. ...
In the Pi instance, corresponding to the polyadic pi-calculus, terms are simply names a, b, c . . . and the conditions are equality tests on names. ...
ProVerif [Blanchet 2011 ] is a verification tool for the applied pi-calculus [Abadi and Fournet 2001] , an extension of the pi-calculus that is specialised for security protocol verification. ...
doi:10.1145/2682570
fatcat:o5kfinnv3jdbhd5acytllwoa5e
Typed Generic Traversal With Term Rewriting Strategies
[article]
2002
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
The calculus employs a many-sorted type system extended by designated generic strategy types gamma. ...
A typed model of strategic term rewriting is developed. The key innovation is that generic traversal is covered. To this end, we define a typed rewriting calculus S'_gamma. ...
In Figure 12 , we extend the basic calculus S ′ 0 with concepts for polyadic strategies in a straightforward manner. There are distinguished symbols for the empty tuple, and ·, · for pairing terms. ...
arXiv:cs/0205018v2
fatcat:jbqr27ef7rgfnni5urp6xunz7q
Notes on Nominal Calculi for Security and Mobility
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
These notes introduce three nominal calculi-the pi calculus, the spi calculus, and the ambient calculus. We describe some typical techniques, and survey related work. ...
There is great interest in applying nominal calculi-computational formalisms that include dynamic name generation-to the problems of programming, specifying, and verifying secure and mobile computations ...
Castagna commented on a draft of these notes. ...
doi:10.1007/3-540-45608-2_5
fatcat:ma2go342yjfhditghe3qlr277i
« Previous
Showing results 1 — 15 out of 66 results