Proving the Correctness of Recursion-Based Automatic Program Transformations

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-59293-8_228
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Proving Correctness of Highly-Concurrent Linearisable Objects

2006English

Ensuring Correctness of Model Transformations While Remaining Decidable

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Composable, Sound Transformations of Nested Recursion and Loops

2019English

Program Correctness by Transformation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Automatically Proving Program Termination

English

Proving Theorems by Program Transformation

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2013English

Validate the Correctness of Object Oriented Program With Regression Testing

International Journal of Computer Applications
2014English

Toward the Automatic Derivation of XML Transformations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Maximizing Correctness With Minimal User Effort to Learn Data Transformations

2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy