Communicating sequential processes
Communicating sequential processes
A context dependent equivalence between processes
Theoretical Computer Science
A compositional protocol verification using relativized bisimulation
Information and Computation
A generic type system for the Pi-calculus
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Conformance Checking for Models of Asynchronous Message Passing Software
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
A behavioral type system and its application in Ptolemy II
Formal Aspects of Computing
Compositional circular assume-guarantee rules cannot be sound and complete
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Color-Blind specifications for transformations of reactive synchronous programs
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Online testing of real-time systems using UPPAAL
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
Interfaces and Metainterfaces for Models and Metamodels
MoDELS '08 Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems
Modal I/O automata for interface and product line theories
ESOP'07 Proceedings of the 16th European conference on Programming
Session types for orchestration charts
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
A model of evolvable components
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Contexts, refinement and determinism
Science of Computer Programming
Monterey'08 Proceedings of the 15th Monterey conference on Foundations of Computer Software: future Trends and Techniques for Development
Moving from specifications to contracts in component-based design
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Unblockable compositions of software components
Proceedings of the 15th ACM SIGSOFT symposium on Component Based Software Engineering
From software verification to `everyware' verification
Computer Science - Research and Development
| Hi-index | 0.00 |
Building on the theory of interface automata by de Alfaro and Henzinger we design an interface language for Lynch's I/O, a popular formalism used in the development of distributed asynchronous systems, not addressed by previous interface research. We introduce an explicit separation of assumptions from guarantees not yet seen in other behavioral interface theories. Moreover we derive the composition operator systematically and formally, guaranteeing that the resulting compositions are always the weakest in the sense of assumptions, and the strongest in the sense of guarantees. We also present a method for solving systems of relativized behavioral inequalities as used in our setup and draw a formal correspondence between our work and interface automata.