default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Clochard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2018
[b1]Martin Clochard:
Méthodes et outils pour la spécification et la preuve de propriétés difficiles de programmes séquentiels. (Methods and tools for specification and proof of difficult properties of sequential programs). University of Paris-Saclay, France, 2018
Journal Articles
- 2020
- [j4]Christoph Sprenger
, Tobias Klenze, Marco Eilers, Felix A. Wolf, Peter Müller, Martin Clochard, David A. Basin:
Igloo: soundly linking compositional refinement and separation logic for distributed system verification. Proc. ACM Program. Lang. 4(OOPSLA): 152:1-152:31 (2020) - [j3]Martin Clochard, Claude Marché, Andrei Paskevich:
Deductive verification with ghost monitors. Proc. ACM Program. Lang. 4(POPL): 2:1-2:26 (2020) - 2018
- [j2]Martin Clochard, Léon Gondelman, Mário Pereira:
The Matrix Reproved (Verification Pearl). J. Autom. Reason. 60(3): 365-383 (2018) - 2017
- [j1]Ran Chen, Martin Clochard, Claude Marché:
A Formally Proved, Complete Algorithm for Path Resolution with Symbolic Links. J. Formaliz. Reason. 10(1): 51-66 (2017)
Conference and Workshop Papers
- 2021
- [c7]Felix A. Wolf, Linard Arquint, Martin Clochard, Wytse Oortwijn, João Carlos Pereira, Peter Müller:
Gobra: Modular Specification and Verification of Go Programs. CAV (1) 2021: 367-379 - 2016
- [c6]Martin Clochard, Léon Gondelman, Mário Pereira:
The Matrix Reproved (Verification Pearl). VSTTE 2016: 107-118 - 2015
- [c5]Martin Clochard, Jean-Christophe Filliâtre, Andrei Paskevich:
How to Avoid Proving the Absence of Integer Overflows. VSTTE 2015: 94-109 - 2014
- [c4]Martin Clochard, Claude Marché, Andrei Paskevich:
Verified programs with binders. PLPV 2014: 29-40 - [c3]Swarat Chaudhuri, Martin Clochard, Armando Solar-Lezama:
Bridging boolean and quantitative synthesis using smoothed proof search. POPL 2014: 207-220 - [c2]Martin Clochard, Jean-Christophe Filliâtre, Claude Marché, Andrei Paskevich:
Formalizing Semantics with an Automatic Program Verifier. VSTTE 2014: 37-51 - [c1]Martin Clochard:
Automatically Verified Implementation of Data Structures Based on AVL Trees. VSTTE 2014: 167-180
Informal and Other Publications
- 2021
- [i2]Felix A. Wolf, Linard Arquint, Martin Clochard, Wytse Oortwijn, João Carlos Pereira, Peter Müller:
Gobra: Modular Specification and Verification of Go Programs (extended version). CoRR abs/2105.13840 (2021) - 2020
- [i1]Christoph Sprenger, Tobias Klenze, Marco Eilers, Felix A. Wolf, Peter Müller, Martin Clochard, David A. Basin:
Igloo: Soundly Linking Compositional Refinement and Separation Logic for Distributed System Verification. CoRR abs/2010.04749 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
