default search action
Claude Marché
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j18]Benedikt F. H. Becker
, Nicolas Jeannerod
The CoLiS platform for the analysis of maintainer scripts in Debian software packages. Int. J. Softw. Tools Technol. Transf. 24(5): 717-733 (2022) - [j17]Cláudio Belo Lourenço, Denis Cousineau, Florian Faissole, Claude Marché, David Mentré, Hiroaki Inoue:
Automated formal analysis of temporal properties of Ladder programs. Int. J. Softw. Tools Technol. Transf. 24(6): 977-997 (2022) - [c42]Xavier Denis
Creusot: A Foundry for the Deductive Verification of Rust Programs. ICFEM 2022: 90-105 - 2021
- [c41]Cláudio Belo Lourenço
Automated Verification of Temporal Properties of Ladder Programs. FMICS 2021: 21-38 - [c40]Benedikt F. H. Becker, Cláudio Belo Lourenço
Explaining Counterexamples with Giant-Step Assertion Checking. F-IDE@NFM 2021: 82-88 - 2020
- [j16]Martin Clochard, Claude Marché
Deductive verification with ghost monitors. Proc. ACM Program. Lang. 4(POPL): 2:1-2:26 (2020) - [c39]Benedikt F. H. Becker
Analysing installation scenarios of Debian packages. TACAS (2) 2020: 235-253
2010 – 2019
- 2019
- [c38]Benedikt F. H. Becker, Claude Marché
Ghost Code in Action: Automated Verification of a Symbolic Interpreter. VSTTE 2019: 107-123 - 2018
- [j15]Sylvain Dailler, David Hauzar
Instrumenting a weakest precondition calculus for counterexample generation. J. Log. Algebraic Methods Program. 99: 97-113 (2018) - [c37]Sylvain Dailler, Claude Marché, Yannick Moy:
Lightweight Interactive Proving inside an Automatic Program Verifier. F-IDE@FLoC 2018: 1-15 - 2017
- [j14]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) - [c36]Nicolas Jeannerod, Claude Marché, Ralf Treinen:
A Formally Verified Interpreter for a Shell-Like Programming Language. VSTTE 2017: 1-18 - [c35]Raphaël Rieu-Helft, Claude Marché
How to Get an Efficient yet Verified Arbitrary-Precision Integer Library. VSTTE 2017: 84-101 - [c34]Clément Fumex, Claude Marché, Yannick Moy:
Automating the Verification of Floating-Point Programs. VSTTE 2017: 102-119 - 2016
- [c33]Nikolai Kosmatov, Claude Marché, Yannick Moy, Julien Signoles
Static versus Dynamic Verification in Why3, Frama-C and SPARK 2014. ISoLA (1) 2016: 461-478 - [c32]Clément Fumex, Claire Dross, Jens Gerlach, Claude Marché:
Specification and Proof of High-Level Functional Properties of Bit-Level Programs. NFM 2016: 291-306 - [c31]David Hauzar, Claude Marché, Yannick Moy:
Counterexamples from Proof Failures in SPARK. SEFM 2016: 215-233 - 2015
- [j13]François Bobot
Let's verify this with Why3. Int. J. Softw. Tools Technol. Transf. 17(6): 709-727 (2015) - [i1]Claude Marché, Johannes Kanig:
Bridging the Gap between Testing and Formal Verification in Ada Development. ERCIM News 2015(100) (2015) - 2014
- [j12]Claude Marché
Verification of the functional behavior of a floating-point program: An industrial case study. Sci. Comput. Program. 96: 279-296 (2014) - [c30]David Delahaye, Catherine Dubois, Claude Marché, David Mentré:
The BWare Project: Building a Proof Platform for the Automated Verification of B Proof Obligations. ABZ 2014: 290-293 - [c29]Martin Clochard, Claude Marché, Andrei Paskevich:
Verified programs with binders. PLPV 2014: 29-40 - [c28]Martin Clochard, Jean-Christophe Filliâtre, Claude Marché, Andrei Paskevich:
Formalizing Semantics with an Automatic Program Verifier. VSTTE 2014: 37-51 - 2013
- [c27]François Bobot, Jean-Christophe Filliâtre, Claude Marché, Guillaume Melquiond, Andrei Paskevich:
Preserving User Proofs across Specification Changes. VSTTE 2013: 191-201 - 2012
- [c26]David Mentré, Claude Marché, Jean-Christophe Filliâtre, Masashi Asuka:
Discharging Proof Obligations from Atelier B Using Multiple Automated Provers. ABZ 2012: 238-251 - [c25]Paolo Herms, Claude Marché, Benjamin Monate:
A Certified Multi-prover Verification Condition Generator. VSTTE 2012: 2-17 - 2011
- [j11]Sylvie Boldo, Claude Marché:
Formal Verification of Numerical Programs: From C Annotated Programs to Mechanical Proofs. Math. Comput. Sci. 5(4): 377-393 (2011) - [c24]Thi Minh Tuyen Nguyen, Claude Marché:
Hardware-Dependent Proofs of Numerical Programs. CPP 2011: 314-329 - [c23]Thorsten Bormer, Marc Brockschmidt, Dino Distefano, Gidon Ernst
The COST IC0701 Verification Competition 2011. FoVeOOS 2011: 3-21 - [e2]Bernhard Beckert, Claude Marché:
Formal Verification of Object-Oriented Software - International Conference, FoVeOOS 2010, Paris, France, June 28-30, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6528, Springer 2011, ISBN 978-3-642-18069-9 [contents] - 2010
- [j10]Yannick Moy, Claude Marché:
Modular inference of subprogram contracts for safety checking. J. Symb. Comput. 45(11): 1184-1211 (2010) - [c22]Ali Ayad, Claude Marché:
Multi-Prover Verification of Floating-Point Programs. IJCAR 2010: 127-141 - [c21]Asma Tafat, Sylvain Boulmé, Claude Marché:
A Refinement Methodology for Object-Oriented Programs. FoVeOOS 2010: 153-167 - [c20]Alain Giorgetti
Specifying generic Java programs: two case studies. LDTA 2010: 8
2000 – 2009
- 2008
- [j9]Francisco Durán
Proving operational termination of membership equational programs. High. Order Symb. Comput. 21(1-2): 59-88 (2008) - 2007
- [c19]Claude Marché:
Towards Modular Algebraic Specifications for Pointer Programs: A Case Study. Rewriting, Computation and Proof 2007: 235-258 - [c18]Jean-Christophe Filliâtre, Claude Marché:
The Why/Krakatoa/Caduceus Platform for Deductive Program Verification. CAV 2007: 173-177 - [c17]Claude Marché:
Jessie: an intermediate language for Java and C verification. PLPV 2007: 1-2 - [c16]Claude Marché, Hans Zantema:
The Termination Competition. RTA 2007: 303-313 - 2006
- [c15]Claude Marché, Nicolas Rousset:
Verification of JAVA CARD Applets Behavior with Respect to Transactions and Card Tears. SEFM 2006: 137-146 - 2005
- [j8]Salvador Lucas
Operational termination of conditional term rewriting systems. Inf. Process. Lett. 95(4): 446-453 (2005) - [j7]Evelyne Contejean, Claude Marché
Mechanically Proving Termination Using Polynomial Interpretations. J. Autom. Reason. 34(4): 325-363 (2005) - [c14]Thierry Hubert, Claude Marché:
A case study of C source code verification: the Schorr-Waite algorithm. SEFM 2005: 190-199 - [c13]Claude Marché, Christine Paulin-Mohring:
Reasoning About Java Programs with Aliasing and Frame Conditions. TPHOLs 2005: 179-194 - 2004
- [j6]Claude Marché
The KRAKATOA tool for certificationof JAVA/JAVACARD programs annotated in JML. J. Log. Algebraic Methods Program. 58(1-2): 89-106 (2004) - [j5]Claude Marché
Modular and incremental proofs of AC-termination. J. Symb. Comput. 38(1): 873-897 (2004) - [c12]Bart Jacobs, Claude Marché, Nicole Rauch:
Formal Verification of a Commercial Smart Card Applet with Multiple Tools. AMAST 2004: 241-257 - [c11]Jean-Christophe Filliâtre, Claude Marché:
Multi-prover Verification of C Programs. ICFEM 2004: 15-29 - [c10]Francisco Durán, Salvador Lucas
Proving termination of membership equational programs. PEPM 2004: 147-158 - 2002
- [j4]Claude Marché, Benoit Robert:
Dam Failure Risk: Its Definition and Impact on Safety Assessment of Dam Structures. J. Decis. Syst. 11(3-4): 513-534 (2002) - 2001
- [e1]Hubert Comon, Claude Marché, Ralf Treinen:
Constraints in Computational Logics: Theory and Applications, International Summer School, CCL'99 Gif-sur-Yvette, France, September 5-8, 1999, Revised Lectures. Lecture Notes in Computer Science 2002, Springer 2001, ISBN 3-540-41950-0 [contents] - 2000
- [c9]Enno Ohlebusch, Claus Claves, Claude Marché:
TALP: A Tool for the Termination Analysis of Logic Programs. RTA 2000: 270-273
1990 – 1999
- 1998
- [c8]Claude Marché, Xavier Urbain:
Termination of Associative-Commutative Rewriting by Dependency Pairs. RTA 1998: 241-255 - 1997
- [c7]Evelyne Contejean, Claude Marché, Landy Rabehasaina:
Rewrite Systems for Natural, Integral, and Rational Arithmetic. RTA 1997: 98-112 - 1996
- [j3]Claude Marché:
Normalized Rewriting: An Alternative to Rewriting Modulo a Set of Equations. J. Symb. Comput. 21(3): 253-288 (1996) - [c6]Alexandre Boudet, Evelyne Contejean, Claude Marché:
AC-Complete Unification and its Application to Theorem Proving. RTA 1996: 18-32 - [c5]Evelyne Contejean, Claude Marché:
CiME: Completion Modulo E. RTA 1996: 416-419 - 1994
- [c4]Claude Marché:
Normalised Rewriting and Normalised Completion. LICS 1994: 394-403 - 1993
- [c3]Claude Marché:
Normalized Rewriting - Application to Ground Completion and Standard Bases. Term Rewriting 1993: 154-169 - 1992
- [j2]Claude Marché:
The Word Problem of ACD-Ground Theories is Undecidable. Int. J. Found. Comput. Sci. 3(1): 81-97 (1992) - [j1]Jean-Pierre Jouannaud, Claude Marché:
Termination and Completion Modulo Associativity, Commutativity and Identity. Theor. Comput. Sci. 104(1): 29-51 (1992) - 1991
- [c2]Claude Marché:
On Ground AC-Completion. RTA 1991: 411-422 - 1990
- [c1]Jean-Pierre Jouannaud, Claude Marché:
Completion modulo Associativity, Commutativity and Identity (AC1). DISCO 1990: 111-120
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-05-08 21:47 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: