An algebraic approach to computations with progress
type: Item
instance of: scholarly article
title: An algebraic approach to computations with progress
zbMATH Open document ID: 1344.68076
author: Walter Guttmann
published in: Journal of Logical and Algebraic Methods in Programming
publication date: 2016-06-22T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 6596345
zbMATH Keywords: approximation order
zbMATH Keywords: axiomatic program semantics
zbMATH Keywords: iteration algebras
zbMATH Keywords: relations
zbMATH Keywords: time
zbMATH Keywords: traces
describes a project that uses: Nitpick
describes a project that uses: Isabelle/HOL
describes a project that uses: Sledgehammer
MaRDI profile type: Publication
full work available at URL: j.jlamp.2015.11.009
OpenAlex ID: W2252281036
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: Q2721093
cites work: Q5639639
cites work: Completeness results for omega-regular algebras
cites work: Q4530231
cites work: Kleene algebra with domain
cites work: Conscriptions: A New Relational Model for Sequential Computations
cites work: Unifying Recursion in Partial, Total and General Correctness
cites work: Towards a Typed Omega Algebra
cites work: Algebras for iteration and infinite computations
cites work: Unifying Lazy and Strict Computations
cites work: Extended Conscriptions Algebraically
cites work: Infinite executions of lazy and strict computations
cites work: Normal design algebra
cites work: Unifying Theories of Programming That Distinguish Nontermination and Abort
cites work: Retrospective and Prospective for Unifying Theories of Programming
cites work: An algebra of hybrid systems
cites work: Automated Reasoning in Kleene Algebra
cites work: Automated verification of refinement laws
cites work: A completeness theorem for Kleene algebras and the algebra of regular events
cites work: The Linear Algebra of UTP
cites work: Kleene getting lazy
cites work: Isabelle/HOL. A proof assistant for higher-order logic
cites work: Q4362876
cites work: Q4041054
cites work: Enabledness and termination in refinement algebra
cites work: Towards a refinement algebra
Wikidata QID: Q128988484
DOI: 10.1016/J.JLAMP.2015.11.009
Recommended article: Q4510905
Recommended article: Q3707409
Recommended article: An algebra of mixed computation
Recommended article: Alcuni metodi computazionali in algebra
Recommended article: Q4534542
Recommended article: Q3697106
Recommended article: Q3715224
Recommended article: Q4282674
Recommended article: Prolongations and Computational Algebra
description: scientific article; zbMATH DE number 6596345