Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- articleJanuary 2013
Towards fully-fledged reverse inheritance in eiffel
Generalization is common in object-oriented modeling. It would be useful in many situations also as a language mechanism, reverse inheritance, but there have been only few detailed proposals for that. This paper defines reverse inheritance as a true ...
- articleDecember 2008
- articleJanuary 2007
A formalism for reasoning about UML activity diagrams
The major problem of UML activity diagrams is the lack of a rigorous approach for verifying the correctness of a model. In this paper, we examine how activity diagrams defined in UML 2.0 standard are formally analyzed using NuSMV model checker. A model ...
- articleJanuary 2007
Using forward reachability analysis for verification of timed petri nets
We consider verification of safety properties for concurrent real-timed systems modelled as timed Petri nets by performing symbolic forward reachability analysis. We introduce a formalism, called region generators, for representing sets of markings of ...
- articleDecember 2006
Verification of Giotto based embedded control systems
An implementation of a control system design may not preserve the functional and timing requirements of the application. Our goal is to verify that an implementation meets the high-level timing and functional specifications of a control application. We ...
-
- articleSeptember 2006
Increasing comprehensibility of object models: making the roles of attributes explicit in UML diagrams
UML allows to produce and maintain object-oriented models of systems from different perspectives and view points using the notion of a diagram. This paper describes how the comprehensibility of models can be increased by augmenting some UML diagrams ...
- articleSeptember 2006
- articleJune 2006
Formal development of NoC systems in B
When developing complex Network-on-Chip (NoC) systems we need to ensure that they satisfy their functional requirements. This can be achieved by developing the systems in a structured way using a formal method with tool support. We use the B Action ...
- articleJune 2006
Static analysis for blinding
The classical key distribution protocols are based on symmetric and asymmetric encryption as well as digital signatures. Protocols with different purposes often requires different cryptographic primitives, an example is electronic voting protocols which ...
- articleJune 2006
Deriving the type flaw attacks in the Otway-Rees protocol by rewriting
This paper presents an approach to formalizing and verifying security protocol specifications based on rewriting techniques. A rewrite system Rp describes the steps of a protocol and the properties under consideration, and a rewrite system RI defines an ...
- articleJune 2006
Axiomatizing binding bigraphs
We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove that it is unique up to certain isomorphisms.Our work builds on Milner's ...
- articleJune 2006
On the expressive power of the loop language
We define a translation of Meyer and Ritchie's Loop language into a subsystem of Gödel's system T (with product types). Then we show that this translation actually provides a lock-step simulation if a call-by-value strategy is assumed for system T. Some ...
- articleJune 2006
Optimizing slicing of formal specifications by deductive verification
Slicing is a technique for extracting parts of programs or specifications with respect to certain criteria of interest. The extraction is carried out in such a way that properties as described by the slicing criterion are preserved, i.e., they hold in ...
- articleJune 2006
Structured formal development in Isabelle
General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program development. However, these provers generally lack many of the useful structuring mechanisms ...
- articleApril 2005
Refining UML interactions with underspecification and nondeterminism
STAIRS is an approach to the compositional development of UML interactions, such as sequence diagrams and interaction overview diagrams. An important aspect of STAIRS is the ability to distinguish between underspecification and inherent nondeterminism ...
- articleApril 2005
Transfinite corecursion
This paper presents theorems which enable to define transfinite semantics for programming languages easily. We call these theorems "corecursion theorems" because they state the existence of a function satisfying certain conditions analogous to the usual ...
- articleApril 2005
A compositional trace logic for behavioural interface specifications
We describe a compositional trace logic for behavioural interface specifications and corresponding proof rules for compositional reasoning. The trace logic is defined in terms of axioms in higher-order logic. This trace logic is applicable to any object-...
- articleApril 2005
- articleSeptember 2004
Structured nodes in UML 2.0 activities
The upcoming major revision of the UML (see [OMG 2003b]) has introduced significant changes and additions to "the lingua franca of Software Engineering". Within the UML, activity diagrams are particularly prominent, since they are the natural choice ...