Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Broadcast psi-calculi with an application to wireless protocols
J Borgström, S Huang, M Johansson… - Software & Systems …, 2015 - Springer
Psi-calculi is a parametric framework for the extensions of pi-calculus, with arbitrary data
structures and logical assertions for facts about data. In this paper we add primitives for …
structures and logical assertions for facts about data. In this paper we add primitives for …
[HTML][HTML] A generic type system for higher-order Ψ-calculi
H Hüttel, S Lybech, AR Bendixen… - Information and …, 2024 - Elsevier
Abstract The Higher-Order Ψ-calculus framework (HOΨ) by Parrow et al. is a generalisation
of many first-and higher-order extensions of the π-calculus. In this paper we present a …
of many first-and higher-order extensions of the π-calculus. In this paper we present a …
HOCore in coq
We consider a recent publication on higher-order process calculi [12] and describe how its
main results have been formalized in the Coq proof assistant. We highlight a number of …
main results have been formalized in the Coq proof assistant. We highlight a number of …
The reflective higher-order calculus: encodability, typability and separation
S Lybech - Information and Computation, 2024 - Elsevier
Abstract The ρ-calculus (Reflective Higher-Order Calculus) of Meredith and Radestock is a π-
calculus-like language with unusual features, notably, structured names, runtime generation …
calculus-like language with unusual features, notably, structured names, runtime generation …
Psi-calculi in Isabelle
This paper presents a mechanisation of psi-calculi, a parametric framework for modelling
various dialects of process calculi including (but not limited to) the pi-calculus, the applied pi …
various dialects of process calculi including (but not limited to) the pi-calculus, the applied pi …
Psi-calculi in Isabelle
J Bengtson, J Parrow - Theorem Proving in Higher Order Logics: 22nd …, 2009 - Springer
Psi-calculi are extensions of the pi-calculus, accommodating arbitrary nominal datatypes to
represent not only data but also communication channels, assertions and conditions, giving …
represent not only data but also communication channels, assertions and conditions, giving …
A Generic Type System for Higher-Order -calculi
AR Bendixen, BB Bojesen, H Hüttel… - ar** Composite Subjects
Many type systems have been presented in the literature for variants of the pi-calculus, but
none of them are able to handle composite subjects such as those found in the language …
none of them are able to handle composite subjects such as those found in the language …
The psi-calculi workbench: A generic tool for applied process calculi
Psi-calculi is a parametric framework for extensions of the pi-calculus with arbitrary data and
logic. All instances of the framework inherit machine-checked proofs of the metatheory such …
logic. All instances of the framework inherit machine-checked proofs of the metatheory such …
A case study in programming coinductive proofs: Howe's method
Bisimulation proofs play a central role in programming languages in establishing rich
properties such as contextual equivalence. They are also challenging to mechanize, since …
properties such as contextual equivalence. They are also challenging to mechanize, since …