Results 11 to 20 of about 5,002 (241)
Rewriting Modulo β in the λΠ-Calculus Modulo [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 The lambda-Pi-calculus Modulo is a variant of the lambda-calculus with dependent types where beta-conversion is extended with user-defined rewrite rules.
Ronan Saillard
doaj +1 more source
Psi-Calculi Revisited: Connectivity and Compositionality [PDF]
Logical Methods in Computer Science, 2020 Psi-calculi is a parametric framework for process calculi similar to popular pi-calculus extensions such as the explicit fusion calculus, the applied pi-calculus and the spi calculus.
Johannes Åman Pohjola
doaj +1 more source
Trees from Functions as Processes [PDF]
Logical Methods in Computer Science, 2018 Levy-Longo Trees and Bohm Trees are the best known tree structures on the {\lambda}-calculus. We give general conditions under which an encoding of the {\lambda}-calculus into the {\pi}-calculus is sound and complete with respect to such trees.
Davide Sangiorgi, Xian Xu
doaj +1 more source
Executable Behaviour and the π-Calculus (extended abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Reactive Turing machines extend classical Turing machines with a facility to model observable interactive behaviour. We call a behaviour executable if, and only if, it is behaviourally equivalent to the behaviour of a reactive Turing machine.
Bas Luttik, Fei Yang
doaj +1 more source
Acyclic Solos and Differential Interaction Nets [PDF]
Logical Methods in Computer Science, 2010 We present a restriction of the solos calculus which is stable under reduction and expressive enough to contain an encoding of the pi-calculus. As a consequence, it is shown that equalizing names that are already equal is not required by the encoding of ...
Thomas Ehrhard, Olivier Laurent
doaj +1 more source
Jordanian Journal of Computers and Information Technology, 2020 This paper deals with modeling and verification of software systems by combining UML diagrams and Pi-calculus. UML 2.0 Activity diagrams are used for modeling the behavior of software systems, while Pi-calculus is used for semantic and verification ...
Raida Elmansouri +4 more
doaj +1 more source
PicNIc - Pi-calculus Non-interference checker [PDF]
2008 8th International Conference on Application of Concurrency to System Design, 2008 PICNIC is a tool for verifying security properties of systems, namely non-interference properties of processes expressed as terms of the pi-calculus with two security levels and declassification primitives. More precisely, it checks whether inserting a process into two different high contexts no information leakage to the low level observers occurs ...
CRAFA, Silvia +4 more
openaire +2 more sources
The Cpi-calculus: a Model for Confidential Name Passing [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Sharing confidential information in distributed systems is a necessity in many applications, however, it opens the problem of controlling information sharing even among trusted parties.
Ivan Prokić
doaj +1 more source
Evaluating functions as processes [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 A famous result by Milner is that the lambda-calculus can be simulated inside the pi-calculus. This simulation, however, holds only modulo strong bisimilarity on processes, i.e. there is a slight mismatch between beta-reduction and how it is simulated in
Beniamino Accattoli
doaj +1 more source
Pi+-Calculus: A Calculus for Concurrent Processes with Constraints
CLEI Electronic Journal, 1998 The Pi-calculus is a formal model of concurrent computation based on the notion of naming. It has an important role to play in the search for more abstract theories of concurrent and communicating systems.
Juan Francisco Diaz +2 more
doaj +1 more source