Limiting semantics of numerical programs

DOI10.1016/S0304-3975(96)00050-3MaRDI QIDQ1392276zbMATH OpenOpenAlexFDO

Authors Douglas N. Hoover

Publication date 23 July 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(96)00050-3

zbMATH Keywords

semantic models

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• Verification, Model Checking, and Abstract Interpretation
• A Denotational Semantics for Total Correctness of Sequential Exact Real Programs
• Semantics of a sequential language for exact real-number computation
• Semantics of roundoff error propagation in finite precision calculations
• Semantics of probabilistic programs: a weak limit approach

Cites work

• scientific article; zbMATH DE number 1678359 (Why is no real title available?)
• scientific article; zbMATH DE number 3112450 (Why is no real title available?)
• scientific article; zbMATH DE number 3846844 (Why is no real title available?)
• scientific article; zbMATH DE number 4212991 (Why is no real title available?)
• scientific article; zbMATH DE number 4094358 (Why is no real title available?)
• scientific article; zbMATH DE number 3658971 (Why is no real title available?)
• scientific article; zbMATH DE number 3720907 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 1231460 (Why is no real title available?)
• scientific article; zbMATH DE number 555217 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3349780 (Why is no real title available?)
• scientific article; zbMATH DE number 3379785 (Why is no real title available?)
• A Simple but Realistic Model of Floating-Point Computation
• Completeness of Quasi-Uniform and Syntopological Spaces
• Domain theory and integration
• Dynamical systems, measures, and fractals via domain theory
• Limiting semantics of numerical programs
• Metric spaces, generalized logic, and closed categories
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• \(\mathbb{T}^\omega\) as a universal domain

Cited in

(3)

• Limiting semantics of numerical programs
• Verification, Model Checking, and Abstract Interpretation
• Abstract Semantic Differencing for Numerical Programs

This page was built for publication: Limiting semantics of numerical programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392276)