Partial, total and general correctness
From MaRDI portal
Publication:3575271
DOI10.1007/978-3-642-13321-3_11zbMATH Open1286.68077OpenAlexW2142100108MaRDI QIDQ3575271FDOQ3575271
Authors: Walter Guttmann 
Publication date: 26 July 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13321-3_11
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semirings (16Y60)
Cited In (15)
- Typing theorems of omega algebra
- Title not available (Why is that?)
- On completeness of omega-regular algebras
- Fixpoints for general correctness
- Normal forms in total correctness for while programs and action systems
- Algebras for iteration and infinite computations
- General correctness algebra
- Unifying correctness statements
- General correctness: A unification of partial and total correctness
- Unifying lazy and strict computations
- Infinite executions of lazy and strict computations
- Semantic models for total correctness and fairness
- Semantic models for total correctness and fairness
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Partial, total and general correctness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575271)
