<--- Back to Details
First PageDocument Content
Software engineering / Computer programming / Computing / Functional languages / Data types / Type theory / Logic in computer science / Automated theorem proving / OCaml / Coq / Disjoint-set data structure / Proof assistant
Date: 2017-09-21 08:25:51
Software engineering
Computer programming
Computing
Functional languages
Data types
Type theory
Logic in computer science
Automated theorem proving
OCaml
Coq
Disjoint-set data structure
Proof assistant

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits

Add to Reading List

Source URL: chargueraud.org

Download Document from Source Website

File Size: 372,81 KB

Share Document on Facebook

Similar Documents

What’s new in OCaml 4.02 Xavier Leroy INRIA Paris-Rocquencourt OCaml Workshop,

What’s new in OCaml 4.02 Xavier Leroy INRIA Paris-Rocquencourt OCaml Workshop,

DocID: 1v9AG - View Document

Towards Automatic Resource Bound Analysis for OCaml Ar tifact * Complete

Towards Automatic Resource Bound Analysis for OCaml Ar tifact * Complete

DocID: 1uNpP - View Document

The OCaml system release 4.06 Documentation and user’s manual Xavier Leroy, Damien Doligez, Alain Frisch, Jacques Garrigue, Didier R´emy and J´erˆome Vouillon

The OCaml system release 4.06 Documentation and user’s manual Xavier Leroy, Damien Doligez, Alain Frisch, Jacques Garrigue, Didier R´emy and J´erˆome Vouillon

DocID: 1tWs8 - View Document

MLGMPIDL: OCaml interface for GMP and MPFR libraries (versionAugust 30, 2012  All files distributed in the MLGMPIDL interface are distributed under LGPL license.

MLGMPIDL: OCaml interface for GMP and MPFR libraries (versionAugust 30, 2012 All files distributed in the MLGMPIDL interface are distributed under LGPL license.

DocID: 1tPSR - View Document