Följ
Joachim Parrow
Joachim Parrow
Professor in Computing Science, Uppsala University
Verifierad e-postadress på it.uu.se
Titel
Citeras av
Citeras av
År
A calculus of mobile processes, I
R Milner, J Parrow, D Walker
Information and computation 100 (1), 1-40, 1992
55831992
The concurrency workbench: A semantics-based tool for the verification of concurrent systems
R Cleaveland, J Parrow, B Steffen
ACM Transactions on Programming Languages and Systems (TOPLAS) 15 (1), 36-72, 1993
8081993
An introduction to the π-calculus
J Parrow
Handbook of process algebra, 479-543, 2001
3392001
The fusion calculus: Expressiveness and symmetry in mobile processes
J Parrow, B Victor
Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science …, 1998
3091998
Modal logics for mobile processes
R Milner, J Parrow, D Walker
Theoretical Computer Science 114 (1), 149-171, 1993
2911993
The concurrency workbench
R Cleaveland, J Parrow, B Steffen
Automatic Verification Methods for Finite State Systems: International …, 1990
2891990
An algebraic verification of a mobile network
F Orava, J Parrow
Formal aspects of computing 4, 497-543, 1992
1351992
Algebraic theories for name-passing calculi
J Parrow, D Sangiorgi
Information and Computation 120 (2), 174-197, 1995
1291995
A Semantics Based Verification Tool for Finite State Systems.
R Cleaveland, J Parrow, B Steffen
PSTV, 287-302, 1989
1201989
An improved failures equivalence for finite-state systems with a reduction algorithm
A Valmari, M Tienari
Proceedings of the IFIP WG6. 1 International Symposium on Protocol …, 1991
1141991
Submodule construction as equation solving in CCS
J Parrow
Theoretical Computer Science 68 (2), 175-202, 1989
1091989
Psi-calculi: a framework for mobile processes with nominal data and logic
J Bengtson, M Johansson, J Parrow
Logical Methods in Computer Science 7, 2011
1032011
Deciding bisimulation equivalences for a class of non-finite-state programs
B Jonsson, J Parrow
Information and computation 107 (2), 272-302, 1993
941993
Expressiveness of process algebras
J Parrow
Electronic Notes in Theoretical Computer Science 209, 173-186, 2008
882008
Verifying a CSMA/CD-protocol with CCS
J Parrow
University of Edinburgh. Laboratory for Foundations of Computer Science, 1987
871987
Automatized verification of ad hoc routing protocols
O Wibling, J Parrow, A Pears
Formal Techniques for Networked and Distributed Systems–FORTE 2004: 24th …, 2004
862004
Multiway synchronization verified with coupled simulation
J Parrow, P Sjödin
International Conference on Concurrency Theory, 518-533, 1992
841992
The concurrency workbench: A semantics-based verification tool for finite state systems
R Cleaveland, J Parrow, B Steffen
ACM Transactions on Programming Languages and Systems 15 (1), 36-72, 1993
821993
Psi-calculi: Mobile processes, nominal data, and logic
J Bengtson, M Johansson, J Parrow, B Victor
2009 24th Annual IEEE Symposium on Logic In Computer Science, 39-48, 2009
792009
Formalising the π-Calculus Using Nominal Logic
J Bengtson, J Parrow
International Conference on Foundations of Software Science and …, 2007
772007
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20