On Inductive Proofs by Extended Unfold/Fold Transformation Rules

2011 ◽  
pp. 117-132
Author(s):  
Hirohisa Seki
Keyword(s):  
Transformation Rules

INSTANCE MIGRATION BETWEEN ONTOLOGIES HAVING STRUCTURAL DIFFERENCES

2011 ◽  
Vol 20 (06) ◽  
pp. 1127-1156 ◽  
Author(s):  
MAXIM DAVIDOVSKY ◽  
VADIM ERMOLAYEV ◽  
VYACHESLAV TOLOK
Keyword(s):  
Knowledge Management ◽  
Life Cycle ◽  
Structural Changes ◽  
Software Framework ◽  
Ontology Alignment ◽  
Transformation Rules ◽  
Structural Differences ◽  
Prototype Software ◽  
Descriptive Theories ◽  
Future Work

Ontology instance migration is one of the complex and not fully solved problems in knowledge management. A solution is required when the ontology schema evolves in the life cycle and the assertions have to be transferred to the newer version. The problem may become more complex in distributed settings when, for example, several autonomous software entities use and exchange partial assertional knowledge in a domain that is formalized by different though semantically overlapping descriptive theories. Such an exchange is essentially the migration of the assertional part of an ontology to other ontologies belonging to or used by different entities. The paper presents our method and tool for migrating instances between the ontologies that have structurally different but semantically overlapping schemas. The approach is based on the use of the manually coded transformation rules describing the changes between the input and the output ontologies. The tool is implemented as a plug-in for the ProjectNavigator prototype software framework. The article also reports the results of our three evaluation experiments. In these experiments we evaluated the degree of complexity in the structural changes to which our approach remains valid. We also chose the ontology sets in one of the experiments to make the results comparable with the ontology alignment software. Finally we checked how well our approach scales with the increase of the quantity of the migrated ontology instances to the numbers that are characteristic to industrial ontologies. In our opinion the evaluation results are satisfactory and suggest some directions for the future work.

Formal Verification of Transformation Rules for Speculative Execution in Real-Time Systems

1996 ◽  
Vol 29 (6) ◽  
pp. 9-17
Author(s):  
Mohamed Younis ◽  
Grace Tsai ◽  
Thomas Marlowe ◽  
Alexander Stoyenko
Keyword(s):  
Formal Verification ◽  
Real Time ◽  
Speculative Execution ◽  
Real Time Systems ◽  
Transformation Rules ◽  
Time Systems

W-ALGEBRA REALIZATIONS AND W-GRAVITY ANOMALIES

1991 ◽  
Vol 06 (32) ◽  
pp. 2995-3003 ◽  
Author(s):  
C. M. HULL ◽  
L. PALACIOS
Keyword(s):  
Path Integral ◽  
Current Algebra ◽  
Gravity Anomalies ◽  
Normal Ordering ◽  
Path Integral Quantization ◽  
Transformation Rules ◽  
Higher Derivative ◽  
Quantum Current ◽  
Boson Model ◽  
Background Charge

The coupling of scalars fields to chiral W3 gravity is reviewed. In general the quantum current algebra generated by the spin-two and three currents does not close when the "natural" regularization (corresponding to the normal ordering with respect to the modes of ∂ϕi) is used, and the non-closure reflects matter-dependent anomalies in the path integral quantization. We consider the most general modification of the current, involving higher derivative "background charge" terms, and find the conditions for them to form a closed algebra in the "natural" regularization. These conditions can be satisfied only for the two-boson model. In that case, it is possible to cancel all the matter-dependent anomalies by adding finite local counter terms to the action and modifying the transformation rules of the fields.

Formal Metamodeling for Secure Model-Driven Engineering

2021 ◽  
Vol 12 (2) ◽  
pp. 46-67
Author(s):  
Liliana Maria Favre
Keyword(s):  
Cloud Computing ◽  
Formal Specifications ◽  
Model Driven Engineering ◽  
Model Driven ◽  
Transformation Rules ◽  
Systematic Development ◽  
Definition Of ◽  
Context Specific ◽  
Theoretical Foundations

Systems and applications aligned with new paradigms such as cloud computing and internet of the things are becoming more complex and interconnected, expanding the areas in which they are susceptible to attacks. Their security can be addressed by using model-driven engineering (MDE). In this context, specific IoT or cloud computing metamodels emerged to support the systematic development of software. In general, they are specified through semiformal metamodels in MOF style. This article shows the theoretical foundations of a method for automatically constructing secure metamodels in the context of realizations of MDE such as MDA. The formal metamodeling language Nereus and systems of transformation rules to bridge the gap between formal specifications and MOF are described. The main contribution of this article is the definition of a system of transformation rules called NEREUStoMOF for transforming automatically formal metamodeling specifications in Nereus to semiformal-MOF metamodels annotated in OCL.

scholarly journals A UML/OCL framework for the analysis of graph transformation rules

2009 ◽  
Vol 9 (3) ◽  
pp. 335-357 ◽  
Author(s):  
Jordi Cabot ◽  
Robert Clarisó ◽  
Esther Guerra ◽  
Juan de Lara
Keyword(s):  
Graph Transformation ◽  
Transformation Rules

scholarly journals Program Verification using Constraint Handling Rules and Array Constraint Generalizations

10.29007/dkxs ◽  
2018 ◽  
Author(s):  
Emanuele De Angelis ◽  
Fabio Fioravanti ◽  
Alberto Pettorossi ◽  
Maurizio Proietti
Keyword(s):  
Data Structures ◽  
Program Verification ◽  
Linear Constraints ◽  
Constraint Handling ◽  
Logic Programs ◽  
Replacement Strategy ◽  
Partial Correctness ◽  
Transformation Rules ◽  
Constraint Logic Programs ◽  
Additional Constraints

The transformation of constraint logic programs (CLP programs)has been shown to be an effective methodologyfor verifying properties of imperative programs.By following this methodology, we encode the negationof a partial correctness property of an imperativeprogram prog as a predicate incorrect defined by a CLP program P, and we show thatprog is correct by transforming P intothe empty program through the applicationof semantics preserving transformation rules.Some of these rules perform replacements of constraintsthat encode properties of the data structures manipulatedby the program prog.In this paper we show that Constraint Handling Rules (CHR)are a suitable formalism for representing and applyingconstraint replacements during the transformation of CLP programs.In particular, we consider programs that manipulate integerarrays and we present a CHR encoding of a constraint replacementstrategy based on the theory of arrays.We also propose a novel generalization strategy forconstraints on integer arrays that combinesthe CHR constraint replacement strategywith various generalization operator for linear constraints,such as widening and convex hull.Generalization is controlled by additional constraintsthat relate the variable identifiers in the imperativeprogram and the CLP representation of their values.The method presented in this paper has been implemented andwe have demonstrated itseffectiveness on a set ofbenchmark programs taken from the literature.

scholarly journals An Extended Rule of the SysML Requirement Diagram Transformation into OWL Ontologies

2021 ◽  
Vol 14 (1) ◽  
pp. 506-515
Author(s):  
Ahmad Ashari ◽  
◽  
Anny Sari ◽  
Helna Wardhana ◽  
◽  
...  
Keyword(s):  
Response Time ◽  
System Modeling ◽  
Unified Modeling Language ◽  
Modeling Language ◽  
Functional Requirements ◽  
Unified Modeling ◽  
Object Property ◽  
Transformation Rules ◽  
Owl Ontology ◽  
Time Required

The System Modeling Language (SysML) used the Requirement Diagram to model non-functional requirements, such as response time, size, or system functionality, which cannot be accommodated in the Unified Modeling Language (UML). SysML Requirement Diagram, in its implementation, integrates with several diagrams describing the requirements, which are referred to as additional elements. The absence of transformation rules for these additional elements to become OWL ontology causes difficulties in reading, understanding, and tracking the requirements. In this research, an extended rule of the Requirement Diagram transformation is proposed to solve the problems. First, some transformation rules are defined to make requirements easier to trace and realize the ontology generation's automatic transformation. Second, the time required during transformation processing to prepare and generate the OWL file shows the proposed model's performance. The ontology components produced from this research, such as class, subclass, object property, and data property, can be viewed in Protégé.

scholarly journals Uq(N) GAUGE THEORIES

1994 ◽  
Vol 09 (30) ◽  
pp. 2835-2847 ◽  
Author(s):  
LEONARDO CASTELLANI
Keyword(s):  
Quantum Groups ◽  
Differential Calculus ◽  
Gauge Theories ◽  
Space Time ◽  
Yang Mills ◽  
Commutation Relations ◽  
Transformation Rules ◽  
Field Strengths

Improving on an earlier proposal, we construct the gauge theories of the quantum groups U q(N). We find that these theories are also consistent with an ordinary (commuting) space-time. The bicovariance conditions of the quantum differential calculus are essential in our construction. The gauge potentials and the field strengths are q-commuting "fields," and satisfy q-commutation relations with the gauge parameters. The transformation rules of the potentials generalize the ordinary infinitesimal gauge variations. For particular deformations of U (N) ("minimal deformations"), the algebra of quantum gauge variations is shown to close, provided the gauge parameters satisfy appropriate q-commutations. The q-Lagrangian invariant under the U q(N) variations has the Yang–Mills form [Formula: see text], the "quantum metric" gij being a generalization of the Killing metric.

Sign in / Sign up

Export Citation Format

Share Document