Formal development and verification of approximation algorithms using auxiliary variables

DOI10.1007/978-3-540-25938-1_6MaRDI QIDQ5713947zbMATH OpenOpenAlexFDO

Authors Rudolf Berghammer, Markus Müller-Olm

Publication date 27 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98080

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Approximation algorithms (68W25) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Formal program development with approximations
• scientific article; zbMATH DE number 88935
• The role of auxiliary variables in the formal development of concurrent programs
• Refinements for free!
• Efficient formal verification of bounds of linear programs

Cited in

(7)

• Effectively eliminating auxiliaries
• Weakest precondition reasoning for expected run-times of probabilistic programs
• Verified Approximation Algorithms
• Verified approximation algorithms
• Formal program development with approximations
• Cardinality of relations and relational approximation algorithms
• Verified Approximation Algorithms

This page was built for publication: Formal development and verification of approximation algorithms using auxiliary variables

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