Incremental parametric development of greedy algorithms

DOI10.1016/J.ENTCS.2007.05.028MaRDI QIDQ5178994zbMATH OpenOpenAlexFDO

Authors Dominique Cansell, Dominique Mery

Publication date 18 March 2015

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

Full work available at URL https://doi.org/10.1016/j.entcs.2007.05.028

zbMATH Keywords

B event-based methodformal methodgreedy algorithmsrefinementsafety

Mathematics Subject Classification ID

Data structures (68P05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 2013597
• Formal derivation of greedy algorithms from relational specifications: a tutorial
• A mechanically proved and incremental development of IEEE 1394 tree identify protocol
• Relational and Kleene-Algebraic Methods in Computer Science
• A class of greedy algorithms and its relation to greedoids

Cites work

• Click'n prove: interactive proofs within set theory
• scientific article; zbMATH DE number 2013582 (Why is no real title available?)
• scientific article; zbMATH DE number 2013597 (Why is no real title available?)
• Introduction to algorithms
• Searching by elimination
• The B-Book
• The classification of greedy algorithms

Cited in

(1)

• Modelling Attacker’s Knowledge for Cascade Cryptographic Protocols

Describes a project that uses

Uses Software

• B4Free

This page was built for publication: Incremental parametric development of greedy algorithms

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