Three partition refinement algorithms
SIAM Journal on Computing
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
An implementation of an efficient algorithm for bisimulation equivalence
Science of Computer Programming
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Dynamic congruence vs. progressing bisimulation for CCS
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
A calculus of mobile processes, II
Information and Computation
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
A symbolic semantics for the &pgr;-calculus
Information and Computation
Model checking mobile processes
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
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
A calculus for cryptographic protocols
Information and Computation
Model checking
Bandera: extracting finite-state models from Java source code
Proceedings of the 22nd international conference on Software engineering
A partition refinement algorithm for the &pgr;-calculus
Information and Computation - Special issue on FLOC '96
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Symbolic Model Checking
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automated Software Engineering
On the Proof Method for Bisimulation (Extended Abstract)
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
pi-Calculus, Structured Coalgebras, and Minimal HD-Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
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
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
On the Benefits of Using the Up-To Techniques for Bisimulation Verification
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
From Rewrite to Bisimulation Congruences
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
A Framework for the Analysis of Security Protocols
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Orchestrating Transactions in Join Calculus
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
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
"On the Fly" Verification of Behavioural Equivalences and Preorders
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
The Mobility Workbench - A Tool for the pi-Calculus
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Complete inference systems for weak bisimulation equivalences in the π-calculus
Information and Computation
Jocaml: Mobile Agents for Objective-Caml
ASAMA '99 Proceedings of the First International Symposium on Agent Systems and Applications Third International Symposium on Mobile Agents
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Towards a Completeness Result for Model Checking of Security Protocols
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
Computing Symbolic Models for Verifying Cryptographic Protocols
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Automated analysis of cryptographic protocols using Mur/spl phi/
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
History-Dependent Automata
Deriving bisimulation congruences using 2-categories
Nordic Journal of Computing
Communications of the ACM - Service-oriented computing
Proof systems for π-calculus logics
Logic for concurrency and synchronisation
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
Service -Oriented Computing: Concepts, Characteristics and Directions
WISE '03 Proceedings of the Fourth International Conference on Web Information Systems Engineering
Elementary structures in process theory (1): Sets with renaming
Mathematical Structures in Computer Science
Models for name-passing processes: interleaving and causal
Information and Computation
A logical encoding of the π-calculus: model checking mobile processes using tabled resolution
International Journal on Software Tools for Technology Transfer (STTT)
Modern concurrency abstractions for C#
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical foundations for compensations in flow composition languages
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A spatial logic for concurrency--II
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Coalgebraic minimization of HD-automata for the π-calculus using polymorphic types
Theoretical Computer Science - Formal methods for components and objects
Locating reaction with 2-categories
Theoretical Computer Science - Foundations of software science and computation structures
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
A Coordination-based Methodology for Security Protocol Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
Foundations of web transactions
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
ACM SIGACT News
Network Applications of Graph Bisimulation
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Science of Computer Programming
Efficient bisimilarities from second-order reaction semantics for π-calculus
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hi-index | 0.00 |
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model checking a difficult task. In this note we survey some of the approaches for model checking nominal calculi. Then, we focus on History-Dependent automata, a syntax-free automaton-based model of mobility. History-Dependent automata have provided the formal basis to design and implement some existing verification toolkits. We then introduce a novel syntax-free setting to model the symbolic semantics of a nominal calculus. Our approach relies on the notions of reactive systems and observed borrowed contexts introduced by Leifer and Milner, and further developed by Sassone, Lack and Sobocinski. We argue that the symbolic semantics model based on borrowed contexts can be conveniently applied to web service discovery and binding.