On decidability of the control reachability problem in the asynchronous π-calculus
Nordic Journal of Computing
Finite-Control Mobile Ambients
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Verification of Temporal Properties of Processes in a Setting with Data
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Notes on Nominal Calculi for Security and Mobility
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Mobile Processes: A Commented Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Two Problems in Wide Area Network Programming
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Mobile processes: a commented bibliography
Modeling and verification of parallel processes
Proof systems for π-calculus logics
Logic for concurrency and synchronisation
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
A modal logic for mobile agents
ACM Transactions on Computational Logic (TOCL)
A model-checking verification environment for mobile processes
ACM Transactions on Software Engineering and Methodology (TOSEM)
Formulae Meet Programs Over the Net: A Framework for Correct Network Aware Programming
Automated Software Engineering
Towards a Model Logic for "-Calculus
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Model checking for π-calculus using proof search
CONCUR 2005 - Concurrency Theory
Multi Labelled Transition Systems: A Semantic Framework for Nominal Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Multiple-labelled transition systems for nominal calculi and their logics†
Mathematical Structures in Computer Science
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
A Complete Axiomatic System for a Process-Based Spatial Logic
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On the Relationship between η-Calculus and Finite Place/Transition Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
Fundamenta Informaticae - Petri Nets 2008
A Modal Logic for π-Calculus and Model Checking Algorithm
Electronic Notes in Theoretical Computer Science (ENTCS)
A hybrid type system for lock-freedom of mobile processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Observing distributed computation: a dynamic-epistemic approach
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
A Propositional Dynamic Logic for Concurrent Programs Based on the π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
An Epistemic Predicate CTL* for Finite Control π-Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
MoMo: a modal logic for reasoning about mobility
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Decidable extensions of hennessy-milner logic
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Resource usage analysis for the π-calculus
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Model checking for nominal calculi
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A logical verification methodology for service-oriented computing
ACM Transactions on Software Engineering and Methodology (TOSEM)
Decidability of modular logics for concurrency
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
Fundamenta Informaticae - Petri Nets 2008
A polynomial translation of π-calculus (FCP) to safe petri nets
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hi-index | 0.00 |