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
54781992
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
7981993
An introduction to the π-calculus
J Parrow
Handbook of process algebra, 479-543, 2001
3272001
The fusion calculus: Expressiveness and symmetry in mobile processes
J Parrow, B Victor
Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science …, 1998
3061998
Modal logics for mobile processes
R Milner, J Parrow, D Walker
Theoretical Computer Science 114 (1), 149-171, 1993
2921993
The concurrency workbench
R Cleaveland, J Parrow, B Steffen
Automatic Verification Methods for Finite State Systems: International …, 1990
2771990
An algebraic verification of a mobile network
F Orava, J Parrow
Formal aspects of computing 4, 497-543, 1992
1361992
Algebraic theories for name-passing calculi
J Parrow, D Sangiorgi
Information and Computation 120 (2), 174-197, 1995
1271995
A Semantics Based Verification Tool for Finite State Systems.
R Cleaveland, J Parrow, B Steffen
PSTV, 287-302, 1989
1231989
Psi-calculi: a framework for mobile processes with nominal data and logic
J Bengtson, M Johansson, J Parrow, BA Victor
arXiv preprint arXiv:1101.3262, 2011
1002011
Deciding bisimulation equivalences for a class of non-finite-state programs
B Jonsson, J Parrow
Information and computation 107 (2), 272-302, 1993
921993
Automatized verification of ad hoc routing protocols
O Wibling, J Parrow, A Pears
Formal Techniques for Networked and Distributed Systems–FORTE 2004: 24th …, 2004
872004
Verifying a CSMA/CD-protocol with CCS
S Aggarwal, K Sabnani
Protocol Specification, Testing, and Verification, VIII: Proceedings of the …, 1988
871988
Expressiveness of process algebras
J Parrow
Electronic Notes in Theoretical Computer Science 209, 173-186, 2008
832008
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
802009
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
791993
Multiway synchronization verified with coupled simulation
J Parrow, P Sjödin
CONCUR'92: Third International Conference on Concurrency Theory Stony Brook …, 1992
771992
Submodule construction as equation solving in CCS
J Parrow
Theoretical Computer Science 68 (2), 175-202, 1989
771989
Formalising the π-Calculus Using Nominal Logic
J Bengtson, J Parrow
Foundations of Software Science and Computational Structures: 10th …, 2007
702007
The update calculus
J Parrow, B Victor
Algebraic Methodology and Software Technology: 6th International Conference …, 1997
671997
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20