46,833 research outputs found
Automated verification of model transformations based on visual contracts
The final publication is available at Springer via http://dx.doi.org/10.1007/s10515-012-0102-yModel-Driven Engineering promotes the use of models to conduct the different phases of the software development. In this way, models are transformed between different languages and notations until code is generated for the final application. Hence, the construction of correct Model-to-Model (M2M) transformations becomes a crucial aspect in this approach.
Even though many languages and tools have been proposed to build and execute M2M transformations, there is scarce support to specify correctness requirements for such transformations in an implementation-independent way, i.e., irrespective of the actual transformation language used.
In this paper we fill this gap by proposing a declarative language for the specification of visual contracts, enabling the verification of transformations defined with any transformation language. The verification is performed by compiling the contracts into QVT to detect disconformities of transformation results with respect to the contracts. As a proof of concept, we also report on a graphical modeling environment for the specification of contracts, and on its use for the verification of transformations in several case studies.This work has been funded by the Austrian Science Fund (FWF) under grant P21374-N13,
the Spanish Ministry of Science under grants TIN2008-02081 and TIN2011-24139, and the
R&D programme of the Madrid Region under project S2009/TIC-1650
Timed Automata Semantics for Visual e-Contracts
C-O Diagrams have been introduced as a means to have a more visual
representation of electronic contracts, where it is possible to represent the
obligations, permissions and prohibitions of the different signatories, as well
as what are the penalties in case of not fulfillment of their obligations and
prohibitions. In such diagrams we are also able to represent absolute and
relative timing constraints. In this paper we present a formal semantics for
C-O Diagrams based on timed automata extended with an ordering of states and
edges in order to represent different deontic modalities.Comment: In Proceedings FLACOS 2011, arXiv:1109.239
Conformance Verification of Normative Specifications using C-O Diagrams
C-O Diagrams have been introduced as a means to have a visual representation
of normative texts and electronic contracts, where it is possible to represent
the obligations, permissions and prohibitions of the different signatories, as
well as what are the penalties in case of not fulfillment of their obligations
and prohibitions. In such diagrams we are also able to represent absolute and
relative timing constrains.
In this paper we consider a formal semantics for C-O Diagrams based on a
network of timed automata and we present several relations to check the
consistency of a contract in terms of realizability, to analyze whether an
implementation satisfies the requirements defined on its contract, and to
compare several implementations using the executed permissions as criteria.Comment: In Proceedings FLACOS 2012, arXiv:1209.169
On Verifying Resource Contracts using Code Contracts
In this paper we present an approach to check resource consumption contracts
using an off-the-shelf static analyzer.
We propose a set of annotations to support resource usage specifications, in
particular, dynamic memory consumption constraints. Since dynamic memory may be
recycled by a memory manager, the consumption of this resource is not monotone.
The specification language can express both memory consumption and lifetime
properties in a modular fashion.
We develop a proof-of-concept implementation by extending Code Contracts'
specification language. To verify the correctness of these annotations we rely
on the Code Contracts static verifier and a points-to analysis. We also briefly
discuss possible extensions of our approach to deal with non-linear
expressions.Comment: In Proceedings LAFM 2013, arXiv:1401.056
Automatic Test Generation for Space
The European Space Agency (ESA) uses an engine to perform tests in the Ground
Segment infrastructure, specially the Operational Simulator. This engine uses
many different tools to ensure the development of regression testing
infrastructure and these tests perform black-box testing to the C++ simulator
implementation. VST (VisionSpace Technologies) is one of the companies that
provides these services to ESA and they need a tool to infer automatically
tests from the existing C++ code, instead of writing manually scripts to
perform tests. With this motivation in mind, this paper explores automatic
testing approaches and tools in order to propose a system that satisfies VST
needs
Kopernik : modeling business processes for digital customers
This paper presents the Kopernik methodology for modeling business processes for digital customers. These processes require a high degree of flexibility in the execution of their tasks or actions. We achieve this by using the artifact-centric approach to process modeling and the use of condition-action rules. The processes modeled following Kopernik can then be implemented in an existing commercial tool, Balandra.Preprin
Library purchasing consortia: their activity and effect on the marketplace
This chapter is based on a survey undertaken for a BLRIC/LIC-funded research project (RIC/G/403). It describes the models of operation of purchasing consortia in three library sectors (health, higher education and public libraries) and discusses present and future savings deriving from consortial activity. The effects of consortia on suppliers are discussed and future activity predicted. The views expressed are those of the authors, not of BLRIC or LIC
Metamodel-based model conformance and multiview consistency checking
Model-driven development, using languages such as UML and BON, often makes use of multiple diagrams (e.g., class and sequence diagrams) when modeling systems. These diagrams, presenting different views of a system of interest, may be inconsistent. A metamodel provides a unifying framework in which to ensure and check consistency, while at the same time providing the means to distinguish between valid and invalid models, that is, conformance. Two formal specifications of the metamodel for an object-oriented modeling language are presented, and it is shown how to use these specifications for model conformance and multiview consistency checking. Comparisons are made in terms of completeness and the level of automation each provide for checking multiview consistency and model conformance. The lessons learned from applying formal techniques to the problems of metamodeling, model conformance, and multiview consistency checking are summarized
- …