Correctness of Pointer Manipulating Algorithms Illustrated by a Verified BDD Construction

Giorgino, Mathieu; Strecker, Martin

doi:10.1007/978-3-642-32759-9_18

Search citation statements

Order By: Relevance

Paper Sections

Select...

Related Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

2022

Publication Types

Select...

Article1

Book1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A second option is to add to an existing functional specification language certain imperative traits as monads, then modify the extraction function from the specification language to the target language so as to translate monadic operations into imperative calls, as has been done for Isabelle/HOL [6]; this approach has been used to verify a BDD package [10]. Special proof idioms have to be used for monadic programs, in addition to the general difficulty of programming in monadic style (see §2.1).…”

Section: Related Workmentioning

confidence: 99%

Implementing and Reasoning About Hash-consed Data Structures in Coq

2014

View full text Add to dashboard Cite

We report on four different approaches to implementing hash-consing in Coq programs. The use cases include execution inside Coq, or execution of the extracted OCaml code. We explore the different trade-offs between faithful use of pristine extracted code, and code that is fine-tuned to make use of OCaml programming constructs not available in Coq. We discuss the possible consequences in terms of performances and guarantees. We use the running example of binary decision diagrams and then demonstrate the generality of our solutions by applying them to other examples of hash-consed data structures.

show abstract

Section: Related Workmentioning

confidence: 99%