default search action
Evelyne Contejean
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j6]Véronique Benzaken
, Evelyne Contejean
Translating canonical SQL to imperative code in Coq. Proc. ACM Program. Lang. 6(OOPSLA1): 1-27 (2022) - [i1]Véronique Benzaken, Evelyne Contejean, Mohammed Houssem Hachmaoui
Translating Canonical SQL to Imperative Code in Coq. CoRR abs/2203.08941 (2022) - 2021
- [c29]Véronique Benzaken
A Coq formalization of data provenance. CPP 2021: 152-162
2010 – 2019
- 2019
- [c28]Véronique Benzaken
A Coq mechanised formal semantics for realistic SQL queries: formally reconciling SQL and bag relational algebra. CPP 2019: 249-261 - 2018
- [c27]Véronique Benzaken
A Coq Formalisation of SQL's Execution Engines. ITP 2018: 88-107 - 2017
- [c26]Véronique Benzaken, Evelyne Contejean, Stefania Dumbrava
Certifying Standard and Stratified Datalog Inference Engines in SSReflect. ITP 2017: 171-188 - 2014
- [b1]Evelyne Contejean:
Facettes de la preuve : Jeux de reflets entre démonstration automatique et preuve assistée. University of Paris-Sud, Orsay, France, 2014 - [c25]Véronique Benzaken, Evelyne Contejean, Stefania Dumbrava
A Coq Formalization of the Relational Data Model. ESOP 2014: 189-208 - 2012
- [j5]Sylvain Conchon, Evelyne Contejean, Mohamed Iguernelala:
Canonized Rewriting and Ground AC Completion Modulo Shostak Theories : Design and Implementation. Log. Methods Comput. Sci. 8(3) (2012) - [c24]François Bobot
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic. IJCAR 2012: 67-81 - 2011
- [c23]Evelyne Contejean, Pierre Courtieu, Julien Forest, Olivier Pons, Xavier Urbain:
Automated Certified Proofs with CiME3. RTA 2011: 21-30 - [c22]Sylvain Conchon, Evelyne Contejean, Mohamed Iguernelala:
Canonized Rewriting and Ground AC Completion Modulo Shostak Theories. TACAS 2011: 45-59 - 2010
- [c21]Sylvain Conchon, Evelyne Contejean, Mohamed Iguernelala:
Ground Associative and Commutative Completion Modulo Shostak Theories. LPAR short papers(Yogyakarta) 2010: 35-40 - [c20]Evelyne Contejean, Andrey Paskevich, Xavier Urbain, Pierre Courtieu, Olivier Pons, Julien Forest:
A3PAT, an approach for certified automated termination proofs. PEPM 2010: 63-72
2000 – 2009
- 2007
- [c19]Evelyne Contejean:
Modeling Permutations in Coqfor Coccinelle. Rewriting, Computation and Proof 2007: 259-269 - [c18]Evelyne Contejean, Pierre Courtieu, Julien Forest, Olivier Pons, Xavier Urbain:
Certification of Automated Termination Proofs. FroCoS 2007: 148-162 - [c17]Sylvain Conchon, Evelyne Contejean, Johannes Kanig, Stéphane Lescuyer:
CC(X): Semantic Combination of Congruence Closure with Solvable Theories. SMT@CAV 2007: 51-69 - 2005
- [j4]Evelyne Contejean, Claude Marché
Mechanically Proving Termination Using Polynomial Interpretations. J. Autom. Reason. 34(4): 325-363 (2005) - [c16]Evelyne Contejean, Pierre Corbineau:
Reflecting Proofs in First-Order Logic with Equality. CADE 2005: 7-22 - 2004
- [c15]Evelyne Contejean:
A Certified AC Matching Algorithm. RTA 2004: 70-84 - 2001
- [c14]Alexandre Boudet, Evelyne Contejean:
Combining Pattern E-Unification Algorithms. RTA 2001: 63-76 - 2000
- [c13]Evelyne Contejean, Antoine Coste, Benjamin Monate:
Rewriting Techniques in Theoretical Physics. RTA 2000: 80-94
1990 – 1999
- 1998
- [c12]Alexandre Boudet, Evelyne Contejean:
About the Confluence of Equational Pattern Rewrite Systems. CADE 1998: 88-102 - 1997
- [j3]Farid Ajili, Evelyne Contejean:
Avoiding Slack Variables in the Solving of Linear Diophantine Equations and Inequations. Theor. Comput. Sci. 173(1): 183-208 (1997) - [c11]Alexandre Boudet, Evelyne Contejean:
AC-Unification of Higher-Order Patterns. CP 1997: 267-281 - [c10]Evelyne Contejean, Claude Marché, Landy Rabehasaina:
Rewrite Systems for Natural, Integral, and Rational Arithmetic. RTA 1997: 98-112 - 1996
- [c9]Alexandre Boudet, Evelyne Contejean, Claude Marché:
AC-Complete Unification and its Application to Theorem Proving. RTA 1996: 18-32 - [c8]Evelyne Contejean, Claude Marché:
CiME: Completion Modulo E. RTA 1996: 416-419 - 1995
- [c7]Farid Ajili, Evelyne Contejean:
Complete Solving of Linear Diophantine Equations and Inequations without Adding Variables. CP 1995: 1-17 - [c6]Farid Ajili, Evelyne Contejean:
Complete Solving of Linear Diophantine Equations and Inequations without Adding Slack Variables. UNIF 1995: 1 - 1994
- [j2]Evelyne Contejean, Hervé Devie:
An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine Equations. Inf. Comput. 113(1): 143-172 (1994) - [c5]Alexandre Boudet, Evelyne Contejean:
"Syntactic" AC-Unification. CCL 1994: 136-151 - 1993
- [j1]Evelyne Contejean:
Solving *-Problems Modulo Distributivity by a Reduction to AC1-Unification. J. Symb. Comput. 16(5): 493-521 (1993) - [c4]Evelyne Contejean:
A Partial Solution for D-Unification Based on a Reduction to AC1-Unification. ICALP 1993: 621-632 - [c3]Evelyne Contejean:
Solving Linear Diophantine Constraints Incrementally. ICLP 1993: 532-549 - 1992
- [c2]Alexandre Boudet, Evelyne Contejean:
On n-Syntactic Equational Theories. ALP 1992: 446-457 - 1990
- [c1]Alexandre Boudet, Evelyne Contejean, Hervé Devie:
A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations. LICS 1990: 289-299
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-04-25 05:59 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: