Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
On the consistency of Koomen's fair abstraction rule
Theoretical Computer Science
Inheritance as an incremental modification mechanism or what like is and isn'tlike
on ECOOP '88 (European Conference on Object-Oriented Programming)
A complete axiomatisation for observational congruence of finite-state behaviours
Information and Computation
Dynamic congruence vs. progressing bisimulation for CCS
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
The type and effect discipline
Information and Computation
A behavioral notion of subtyping
ACM Transactions on Programming Languages and Systems (TOPLAS)
Bisimulation equivalence is decidable for all context-free processes
Information and Computation
Regular types for active objects
Object-oriented software composition
Basic simple type theory
FMOODS '97 Proceedings of the IFIP TC6 WG6.1 international workshop on Formal methods for open object-based distributed systems
An interpretation of typed objects into typed &pgr;-calculus
Information and Computation
Information and Computation - Special issue on EXPRESS 1997
Information and Computation - Special issue on EXPRESS 1997
Types as models: model checking message-passing programs
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Types and programming languages
Types and programming languages
Communication and Concurrency
Principles of Program Analysis
Principles of Program Analysis
The π-Calculus in Direct Style
Higher-Order and Symbolic Computation
Language Primitives and Type Discipline for Structured Communication-Based Programming
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Typing the Use of Resources in a Concurrent Calculus (Extended Abstract)
ASIAN '97 Proceedings of the Third Asian Computing Science Conference on Advances in Computing Science
Guaranteeing liveness in an object calculus through behavioural typing
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
An Interaction-based Language and its Typing System
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
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
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Bisimulation Equivalence is Decidable for Basic Parallel Processes
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Principal Typing Schemes in a Polyadic pi-Calculus
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th 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
Infinite types for distributed object interfaces
Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS)
A Typing System for a Calculus of Objects
Proceedings of the First JSSST International Symposium on Object Technologies for Advanced Software
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 and Subtypes for Client-Server Interactions
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Semantics of Objects as Processes (SOAP)
Proceedings of the Workshop on Object-Oriented Technology
A generic type system for the Pi-calculus
Theoretical Computer Science
Types for Active Objects with Static Deadlock Prevention
Fundamenta Informaticae
Refining the Undecidability Border of Weak Bisimilarity
Electronic Notes in Theoretical Computer Science (ENTCS)
Logical semantics of types for concurrency
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Spatial and behavioral types in the pi-calculus
Information and Computation
Theoretical Computer Science
State inference for dynamically changing interfaces
Computer Languages
| Hi-index | 0.00 |
We propose a process algebra, the Algebra of Behavioural Types, as a language for typing concurrent objects. A type is a higher-order labelled transition system that characterises all possible life cycles of a concurrent object. States represent interfaces of objects; state transitions model the dynamic change of object interfaces. Moreover, a type provides an internal view of the objects that inhabits it: a synchronous one, since transitions correspond to message reception. To capture this internal view of objects we define a notion of bisimulation, strong on labels and weak on silent actions. We study several algebraic laws that characterise this equivalence, and obtain completeness results for image-finite types.