6,752 research outputs found
An Institutional Framework for Heterogeneous Formal Development in UML
We present a framework for formal software development with UML. In contrast
to previous approaches that equip UML with a formal semantics, we follow an
institution based heterogeneous approach. This can express suitable formal
semantics of the different UML diagram types directly, without the need to map
everything to one specific formalism (let it be first-order logic or graph
grammars). We show how different aspects of the formal development process can
be coherently formalised, ranging from requirements over design and Hoare-style
conditions on code to the implementation itself. The framework can be used to
verify consistency of different UML diagrams both horizontally (e.g.,
consistency among various requirements) as well as vertically (e.g.,
correctness of design or implementation w.r.t. the requirements)
A formal support to business and architectural design for service-oriented systems
Architectural Design Rewriting (ADR) is an approach for the design of software architectures developed within Sensoria by reconciling graph transformation and process calculi techniques. The key feature that makes ADR a suitable and expressive framework is the algebraic handling of structured graphs, which improves the support for specification, analysis and verification of service-oriented architectures and applications. We show how ADR is used as a formal ground for high-level modelling languages and approaches developed within Sensoria
Towards a Step Semantics for Story-Driven Modelling
Graph Transformation (GraTra) provides a formal, declarative means of
specifying model transformation. In practice, GraTra rule applications are
often programmed via an additional language with which the order of rule
applications can be suitably controlled.
Story-Driven Modelling (SDM) is a dialect of programmed GraTra, originally
developed as part of the Fujaba CASE tool suite. Using an intuitive,
UML-inspired visual syntax, SDM provides usual imperative control flow
constructs such as sequences, conditionals and loops that are fairly simple,
but whose interaction with individual GraTra rules is nonetheless non-trivial.
In this paper, we present the first results of our ongoing work towards
providing a formal step semantics for SDM, which focuses on the execution of an
SDM specification.Comment: In Proceedings GaM 2016, arXiv:1612.0105
A thread-tag based semantics for sequence diagrams
The sequence diagram is one of the most popular behaviour modelling languages which offers an intuitive and visual way of describing expected behaviour of object-oriented software. Much research work has investigated ways of providing a formal semantics for sequence diagrams. However, these proposed semantics may not properly interpret sequence diagrams when lifelines do not correspond to threads of controls. In this paper, we address this problem and propose a thread-tag based sequence diagram as a solution. A formal, partially ordered multiset based semantics for the thread-tag based sequence diagrams is proposed
PaL Diagrams: A Linear Diagram-Based Visual Language
Linear diagrams have recently been shown to be
more effective than Euler diagrams when used
for set-based reasoning. However, unlike the
growing corpus of knowledge about formal aspects
of Euler and Venn diagrams, there has been no
formalisation of linear diagrams. To fill this
knowledge gap, we present and formalise Point
and Line (PaL) diagrams, an extension of simple
linear diagrams containing points, thus providing
a formal foundation for an effective visual
language.We prove that PaL diagrams are exactly
as expressive as monadic first-order logic with
equality, gaining, as a corollary, an equivalence
with the Euler diagram extension called spider
diagrams. The method of proof provides translations
between PaL diagrams and sentences of monadic
first-order logic
Boolean networks synchronism sensitivity and XOR circulant networks convergence time
In this paper are presented first results of a theoretical study on the role
of non-monotone interactions in Boolean automata networks. We propose to
analyse the contribution of non-monotony to the diversity and complexity in
their dynamical behaviours according to two axes. The first one consists in
supporting the idea that non-monotony has a peculiar influence on the
sensitivity to synchronism of such networks. It leads us to the second axis
that presents preliminary results and builds an understanding of the dynamical
behaviours, in particular concerning convergence times, of specific
non-monotone Boolean automata networks called XOR circulant networks.Comment: In Proceedings AUTOMATA&JAC 2012, arXiv:1208.249
Possibilistic Information Flow Control for Workflow Management Systems
In workflows and business processes, there are often security requirements on
both the data, i.e. confidentiality and integrity, and the process, e.g.
separation of duty. Graphical notations exist for specifying both workflows and
associated security requirements. We present an approach for formally verifying
that a workflow satisfies such security requirements. For this purpose, we
define the semantics of a workflow as a state-event system and formalise
security properties in a trace-based way, i.e. on an abstract level without
depending on details of enforcement mechanisms such as Role-Based Access
Control (RBAC). This formal model then allows us to build upon well-known
verification techniques for information flow control. We describe how a
compositional verification methodology for possibilistic information flow can
be adapted to verify that a specification of a distributed workflow management
system satisfies security requirements on both data and processes.Comment: In Proceedings GraMSec 2014, arXiv:1404.163
- …