Formal derivation of Greedy algorithms from relational specifications: A tutorial

Chiang, Yu-Hsi; Mu, Shin-Cheng

doi:10.1016/j.jlamp.2015.12.003

Cited by 2 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mechanised proofs of correctness of calculational reasoning has been considered in the Algebra of Programming in Agda (AOPA) system [11], and subsequently extended to include derivation of greedy algorithms using Galois connections [5]. Another interesting, complementary approach to program comprehension is Gibbons' program fission [7], in which the fusion law is applied "in reverse" to an optimized, existing program in order to attempt to discover a rationale for its behavior: for example by decomposing an optimized word-counting program into a "reforested" version that decomposes its behavior into "construct a list of all the words" and "take the length of the list".…”

Section: Related and Future Workmentioning

confidence: 99%

Verified Self-Explaining Computation

Stolarek

Cheney

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Common programming tools, like compilers, debuggers, and IDEs, crucially rely on the ability to analyse program code to reason about its behaviour and properties. There has been a great deal of work on verifying compilers and static analyses, but far less on verifying dynamic analyses such as program slicing. Recently, a new mathematical framework for slicing was introduced in which forward and backward slicing are dual in the sense that they constitute a Galois connection. This paper formalises forward and backward dynamic slicing algorithms for a simple imperative programming language, and formally verifies their duality using the Coq proof assistant.

show abstract

Section: Related and Future Workmentioning

confidence: 99%