Process algebra
Handbook of theoretical computer science (vol. B)
Behavioural and abstractor specifications
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
The object constraint language: precise modeling with UML
The object constraint language: precise modeling with UML
The Unified Modeling Language reference manual
The Unified Modeling Language reference manual
A relational model of data for large shared data banks
Communications of the ACM
Modeling Reactive Systems with Statecharts: The Statemate Approach
Modeling Reactive Systems with Statecharts: The Statemate Approach
Algebraic Foundations of Systems Specification
Algebraic Foundations of Systems Specification
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
Algebraic Specification of Concurrency
Selected papers from the 8th Workshop on Specification of Abstract Data Types Joint with the 3rd COMPASS Workshop on Recent Trends in Data Type Specification
Proving the Correctness of Behavioural Implementations
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Behaviour-Refinement of Coalgebraic Specifications with Coinductive Correctness Proofs
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Transformation Rules for UML Class Diagrams
«UML» '98 Selected papers from the First International Workshop on The Unified Modeling Language «UML»'98: Beyond the Notation
Reflections on the Object Constraint Language
«UML» '98 Selected papers from the First International Workshop on The Unified Modeling Language «UML»'98: Beyond the Notation
On Formalizing the UML Object Constraint Language OCL
ER '98 Proceedings of the 17th International Conference on Conceptual Modeling
Universal coalgebra: a theory of systems
Universal coalgebra: a theory of systems
The Semantics of UML State Machines
The Semantics of UML State Machines
Using UML/OCL constraints for relational database design
UML'99 Proceedings of the 2nd international conference on The unified modeling language: beyond the standard
Formalization of UML-Statecharts
«UML» '01 Proceedings of the 4th International Conference on The Unified Modeling Language, Modeling Languages, Concepts, and Tools
Using formal methods with SysML in aerospace design and engineering
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
Swinging types (STs) provide a specification and verification formalism for designing software in terms of many-sorted logic. Current formalisms, be they set- or order-theoretic, algebraic or coalgebraic, rule-or net-based, handle either static system components (in terms of functions or relations) or dynamic ones (in terms of transition systems) and either structural or behavioral aspects, while STs combine equational, Horn and modal logic for the purpose of applying computation and proof rules from all three logics. UML provides a collection of object-oriented pictorial specification techniques, equipped with an informal semantics, but hardly cares about consistency, i.e. the guarantee that a specification has models and thus can be implemented. To achieve this goal and to make verification possible a formal semantics is indispensable. Swinging types have term models that are directly derived from the specifications. The paper takes first steps towards a translation of class diagrams, OCL constraints and state machines into STs. Partly, we proceed along examples, partly we describe generally how, e.g., classes can be turned into signatures. Swinging types are particularly suitable for interpreting UML models because they integrate static and dynamic components. UML treats them separately, STs handle them within the same formalism. Hence, one may check, for instance, whether static operations are correctly refined to local message passing primitives. A crucial point of a formal semantics of UML models is a reasonable notion of state. If constraints involve static data as well as states and state transitions, the modal-logic view on states as (implicit) predicates is less adequate than the ST representation as terms denoting tuples of attribute values, "histories" of object manipulations or compositions of substates (composite states).