A partially deadlock-free typed process calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Behavioral equivalence in the polymorphic pi-calculus
Journal of the ACM (JACM)
A generic type system for the Pi-calculus
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Types as models: model checking message-passing programs
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A uniform type structure for secure information flow
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formal methods for distributed processing
Information and Computation
Information flow vs. resource access in the asynchronous pi-calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
A type system for lock-free processes
Information and Computation - IFIP TCS2000
Imperative objects as mobile processes
Science of Computer Programming
The π-Calculus in Direct Style
Higher-Order and Symbolic Computation
Secure Information Flow as Typed Process Behaviour
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Mobile Processes: A Commented Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Suptyping and Locality in Distributed Higher Order Processes (extended abstract)
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Generating Type Systems for Process Graphs
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Typing Non-uniform Concurrent Objects
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
An Implicitly-Typed Deadlock-Free Process Calculus
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Reasoning About Concurrent Systems Using Types
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Locality and Polyadicity in Asynchronous Name-Passing Calculi
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
On Synchronous and Asynchronous Mobile Processes
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
A Behavioral Module System for the Pi-Calculus
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Types, or: Where's the Difference Between CCS and pi?
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Mobile processes: a commented bibliography
Modeling and verification of parallel processes
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A Simple View of Type-Secure Information Flow in the "-Calculus
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Channel dependent types for higher-order mobile processes
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Region analysis and a π-calculus with groups
Journal of Functional Programming
A generic type system for the Pi-calculus
Theoretical Computer Science
Strong normalisation in the π-calculus
Information and Computation
On asynchrony in name-passing calculi
Mathematical Structures in Computer Science
Correspondence assertions for process synchronization in concurrent communications
Journal of Functional Programming
Noninterference through flow analysis
Journal of Functional Programming
Types and full abstraction for polyadic π-calculus
Information and Computation
Mathematical Structures in Computer Science
On the expressive power of KLAIM-based calculi
Theoretical Computer Science - Expressiveness in concurrency
Types for Active Objects with Static Deadlock Prevention
Fundamenta Informaticae
A uniform type structure for secure information flow
ACM Transactions on Programming Languages and Systems (TOPLAS)
Tutorial on separation results in process calculi via leader election problems
Theoretical Computer Science
Formalising Java RMI with explicit code mobility
Theoretical Computer Science
Multiparty asynchronous session types
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Comparing communication primitives via their relative expressive power
Information and Computation
Global Progress in Dynamically Interleaved Multiparty Sessions
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Responsiveness in process calculi
Theoretical Computer Science
Flow-sensitive type systems and the ambient calculus
Higher-Order and Symbolic Computation
A Translation of Beta-binders in a Prioritized Pi-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
Types and full abstraction for polyadic π-calculus
Information and Computation
Sequentiality and the π-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Type abstractions of name-passing processes
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Responsiveness in process calculi
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
Spatial and behavioral types in the pi-calculus
Information and Computation
On the expressiveness of polyadic and synchronous communication in higher-order process calculi
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Expressiveness of generic process shape types
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Dynamic multirole session types
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Separation results via leader election problems
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
On the relative expressive power of asynchronous communication primitives
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Object connectivity and full abstraction for a concurrent calculus of classes
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Instant polymorphic type systems for mobile process calculi: just add reduction rules and close
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
An Algebra of Behavioural Types
Information and Computation
Deciding safety properties in infinite-state pi-calculus via behavioural types
Information and Computation
A new type system for deadlock-free processes
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Structured Communication-Centered Programming for Web Services
ACM Transactions on Programming Languages and Systems (TOPLAS)
A unified theory of program logics: an approach based on the π-calculus
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
State inference for dynamically changing interfaces
Computer Languages
Types for Active Objects with Static Deadlock Prevention
Fundamenta Informaticae
Undecidability of 2-label BPP equivalences and behavioral type systems for the π-calculus
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Globally governed session semantics
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |