Ensuring Correctness of Model Transformations While Remaining Decidable

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-46750-4_18
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Proving the Correctness of Recursion-Based Automatic Program Transformations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Maximizing Correctness With Minimal User Effort to Learn Data Transformations

2016English

Ensuring Global Termination of Partial Deduction While Allowing Flexible Polyvariance

1995English

Managing Perceived Conflicts of Interest While Ensuring the Continued Innovation of Medical Technology

Journal of Vascular Surgery
SurgeryCardiovascular MedicineCardiology
2011English

Analysis of Directions for Overcoming the Difficulties of Warehousing While Ensuring Logistics Processes

ScienceRise
2019English

Decidable Containment of Recursive Queries

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2005English

A Refinement-Based Correctness Proof of Symmetry Reduced Model Checking

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Correctness of Incremental Model Synchronization With Triple Graph Grammars

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

The Evaluation Transformer Model of Reduction and Its Correctness

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1991English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy