POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Operational and algebraic semantics of concurrent processes
Handbook of theoretical computer science (vol. B)
Selected papers of the Second Workshop on Concurrency and compositionality
Combinatory representation of mobile processes
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hyperedge Replacement: Grammars and Languages
Hyperedge Replacement: Grammars and Languages
Nordic Journal of Computing
Pi-Nets: A Graphical Form of pi-Calculus
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
Positive Recursive Type Assignment
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Secrecy by Typing inSecurity Protocols
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Control Flow Analysis for the pi-calculus
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Introduction to the Algebraic Theory of Graph Grammars (A Survey)
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Behavioural Types for a Calculus of Concurrent Objects
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
A Partially Deadlock-free Typed Process Calculus
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A General Framework for Types in Graph Rewriting
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Expressiveness of generic process shape types
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
| Hi-index | 0.00 |
We introduce a hypergraph-based process calculus with a generic type system. That is, a type system checking an invariant property of processes can be generated by instantiating the original type system. We demonstrate the key ideas behind the type system, namely that there exists a hypergraph morphism from each process graph into its type, and show how it can be used for the analysis of processes. Our examples are input/output-capabilities, secrecy conditions and avoiding vicious circles occurring in deadlocks. In order to specify the syntax and semantics of the process calculus and the type system, we introduce a method of hypergraph construction using concepts from category theory.