Parallel program design: a foundation
Parallel program design: a foundation
Algebraic decision diagrams and their applications
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Distributed Algorithms
Interface Theories for Component-Based Design
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Synchronous and Bidirectional Component Interfaces
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
Compositional Abstraction in Real-Time Model Checking
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
State Space Reduction Techniques for Component Interfaces
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
A Uniform Framework for Modeling and Verifying Components and Connectors
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Modal interfaces: unifying interface automata and modal specifications
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
An accelerated algorithm for 3-color parity games with an application to timed games
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Session types for orchestration charts
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Solving games via three-valued abstraction refinement
Information and Computation
ECDAR: an environment for compositional design and analysis of real time systems
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Compositional strategy mapping
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Building a modal interface theory for concurrency and data
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
New results on timed specifications
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Moving from specifications to contracts in component-based design
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
A Modal Interface Theory for Component-based Design
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
Synchronous interface theories and time triggered scheduling
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Partition refinement of Component Interaction Automata
Science of Computer Programming
Solving games via three-valued abstraction refinement
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
A modal specification theory for components with data
Science of Computer Programming
| Hi-index | 0.00 |
Interface formalisms are able to model both the input requirements and the output behavior of system components; they support both bottom-up component-based design, and top-down design refinement. In this paper, we propose “sociable” interface formalisms, endowed with a rich compositional semantics that facilitates their use in design and modeling. Specifically, we introduce interface models that can communicate via both actions and shared variables, and where communication and synchronization covers the full spectrum, from one-to-one, to one-to-many, many-to-one, and many-to-many. Thanks to the expressive power of interface formalisms, this rich compositional semantics can be realized in an economical way, on the basis of a few basic principles. We show how the algorithms for composing, checking the compatibility, and refining the resulting sociable interfaces can be implemented symbolically, leading to efficient implementations.