• Publications
  • Influence
A concurrent, generational garbage collector for a multithreaded implementation of ML
TLDR
This paper presents the design and implementation of a “quasi real-time” garbage collector for Concurrent Caml Light, an implementation of ML with threads. Expand
Portable, unobtrusive garbage collection for multiprocessor systems
TLDR
We describe and prove the correctness of a new concurrent mark-and-sweep garbage collection algorithm for multiprocessor environments where the registers of running processes are not readily accessible, without imposing any overhead on the elementary operations of loading a register or reading or initializing a field. Expand
The OCaml system release 4.07: Documentation and user's manual
TLDR
This manual documents the release 4.07 of the OCaml system. Expand
Zenon : An Extensible Automated Theorem Prover Producing Checkable Proofs
TLDR
We present Zenon, an automated theorem prover for first order classical logic (with equality), based on the tableau method. Expand
Verifying Safety Properties with the TLA+ Proof System
TLDR
TLAPS, the TLA+ proof system, is a platform for the development and mechanical verification of Tla+ proofs. Expand
Zenon Modulo: When Achilles Outruns the Tortoise Using Deduction Modulo
TLDR
We propose an extension of the tableau-based first order automated theorem prover Zenon to deduction modulo, which allows us to transform axioms into rewrite rules. Expand
The TLA+ Proof System: Building a Heterogeneous Verification Platform
TLDR
Model checking has proved to be an efficient technique for finding subtle bugs in concurrent and distributed algorithms and systems. Expand
A foundation for flow-based program matching: using temporal logic and model checking
TLDR
We propose an extension to CTL named CTLVW (CTL with variables and witnesses) that is a suitable basis for the semantics and implementation of the Coccinelles program matching language. Expand
A TLA+ Proof System
TLDR
We describe an extension to the TLA+ specification language with constructs for writing proofs and a proof environment, called the Proof Manager (PM), to checks those proofs. Expand
...
1
2
3
4
5
...