FreeSpec: specifying, verifying, and executing impure computations in Coq

Letan, Thomas; Régis-Gianas, Yann

doi:10.1145/3372885.3373812

Cited by 9 publications

(4 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These operations involve side effects and, naturally, have no easy correspondence in Coq. Fortunately, dealing with side-effects in pure functional settings is a well-studied problem [7,11,5] and there are different solutions, including Coq libraries, that we could adapt to translate effectful SML code.…”

Section: Discussionmentioning

confidence: 99%

SMLtoCoq: Automated Generation of Coq Specifications and Proof Obligations from SML Programs with Contracts

El-Beheiry

Reis

Karkour

2021

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Formally reasoning about functional programs is supposed to be straightforward and elegant, however, it is not typically done as a matter of course. Reasoning in a proof assistant requires "reimplementing" the code in those tools, which is far from trivial. SMLtoCoq provides an automatic translation of SML programs and function contracts into Coq. Programs are translated into Coq specifications, and function contracts into theorems, which can then be formally proved. Using the Equations plugin and other well established Coq libraries, SMLtoCoq is able to translate SML programs without side-effects containing partial functions, structures, functors, records, among others. Additionally, we provide a Coq version of many parts of SML's basis library, so that calls to these libraries are kept almost as is.

show abstract

Section: Discussionmentioning

confidence: 99%

SMLtoCoq: Automated Generation of Coq Specifications and Proof Obligations from SML Programs with Contracts

El-Beheiry

Reis

Karkour

2021

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…Interaction Trees. Interaction trees have been used to verify compilation of an imperative programming language [74], networked servers [40,48], an HTTP key-value server [76], and transactional objects [47]. The Zar system presents a novel application of interaction trees to verified executable semantics of probabilistic programs, and employs a novel domain-theoretic framework for reasoning about them (Section 3.4).…”

Section: Related Workmentioning

confidence: 99%

Formally Verified Samplers From Probabilistic Programs With Loops and Conditioning

Bagnall¹,

Stewart²,

Banerjee³

2022

Preprint

View full text Add to dashboard Cite

We present Zar: a formally verified compiler pipeline from discrete probabilistic programs with unbounded loops in the conditional probabilistic guarded command language (cpGCL) to proved-correct executable samplers in the random bit model. We exploit the key idea that all discrete probability distributions can be reduced to unbiased coin-flipping schemes. The compiler pipeline first translates a cpGCL program into choice-fix trees, an intermediate representation suitable for reduction of biased probabilistic choices. Choice-fix trees are then translated to coinductive interaction trees for execution within the random bit model. The correctness of the composed translations establishes the sampling equidistribution theorem: compiled samplers are correct wrt. the conditional weakest pre-expectation semantics of cpGCL source programs. Zar is implemented and fully verified in the Coq proof assistant. We extract verified samplers to OCaml and Python and empirically validate them on a number of illustrative examples.

show abstract

“…We also favor the computational encoding of semantics. Similar to the recent related works on mechanization of operational semantics [23][24][25], we encode the semantics as monadic interpreters. This allows us to extract [26] the semantics as a functional program and run it.…”

Section: Overview Of Our Librarymentioning

confidence: 99%

Mechanized Theory of Event Structures: A Case of Parallel Register Machine

Гладштейн¹,

Михайловский²,

Моисеенко³

et al. 2021

Proceedings of ISP RAS

View full text Add to dashboard Cite

The true concurrency models, and in particular event structures, have been introduced in the 1980s as an alternative to operational interleaving semantics of concurrency, and nowadays they are regaining popularity. Event structures represent the causal dependency and conflict between the individual atomic actions of the system directly. This property leads to a more compact and concise representation of semantics. In this work-in-progress report, we present a theory of event structures mechanized in the COQ proof assistant and demonstrate how it can be applied to define certified executable semantics of a simple parallel register machine with shared memory.

show abstract

FreeSpec: specifying, verifying, and executing impure computations in Coq

Cited by 9 publications

References 32 publications

SMLtoCoq: Automated Generation of Coq Specifications and Proof Obligations from SML Programs with Contracts

SMLtoCoq: Automated Generation of Coq Specifications and Proof Obligations from SML Programs with Contracts

Formally Verified Samplers From Probabilistic Programs With Loops and Conditioning

Mechanized Theory of Event Structures: A Case of Parallel Register Machine

Contact Info

Product

Resources

About