Results 1 - 10 of 464

Verifying UML/OCL Operation Contracts

by Jordi Cabot, Robert Clarisó, Daniel Riera
"... Abstract. In current model-driven development approaches, software models are the primary artifacts of the development process. Therefore, assessment of their correctness is a key issue to ensure the quality of the final application. Research on model consistency has focused mostly on the models ’ s ..."
Abstract - Cited by 13 (0 self) - Add to MetaCart
’ static aspects. Instead, this paper addresses the verification of their dynamic aspects, expressed as a set of operations defined by means of pre/postcondition contracts. This paper presents an automatic method based on Constraint Programming to verify UML models extended with OCL constraints

A generalisation, a simplification and some applications of Paillier's probabilistic public-key system

by Ivan Damgård, Mads Jurik - LNCS , 2001
"... We propose a generalisation of Paillier’s probabilistic public key system, in which the expansion factor is reduced and which allows to adjust the block length of the scheme even after the public key has been fixed, without loosing the homomorphic property.We show that the generalisation is as secu ..."
Abstract - Cited by 222 (2 self) - Add to MetaCart
is as secure as Paillier’s original system. We construct a threshold variant of the generalised scheme as well as zero-knowledge protocols to show that a given ciphertext encrypts one of a set of given plaintexts, and protocols to verify multiplicative relations on plaintexts. We then show how these building

Verifying UML/OCL models using Boolean satisfiability

by Mathias Soeken, Robert Wille, Mirco Kuhlmann, Martin Gogolla, Rolf Drechsler - in Design, Automation and Test in Europe. IEEE Computer Society , 2010
"... Abstract—Nowadays, modeling languages like UML are essential in the design of complex software systems and also start to enter the domain of hardware and hardware/software codesign. Due to shortening time-to-market demands, “first time right ” requirements have thereby to be satisfied. In this paper ..."
Abstract - Cited by 24 (13 self) - Add to MetaCart
. In this paper, we propose an approach that makes use of Boolean satisfiability for verifying UML/OCL models. We describe how the respective components of a verification problem, namely system states of a UML model, OCL constraints, and the actual verification task, can be encoded and afterwards automatically

Verifying fence elimination optimisations

by Viktor Vafeiadis - In Proc. SAS , 2011
"... Abstract. We consider simple compiler optimisations for removing redundant memory fences in programs running on top of the x86-TSO relaxed memory model. While the optimisations are performed using standard thread-local control flow analyses, their correctness is subtle and relies on a non-standard g ..."
Abstract - Cited by 9 (0 self) - Add to MetaCart
Abstract. We consider simple compiler optimisations for removing redundant memory fences in programs running on top of the x86-TSO relaxed memory model. While the optimisations are performed using standard thread-local control flow analyses, their correctness is subtle and relies on a non

A Hoare calculus for verifying Java realizations of OCL-constrained design models

by Bernhard Reus, Martin Wirsing, Rolf Hennicker - FASE Proceedings, LNCS 2029 , 2001
"... Abstract. The Object Constraint Language OCL offers a formal notation for constraining the modelling elements occurring in UML diagrams. In this paper we apply OCL for developing Java realizations of UML design models and introduce a new Hoare-Calculus for Java classes which uses OCL as assertion la ..."
Abstract - Cited by 19 (2 self) - Add to MetaCart
language. The Hoare rules are as usual for while programs, blocks and (possibly recursive) method calls. Update of instance variables is handled by an explicit substitution operator which also takes care of aliasing. For verifying a Java subsystem w.r.t. a design subsystem specified using OCL constraints

Towards Verifying Java Realizations Of Ocl-Constrained Design Models Using JML

by Ali Hamie , 2002
"... The Object Constraint Language OCL is a formal textual notation that could be used for placing constraints on the modelling elements that occur in UML diagrams. Constraints include invariants on classes and types, and preconditions and postconditions of operations. OCL was designed to be used in con ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
is used as the assertion language. This is achieved by translating a subset of OCL assertions into JML assertions. In order to verify a Java subsystem with respect to a design subsystem with OCL constraints, an appropriate realization relation is defined and the approach is illustrated by an example.

Constructing verifiably correct Java programs using OCL and CleanJava

by Yoonsik Cheon, Carmen Avila, Yoonsik Cheon, Carmen Avila , 2013
"... Abstract—A recent trend in software development is building a precise model that can be used as a basis for the software development. Such a model may enable an automatic generation of working code, and more importantly it provides a foundation for correctness reasoning of code. In this paper we pro ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
propose a practical approach for constructing a verifiably correct program from such a model. The key idea of our approach is (a) to systematically translate formally-specified design constraints such as class invariants and operation pre and postconditions to code-level annotations and (b) to use

Verifying Consistency between Activity Diagrams and Their Corresponding OCL Contracts

by Christoph Hilken, Julia Seiter, Robert Wille, Ulrich Kühne, Rolf Drechsler
"... Abstract—Modeling languages such as SysML provide various description means for a precise specification of the desired system. As a system model typically uses multiple diagram types focusing on different aspects, it is crucial to keep them consistent to each other. In this paper, we propose a verif ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
verification methodology which ensures the consistency between activity diagrams as blueprints for the implementation and their contracts from a block definition diagram. For this purpose, activity diagrams are transformed to OCL constraints that can be checked against pre- and post-conditions. The proposed

Using OCL and CleanJava

by Yoonsik Cheon, Carmen Avila, Yoonsik Cheon, Carmen Avila , 2013
"... Abstract—A recent trend in software development is building a precise model that can be used as a basis for the software development. Such a model may enable an automatic generation of working code, and more importantly it provides a foundation for correctness reasoning of code. In this paper we pro ..."
Abstract - Add to MetaCart
propose a practical approach for constructing a verifiably correct program from such a model. The key idea of our approach is (a) to systematically translate formally-specified design constraints such as class invariants and operation pre and postconditions to code-level annotations and (b) to use

A Hoare Calculus for Verifying Java Realizations of OCL-Constrained Design Models

by unknown authors
"... ..."
Abstract - Add to MetaCart
Abstract not found
Results 1 - 10 of 464