Filters








5,587 Hits in 4.9 sec

Model checking of macro processes [chapter]

Hardi Hungar
1994 Lecture Notes in Computer Science  
The alternationfree modal mu-calculus has already been shown to be decidable for contextfree processes, with a worst case complexity which is linear in the size of the system description and exponential  ...  Decidability of modal logics is not limited to finite systems.  ...  A higher-order formula (ttOF) is finite iff its components are finite.  ... 
doi:10.1007/3-540-58179-0_52 fatcat:2jsibarl2faihmbb4ag7mff6qi

Page 1317 of Mathematical Reviews Vol. , Issue 2003B [page]

2003 Mathematical Reviews  
Second, it gives a unified presentation of both first-order and higher-order process calculi.  ...  A natural translation from pi calculus to Lamp is shown to preserve both operational and al- gebraic semantics.  ... 

Environmental Bisimulations for Probabilistic Higher-order Languages

Davide Sangiorgi, Valeria Vignudelli
2019 ACM Transactions on Programming Languages and Systems  
Environmental bisimulations for probabilistic higher-order languages are studied.  ...  As representative calculi, call-by-name and call-by-value λcalculus, and a (call-by-value) λ-calculus extended with references (i.e., a store) are considered.  ...  Checking computer programs for equivalence is a crucial, but challenging, problem.  ... 
doi:10.1145/3350618 fatcat:jrjqpy6xcfehtcs5pmvag3n23u

Environmental bisimulations for probabilistic higher-order languages

Davide Sangiorgi, Valeria Vignudelli
2016 Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL 2016  
Environmental bisimulations for probabilistic higher-order languages are studied.  ...  As representative calculi, call-by-name and call-by-value λcalculus, and a (call-by-value) λ-calculus extended with references (i.e., a store) are considered.  ...  Checking computer programs for equivalence is a crucial, but challenging, problem.  ... 
doi:10.1145/2837614.2837651 dblp:conf/popl/SangiorgiV16 fatcat:sy7akxi3gbdjrfcgkjwaq46gkq

Environmental bisimulations for probabilistic higher-order languages

Davide Sangiorgi, Valeria Vignudelli
2016 SIGPLAN notices  
Environmental bisimulations for probabilistic higher-order languages are studied.  ...  As representative calculi, call-by-name and call-by-value λcalculus, and a (call-by-value) λ-calculus extended with references (i.e., a store) are considered.  ...  Checking computer programs for equivalence is a crucial, but challenging, problem.  ... 
doi:10.1145/2914770.2837651 fatcat:edzysoznqvhmnkmw6n3egnlbiq

Contextual equivalence for higher-order pi-calculus revisited

Alan Jeffrey, Julian Rathke, Davide Sangiorgi
2005 Logical Methods in Computer Science  
It has been studied intensively by Sangiorgi in his thesis where a characterisation of a contextual equivalence for higher-order pi-calculus is provided using labelled transition systems and normal bisimulations  ...  using labelled transitions and bisimulations for higher-order pi-calculus with recursive types also.  ...  Work towards this began several years ago with various proposals for higher-order versions of known calculi [14, 4] , including the higher-order π-calculus or HOπ [10] .  ... 
doi:10.2168/lmcs-1(1:4)2005 fatcat:e3hzrnb6vfdjvlukazxfs4oigm

Bisimulation-invariant PTIME and higher-dimensional μ-calculus

Martin Otto
1999 Theoretical Computer Science  
It is also shown that higher-dimensional p-calculus is undecidable for satisfiability in finite structures, and even Et-hard over general structures.  ...  equivalence.  ...  In a further study of its expressive power over finite and infinite structures, the higher-dimensional p-calculus is shown to be undecidable for satisfiability in finite models as well as in general models  ... 
doi:10.1016/s0304-3975(98)00314-4 fatcat:klwctsikb5fhpm45567db6vn6y

Psi-calculi: Mobile Processes, Nominal Data, and Logic

Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor
2009 2009 24th Annual IEEE Symposium on Logic In Computer Science  
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data.  ...  Psi-calculi can be even more general, for example by allowing structured channels, higherorder formalisms such as the lambda calculus for data structures, and a predicate logic for assertions.  ...  For example, we can use a higher-order logic for assertions and conditions, and higher-order formalisms such as the lambda calculus for data terms and channels.  ... 
doi:10.1109/lics.2009.20 dblp:conf/lics/BengtsonJPV09 fatcat:yh3f2i6langnhk4vzsessqzzve

