Results 1  10
of
15
Towards Development of Secure Systems using UMLsec
, 2001
"... We show how UML (the industry standard in objectoriented modelling) can be used to express security requirements during system development. Using the extension mechanisms provided by UML, we incorporate standard concepts from formal methods regarding multilevel secure systems and security protocol ..."
Abstract

Cited by 36 (7 self)
 Add to MetaCart
We show how UML (the industry standard in objectoriented modelling) can be used to express security requirements during system development. Using the extension mechanisms provided by UML, we incorporate standard concepts from formal methods regarding multilevel secure systems and security protocols. These definitions evaluate diagrams of various kinds and indicate possible vulnerabilities.
Algebraic Specification of Concurrent Systems
, 1999
"... State Machines" (ASM). 13.4.1 Evolving algebras (abstract state machines) The basic idea of the "evolving algebras" (see, for instance, [Gur93,Gur95]) is perfectly summarized by their name. Essentially an evolving algebra (specification) consists of a description of a (nonlabeled) tr ..."
Abstract

Cited by 24 (4 self)
 Add to MetaCart
State Machines" (ASM). 13.4.1 Evolving algebras (abstract state machines) The basic idea of the "evolving algebras" (see, for instance, [Gur93,Gur95]) is perfectly summarized by their name. Essentially an evolving algebra (specification) consists of a description of a (nonlabeled) transition system, whose states are algebras on the same homogeneous signature built over the same universe (including Boolean values). Some of the operation symbols are qualified as "static" and their interpretation is the same in any (algebra which is a) state. The transitions are defined by rules of the following form: econd ) up 1 ; : : : up k where, for each j = 1; : : : ; k, the function update up j has form f j (e j 1 ; : : : ; e j n j ) := e j ; econd, e 1 1 , : : : , e 1 n1 , e 1 , : : : , e k 1 , : : : , e k nk , e k are "descriptions" (any possible mathematically intelligible expressions) of elements of the universe, the first describing a Boolean value, and for j = 1; : : : ; ...
Specifying Embedded Systems with Statecharts and Z: An Agenda for Cyclic Software Components
 OF LECTURE NOTES IN COMPUTER SCIENCE
, 1998
"... The application of formal techniques can contribute much to the quality of software, which is of utmost importance for safetycritical embedded systems. These techniques, however, are not easy to apply. In particular, methodological guidance is often unsatisfactory. We address this problem by the ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
(Show Context)
The application of formal techniques can contribute much to the quality of software, which is of utmost importance for safetycritical embedded systems. These techniques, however, are not easy to apply. In particular, methodological guidance is often unsatisfactory. We address this problem by the concept of an agenda. An agenda is a list of activities to be performed for solving a task in software engineering. Agendas used to support the application of formal specification techniques provide detailed guidance for specifiers, templates of the used specification language that only need to be instantiated, and application independent validation criteria. We apply the agenda approach to a particular class of embedded safetycritical systems, the formal specification of which has been investigated in the casestudies of the German Espress project during the last two years.
UML as a Heterogeneous Multiview Notation Strategies for a Formal Foundation
, 1998
"... extend the kinds of the elements used in the diagrams, as stereotypes, tagged values and constraints. Moreover the language used for the constraints is not fixed; a particular one, OCL, has been defined but its use is not mandatory and can be replaced by other languages, including also natural lang ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
extend the kinds of the elements used in the diagrams, as stereotypes, tagged values and constraints. Moreover the language used for the constraints is not fixed; a particular one, OCL, has been defined but its use is not mandatory and can be replaced by other languages, including also natural language text. Notation UML is only a notation and not a method (see in [AR97] a detailed discussion on the difference between notation/formalism and method); thus it can be used in different ways by different methods, and a method may consider only parts of UML or different parts in different phases of the development process (see, e.g., [Wie98]). The UML documentation makes explicit the first two points; indeed such notes treat each kind of diagrams separately and do not consider their mutual relationships. For example wellformedness conditions and informal semantics do not cover groups of diagrams and just consider single diagrams in isolation. Why a Formal
Concurrency and Data Types: a Specification Method  An Example with LOTOS
 Recent Trends in Algebraic Development Techniques, Selected Papers of the 13th International Workshop on Algebraic Development Techniques WADT'98, volume 1589 of Lecture Notes in Computer Science
"... Methods are needed to help using formal specifications in a practical way. We present a specification method that takes into account both the specification of concurrent activity and the specification of the data types involved. It is applied here to LOTOS specification, but it may be used for o ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
Methods are needed to help using formal specifications in a practical way. We present a specification method that takes into account both the specification of concurrent activity and the specification of the data types involved. It is applied here to LOTOS specification, but it may be used for other formalisms. Our method is both constraint oriented (for the processes decomposition into parallel subprocesses) and state oriented (for the design of the sequential components). This latter aspect is based on (i) the design of an automaton from the external behaviour description, (ii) the generation of a LOTOS specification associated with this automaton. We illustrate our method through a simple example, a hospital.
An Operational Semantics for Java
, 1998
"... this paper, together with their semantics. ..."
(Show Context)
Temporal Logics as Examples of Formal Description Techniques for Timed Systems
 SFB 501 BERICHT 06/98, FACHBEREICH INFORMATIK, UNIVERSIT#T KAISERSLAUTERN
, 1998
"... The notion of formal description techniques for timed systems (TFDTs) has been introduced in [EDK98a] to provide a unifying framework for description techniques that are formal and that allow to describe the ongoing behavior of systems. In this paper we show that three well known temporal logics, M ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The notion of formal description techniques for timed systems (TFDTs) has been introduced in [EDK98a] to provide a unifying framework for description techniques that are formal and that allow to describe the ongoing behavior of systems. In this paper we show that three well known temporal logics, MTL, MTL R , and CTL*, can be embedded in this framework. Moreover, we provide evidence that a large number of dioeerent kinds of temporal logics can be considered as TFDTs.
Control and Datatypes using the View Formalism
, 2000
"... . We herein deal with mixed specification formalisms, i.e. formalisms with both a static (data types) and a dynamic (behaviour) part. Our formalism is based on symbolic transition systems (STS) [9], that allow one to specify systems at an abstract level and to avoid state explosion. STS are a kind o ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
. We herein deal with mixed specification formalisms, i.e. formalisms with both a static (data types) and a dynamic (behaviour) part. Our formalism is based on symbolic transition systems (STS) [9], that allow one to specify systems at an abstract level and to avoid state explosion. STS are a kind of guarded finite state/transition diagrams where states and transitions are labelled with open terms. Both dynamic and static parts of objects are specified, in a unifying approach, as formal structures that we call views. These components interpretation structures use STS, and we show how these may be derived from their view structures. The system is structured by means of collections of objects (with identities) . A temporal logic is used to glue the components altogether and expresses a generalized form of synchronous product [1]. We then show how a view structure and its interpretation structure may be obtained. The formalism is explained using a simplified phone service example. Keywor...
A MultiAgent Specification Environment for Complex Software Applications
, 1997
"... The goal of the thesis is the definition of a specification environment for Complex Distributed Software Applications. More precisely, the aim is to investigate all the issues connected to the realization of executable specifications for such applications, using new technologies rising in the field ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The goal of the thesis is the definition of a specification environment for Complex Distributed Software Applications. More precisely, the aim is to investigate all the issues connected to the realization of executable specifications for such applications, using new technologies rising in the fields of Logic Programming, MultiAgent Systems and Distributed Software Engineering. In this context, we want to realize a set of tools that can be used for implementing and testing reliable software prototypes that solve realworld problems.
A Framework for the Analysis of Formal Description Techniques for Timed Systems
 SFB 501 BERICHT 05/98, FACHBEREICH INFORMATIK, UNIVERSIT#T KAISERSLAUTERN
, 1998
"... There are a large variety of quite different formal description techniques (FDTs) to describe the ongoing behavior of systems. In this paper a unifying framework for such FDTs is presented, which enables their comparison in a common setting. This framework is a specialization of the institutions of ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
There are a large variety of quite different formal description techniques (FDTs) to describe the ongoing behavior of systems. In this paper a unifying framework for such FDTs is presented, which enables their comparison in a common setting. This framework is a specialization of the institutions of Goguen and Burstall to signatures and structures involving time. It is shown that the temporal logic MTL can be properly instantiated within this framework.