Generalizations of algorithms that find invariant relationships in programs over algebra of terms
type: Item
instance of: scholarly article
title: Generalizations of algorithms that find invariant relationships in programs over algebra of terms
zbMATH Open document ID: 0879.68071
DOI: 10.1007/BF02366578
author: O. Diekmann
published in: Cybernetics and Systems Analysis
publication date: 1998-01-12T00:00:00Z
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 1051128
zbMATH Keywords: program invariants
zbMATH Keywords: free algebras
MaRDI profile type: Publication
cites work: Variations on the Common Subexpression Problem
cites work: Q4164790
Recommended article: Q3706481
Recommended article: Invariants and Well-Foundedness in Program Algebra
Recommended article: Relational algebraic semantics of deterministic and nondeterministic programs
Recommended article: Q3033332
Recommended article: Search for invariant linear relationships in programs
Recommended article: On the theory of program algebras
Recommended article: Q5395800
Recommended article: Static Analysis
Recommended article: Generic Properties for Semialgebraic Programs
Recommended article: Q3735051
description: scientific article; zbMATH DE number 1051128