Results 1  10
of
14
A formal approach to objectoriented software engineering
 Electronic Notes on Theoretical Computer Science 4
"... We show how formal specifications can be integrated into one of the current pragmatic objectoriented software development methods. Jacobson’s “ObjectOriented Software Engineering ” (OOSE) process is combined with objectoriented algebraic specifications by extending object and interaction diagrams ..."
Abstract

Cited by 22 (2 self)
 Add to MetaCart
(Show Context)
We show how formal specifications can be integrated into one of the current pragmatic objectoriented software development methods. Jacobson’s “ObjectOriented Software Engineering ” (OOSE) process is combined with objectoriented algebraic specifications by extending object and interaction diagrams with formal annotations. The specifications are based on Meseguer’s rewriting logic and are written in a metalevel extension of the language Maude by process expressions. As a result any such diagram can be associated with a formal specification, proof obligations ensuring invariant properties can be automatically generated, and the refinement relations between documents at different abstraction levels can be formally stated and proved. 1
Integration of Formal Datatypes within State Diagrams
, 2002
"... Machine Notation (AMN). Now, we discuss the computation of the evaluation function from state oriented specification techniques, and especially from B abstract machines. For this issue, we inspire ourselves from the BBook [5], and from a more recent work of Bert and Cave [17]. In the latter, the au ..."
Abstract

Cited by 14 (10 self)
 Add to MetaCart
(Show Context)
Machine Notation (AMN). Now, we discuss the computation of the evaluation function from state oriented specification techniques, and especially from B abstract machines. For this issue, we inspire ourselves from the BBook [5], and from a more recent work of Bert and Cave [17]. In the latter, the authors study several ways to build finite LTS from B abstract systems: enumeration of states, symbolic evaluation and set constraints, abstract interpretation, and so on. A LTS is suitable to depict an evaluation function.
A Formalism Combining CCS and CASL
, 2001
"... Grammar 33 A.1 Basic Specifications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 A.2 Basic Specifications with Subsorts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 A.3 Structured Specifications . . . . . . . . . . . . . . . . . . ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Grammar 33 A.1 Basic Specifications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 A.2 Basic Specifications with Subsorts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 A.3 Structured Specifications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 A.4 Architectural Specifications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 A.5 Specification Libraries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 B Specification of the Case Study 37 1
Specification of an Access Control System with a Formalism Combining CCS and CASL
 In Proceedings of the 7th International Workshop on Formal Methods for Parallel Programming: Theory and Applications (FMPPTA'02), IEEE Computer
, 2002
"... Multiformalism specifications are essential for the modelling of complex systems including different aspects such as data or concurrency. We advocate a formalism which combines the CCS process algebra with the CASL algebraic specification language. Formal foundations of this combination are present ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Multiformalism specifications are essential for the modelling of complex systems including different aspects such as data or concurrency. We advocate a formalism which combines the CCS process algebra with the CASL algebraic specification language. Formal foundations of this combination are presented following two steps, the syntax and the semantics. Our proposal is illustrated with a real size case study: an access control system to a set of buildings. With this concrete example, we aim at showing how our formalism proposal could be used to specify a comprehensive application.
Integrating and RapidPrototyping UML Structural and Behavioural Diagrams Using Rewriting Logic
 Preprint, Fakultät für Informatik, Universität Magdeburg
, 2002
"... Although the diversity of UML diagrams provides users with di#erent views of any complex software under development, in most cases system designers face challenging problems to keeping such diagrams coherently related. In this paper we propose to contribute to the tremendous e#orts being undertaken ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Although the diversity of UML diagrams provides users with di#erent views of any complex software under development, in most cases system designers face challenging problems to keeping such diagrams coherently related. In this paper we propose to contribute to the tremendous e#orts being undertaken towards rigorous and coherent views of UMLbased modelling techniques. In this sense, we propose to integrate most of UML diagrams in a very smooth yet sound way. Moreover, by equipping such integration with an intrinsically concurrent and operational semantics, namely rewriting logic, we also provide validation by rapidprototyping using Maude implementations. More precisely, the diagrams we propose to smoothly integrate include: object and classdiagrams with their related object constraints (using OCL), statecharts and lifecycle diagrams. T e integration of such diagrams is based on very appealing Petrinetlike semigraphical notations. As further advantages of the proposed integration we cite: ( ) an explicit distinction between local features and observed ones in (the enriched) classdiagrams which o#ers a clean separation between intraand interclassdiagram reasoning; and (2) a full exploitation of rewriting logic reflection capabilities for expressing di#erent objectlife cycles in a runtime way. 1
Using UML for Problem Frame Oriented Software Development
 13th International Conference on Intelligent & Adaptive Systems and Software Engineering
, 2004
"... We propose a software development approach that combines the use of the UML notation, the use of the structuring concepts provided by the problem frames, together with our methodological approach for wellfounded methods. The problem frames are used to provide a rst idea of the main elements of the ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We propose a software development approach that combines the use of the UML notation, the use of the structuring concepts provided by the problem frames, together with our methodological approach for wellfounded methods. The problem frames are used to provide a rst idea of the main elements of the problem under study. Then we provide ad hoc UML based development methods for some of the most relevant problem frames together with precise guidelines for the users. The general idea of our method is that, for each frame, several artifacts have to be produced, each one corresponding to a part of the frame. The description level may range from informal and sketchy, to formal and precise, while this approach is drawn from experience in formal speci cations.
MIAOw: a Method to Integrate a Process Algebra with Formal Data
, 2002
"... Machine Notation (AMN). Now, we discuss the computation of the evaluation function from state oriented specification techniques, and especially from B abstract machines. For this issue, we inspire ourself from the BBook [1], and from a more recent work of Bert and Cave [7]. In the latter, the autho ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Machine Notation (AMN). Now, we discuss the computation of the evaluation function from state oriented specification techniques, and especially from B abstract machines. For this issue, we inspire ourself from the BBook [1], and from a more recent work of Bert and Cave [7]. In the latter, the authors study several ways to build finite LTS from B abstract systems: enumeration of states, symbolic evaluation and set constraints, abstract interpretation, and so on. A LTS is suitable to depict an evaluation function. The choice of evaluation function could be based on the solutions undertaken in [7]. In this section, we define the evaluation function using the enumeration of states. This is the easiest way to define the function, and the underlying set of states and transitions. Given a B machine, we need the set of variables, the invariant, the initialisation, and the list of operations (step 3.a). The behaviour of the machine is viewed as a LTS (step 3.b). Each state denotes a set of data with values, and more precisely a finite set of variable/value couple. These couples are deduced from the variables and initialisations of the B machine. Names of operations are labels of transitions and symbolize the evolution from one state to another. The state space of the LTS is the set of states which satisfy the invariant. From the machine initialisation clause (depicted here using INIT), the initial states are deduced. In the formulas below, the symbols hi and [] are the temporal operators used in the formalisation of some B dynamic aspects [2].
Formal Combination of the CCS Process Algebra with the CASL Algebraic Specification Language
"... braic Speci cation Language), an initiative emanating from the CoFI (Common Framework Initiative) international group. The use of this expressive formalism is very interesting to specify complex systems. However, Casl is a dataoriented language, consequently it is not suitable for the speci catio ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
braic Speci cation Language), an initiative emanating from the CoFI (Common Framework Initiative) international group. The use of this expressive formalism is very interesting to specify complex systems. However, Casl is a dataoriented language, consequently it is not suitable for the speci cation of dynamic aspects (parallelism, communication, concurrency). The extension of Casl to specify reactive systems is the goal followed by the Reactive System Task Group (internal to CoFI); for instance, the language proposal of Reggio and Repetto [5] combines Casl and Statecharts. On a wider scale, Astesiano and al [6] present methodological guidelines (that we had partially followed) in the design phase of formalisms associating a data description language, particularly Casl, with a paradigmspeci c one. http://www.disi.unige.it/person/ReggioG/COFI/ To cope with the Casl limitations in dynamic aspects, we choose to combine Casl with the process algebra CCS [4]. CCS is a simple lang
The Common Framework Initiative for algebraic specification and development of software
, 1999
"... . The Common Framework Initiative (CoFI) is an open international collaboration which aims to provide a common framework for algebraic specification and development of software. The central element of the Common Framework is a specification language called Casl for formal specification of functiona ..."
Abstract
 Add to MetaCart
. The Common Framework Initiative (CoFI) is an open international collaboration which aims to provide a common framework for algebraic specification and development of software. The central element of the Common Framework is a specification language called Casl for formal specification of functional requirements and modular software design which subsumes many previous algebraic specification languages. This paper is a brief summary of past and present work on CoFI. 1 Introduction Algebraic specification is one of the most extensivelydeveloped approaches in the formal methods area. The most fundamental assumption underlying algebraic specification is that programs are modelled as manysorted algebras consisting of a collection of sets of data values together with functions over those sets. This level of abstraction is commensurate with the view that the correctness of the input/output behaviour of a program takes precedence over all its other properties. Another common element is tha...
An Approach to Algebraic Semantics of
 Memorandum 128, Lehrstuhl SoftwareTechnologie, Fachbereich Informatik, Universität Dortmund
, 2003
"... Studying the semantics of programming languages has a long tradition in computer science. ..."
Abstract
 Add to MetaCart
Studying the semantics of programming languages has a long tradition in computer science.