Algebras for iteration and infinite computations
type: Item
instance of: scholarly article
title: Algebras for iteration and infinite computations
zbMATH Open document ID: 1279.68078
author: Walter Guttmann
published in: Acta Informatica
publication date: 2012-10-15T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q70
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 6093696
zbMATH Keywords: relational models of computations
zbMATH Keywords: separation
zbMATH Keywords: refinement
zbMATH Keywords: program transformation
zbMATH Keywords: iteration
zbMATH Keywords: Isabelle
describes a project that uses: Sledgehammer
describes a project that uses: Mace4
describes a project that uses: Nitpick
MaRDI profile type: Publication
full work available at URL: s00236-012-0162-2
OpenAlex ID: W2149537518
cites work: Fixed-point calculus
cites work: Verification of sequential and concurrent programs
cites work: Reasoning algebraically about loops
cites work: Relational algebraic semantics of deterministic and nondeterministic programs
cites work: Extending Sledgehammer with SMT Solvers
cites work: Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder
cites work: Q5287508
cites work: Q4192046
cites work: Q2721093
cites work: Q5639639
cites work: Q4125720
cites work: Demonic Algebra with Domain
cites work: Algebraic Notions of Termination
cites work: Kleene under a modal demonic star
cites work: Internal axioms for domain semirings
cites work: General Correctness Algebra
cites work: Partial, Total and General Correctness
cites work: Unifying Recursion in Partial, Total and General Correctness
cites work: Fixpoints for general correctness
cites work: Unifying Correctness Statements
cites work: Unifying Lazy and Strict Computations
cites work: Modal Design Algebra
cites work: Normal design algebra
cites work: Unifying Theories of Programming That Distinguish Nontermination and Abort
cites work: Unifying theories for logic programming
cites work: Omega Algebra, Demonic Refinement Algebra and Commands
cites work: General correctness: A unification of partial and total correctness
cites work: A completeness theorem for Kleene algebras and the algebra of regular events
cites work: Q4362921
cites work: On Hoare logic and Kleene algebra with tests
cites work: The Linear Algebra of UTP
cites work: Kleene getting lazy
cites work: Algebras of modal operators and partial correctness
cites work: A generalized control structure and its formal definition
cites work: Towards a refinement algebra
Wikidata QID: Q128988552
DOI: 10.1007/S00236-012-0162-2
description: scientific article; zbMATH DE number 6093696