Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems

DOI10.1007/978-3-642-02270-8_6MaRDI QIDQ5321691zbMATH OpenOpenAlexFDO

Authors Changjing Wang, Jinyun Xue

Publication date 14 July 2009

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02270-8_6

zbMATH Keywords

dioidformal derivationgeneric algorithmhigh-trustworthypath problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Nonnumerical algorithms (68W05)

Recommendations

• Formal-Language-Constrained Path Problems
• A trust branching path heuristic for zero-one programming
• The -reliable shortest path problem
• scientific article; zbMATH DE number 962401
• Formal derivation of graph algorithmic programs using partition-and-recur
• Trusting computations: a mechanized proof from partial differential equations to actual program
• Formal language constrained path problems
• Formal Verification Based on Guided Random Walks
• scientific article; zbMATH DE number 1342248

Cites work

• A Unified Approach to Path Problems
• An axiomatic basis for computer programming
• Calculating path algorithms
• Designware: Software development by refinement
• Generalized path-finding algorithms on semirings and the fuzzy shortest path problem.
• scientific article; zbMATH DE number 3936465 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)

Describes a project that uses

Uses Software

• Z

This page was built for publication: Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems

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