Higher-order psi-calculi

JOACHIM PARROW, JOHANNES BORGSTRÖM, PALLE RAABJERG, JOHANNES ÅMAN POHJOLA
2013 Mathematical Structures in Computer Science  
In earlier work we explored the expressiveness and algebraic theory Psi-calculi, which form a parametric framework for extensions of the pi-calculus.  ...  In the current paper we consider higher-order psi-calculi through a technically surprisingly simple extension of the framework, and show how an arbitrary psi-calculus can be lifted to its higher-order  ...  Acknowledgements We are very grateful to Magnus Johansson and Björn Victor for constructive and inspiring discussions.  ... 
doi:10.1017/s0960129513000170 fatcat:nylwhlhegjcnzidfasa5a4r4pa

Higher-level synchronising devices in Meije-SCCS

Robert De Simone
1985 Theoretical Computer Science  
The proof of our main result has led us to a technical shaping of equivalence proofs for open expressions which shows to be interesting in its own fight.  ...  We prove they are higher-level nonprimitive operators from the original SCCS calculus, showing how to meet their behaviours with primitive expressions.  ...  Boudol for his support.  ... 
doi:10.1016/0304-3975(85)90093-3 fatcat:rmcpaiyiirbx3hjrkuwwexbsty

Weak Nominal Modal Logic [chapter]

Joachim Parrow, Tjark Weber, Johannes Borgström, Lars-Henrik Eriksson
2017 Lecture Notes in Computer Science  
In this way we get a general framework for weak bisimulation and logic in which formalisms such as the pi-calculus and its many variants can be uniformly represented.  ...  We prove that logical equivalence coincides with bisimilarity and explore a few variants of the logic.  ...  Koutavas and Hennessey (2012) [17] give a weak HML for a higher-order pi-calculus with both higher-order and first-order communication using an environment-sensitive LTS.  ... 
doi:10.1007/978-3-319-60225-7_13 fatcat:7vggx4l5mvcitdijzsatardi24

Mobile Processes: A Commented Bibliography [chapter]

Silvano Dal Zilio
2001 Lecture Notes in Computer Science  
We propose a short bibliographic survey of calculi for mobile processes.  ...  of Milner, Parrow and Walker for example, and motile processes, which can exhibit motion, as modelled in the ambient calculus of Cardelli and Gordon.  ...  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

Modal Logics for Nominal Transition Systems [article]

Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramūnas Forsberg Gutkovas, Tjark Weber
2021 arXiv   pre-print
A Hennessy-Milner logic for these systems is introduced, and proved adequate and expressively complete for bisimulation equivalence.  ...  A main technical novelty is the use of finitely supported infinite conjunctions.  ...  We also thank Ross Horne for discussions on modal logics for open bisimilarity, and for pointing out an inadequacy of an earlier version of F/L-bisimilarity.  ... 
arXiv:1904.02564v3 fatcat:ttnxwh57grajbn7yyx2d6frxjy

Free-Algebra Models for the π-Calculus [chapter]

Ian Stark
2005 Lecture Notes in Computer Science  
The finite π-calculus has an explicit set-theoretic functor-category model that is known to be fully abstract for strong late bisimulation congruence.  ...  Thus we obtain a novel algebraic description for models of the π-calculus, and validate an existing construction as the universal such model.  ...  In a suitable computational metalanguage these give a semantics for programing languages that combine higher-order functions with communicating concurrency.  ... 
doi:10.1007/978-3-540-31982-5_10 fatcat:w3p23azufza25blubc25u5eixq

Untyped Recursion Schemes and Infinite Intersection Types [chapter]

Takeshi Tsukada, Naoki Kobayashi
2010 Lecture Notes in Computer Science  
A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then model-checked.  ...  schemes, so that the model checking can be reduced to type checking as in recent work by Kobayashi and Ong for typed recursion schemes.  ...  We would like to thank anonymous referees for useful comments. This work was partially supported by Kakenhi 20240001.  ... 
doi:10.1007/978-3-642-12032-9_24 fatcat:fqmrmf2yqjbozkrx2nbuy4frvq
« Previous Showing results 1 — 15 out of 5,587 results