The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A calculus of mobile processes, II
Information and Computation
Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
A calculus for cryptographic protocols
Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Efficient Minimization up to Location Equivalence
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
An Automated Based Verification Environment for Mobile Processes
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Finite State Verification for the Asynchronous pi-Calculus
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Checking Bisimilarity for Finitary pi-Calculus
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Verifying Mobile Processes in the HAL Environment
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
A model-checking verification environment for mobile processes
ACM Transactions on Software Engineering and Methodology (TOSEM)
About permutation algebras, (pre)sheaves and named sets
Higher-Order and Symbolic Computation
Coalgebraic minimization of HD-automata for the π-calculus using polymorphic types
Theoretical Computer Science - Formal methods for components and objects
Structured coalgebras and minimal HD-automata for the π-calculus
Theoretical Computer Science - Mathematical foundations of computer science 2000
A Name Abstraction Functor for Named Sets
Electronic Notes in Theoretical Computer Science (ENTCS)
Modelling fusion calculus using HD-Automata
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
SCC: a service centered calculus
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
| Hi-index | 0.00 |
The great honour of introducing the Chapter on Software Verificationfor the Festschrift dedicated to Ugo Montanari brings to mind a very personal memory. I was a young Ph.D. student and I was discussing something with Ugo, or better I was learning something from Ugo about how one could apply the abstract notions of category theory in order to understand better the problems raised from concurrency and synchronization. At a certain point Ugo wanted to interrupt our talk because a seminar by Jaco de Bakker on the denotational semantics of concurrency by metric spaces was about to begin. I was very familiar with the works of de Bakker having studied them for my Laurea thesis under Ugo's supervision. Following my request to continue our discussion, Ugo replied, "Let's go to the seminar. We can always learn something listening to de Bakker".