Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichel Rueher
- > Home > Persons > Michel Rueher
Publications
- 2020
[c56]Rémy Garcia, Claude Michel, Michel Rueher:
A Branch-and-bound Algorithm to Rigorously Enclose the Round-Off Errors. CP 2020: 637-653- [c55]Rémy Garcia, Claude Michel, Michel Rueher:
Rigorous Enclosure of Round-Off Errors in Floating-Point Computations. VSTTE 2020: 196-212 - [i9]Heytem Zitoun, Claude Michel, Laurent Michel, Michel Rueher:
An efficient constraint based framework forhandling floating point SMT problems. CoRR abs/2002.12441 (2020) - [i8]Heytem Zitoun, Claude Michel, Laurent Michel, Michel Rueher:
Bringing freedom in variable choice when searching counter-examples in floating point programs. CoRR abs/2002.12447 (2020) - 2019
- [c54]Claude Michel, Michel Rueher:
Dedicated Search Strategies For Finding Critical Counterexamples In Programs With Floating Point Computations. AITest 2019: 138-139 - 2017
- [c52]Heytem Zitoun, Claude Michel, Michel Rueher, Laurent Michel
:
Search Strategies for Floating Point Constraint Systems. CP 2017: 707-722 - 2016
- [j17]Olivier Ponsini, Claude Michel, Michel Rueher:
Verifying floating-point programs with constraint programming and abstract interpretation techniques. Autom. Softw. Eng. 23(2): 191-217 (2016) - [c51]Hélène Collavizza, Claude Michel, Michel Rueher:
Searching Critical Values for Floating-Point Programs. ICTSS 2016: 209-217 - 2015
- [i6]Hélène Collavizza, Claude Michel, Michel Rueher:
Searching input values hitting suspicious Intervals in programs with floating-point operations. CoRR abs/1511.01080 (2015) - 2014
- [c49]Hélène Collavizza, Claude Michel, Olivier Ponsini, Michel Rueher:
Generating test cases inside suspicious intervals for floating-point number programs. CSTVA 2014: 7-11 - 2012
- [c48]Mohammed Saïd Belaid, Claude Michel, Michel Rueher:
Boosting Local Consistency Algorithms over Floating-Point Numbers. CP 2012: 127-140 - [c47]Olivier Ponsini, Claude Michel, Michel Rueher:
Refining Abstract Interpretation Based Value Analysis with Constraint Programming Techniques. CP 2012: 593-607 - [c46]Olivier Ponsini, Claude Michel, Michel Rueher:
Combining Constraint Programming and Abstract Interpretation for Value Analysis of Floating-point Programs. ICST 2012: 775-776 - 2011
- [j14]Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher:
Capabilities of Constraint Programming in Safe Global Optimization. Reliab. Comput. 15(1): 47-59 (2011) - 2010
- [c41]Olivier Ponsini, Hélène Collavizza, Carine Fédèle, Claude Michel, Michel Rueher:
Automatic verification of loop invariants. ICSM 2010: 1-5 - [c40]Claude Michel, Michel Rueher:
Handling software upgradeability problems with MILP solvers. LoCoCo 2010: 1-10 - 2009
- [j12]Alexandre Goldsztejn, Claude Michel, Michel Rueher:
Efficient handling of universally quantified inequalities. Constraints An Int. J. 14(1): 117-135 (2009) - 2008
- [c37]Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher:
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm. CP 2008: 598-602 - [c35]Alexandre Goldsztejn, Claude Michel, Michel Rueher:
An efficient algorithm for a sharp approximation of universally quantified inequalities. SAC 2008: 134-139 - [i4]Alexandre Goldsztejn, Claude Michel, Michel Rueher:
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities. CoRR abs/0807.2269 (2008) - [i3]Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher:
Revisiting the upper bounding process in a safe Branch and Bound algorithm. CoRR abs/0807.2382 (2008) - 2007
- [c33]Yahia Lebbah, Claude Michel, Michel Rueher:
Using constraint techniques for a safe and fast implementation of optimality-based reduction. SAC 2007: 326-331 - 2005
- [j11]Yahia Lebbah, Claude Michel, Michel Rueher:
A Rigorous Global Filtering Algorithm for Quadratic Constraints*. Constraints An Int. J. 10(1): 47-65 (2005) - [j8]Yahia Lebbah, Claude Michel, Michel Rueher, David Daney, Jean-Pierre Merlet:
Efficient and Safe Global Constraints for Handling Numerical Constraint Systems. SIAM J. Numer. Anal. 42(5): 2076-2097 (2005) - [c30]Heikel Batnini, Claude Michel, Michel Rueher:
Mind the Gaps: A New Splitting Strategy for Consistency Techniques. CP 2005: 77-91 - 2003
- [c28]Yahia Lebbah, Claude Michel, Michel Rueher:
Efficient Pruning Technique Based on Linear Relaxations. COCOS 2003: 1-14 - 2002
- [j7]Bernard Botella, Arnaud Gotlieb, Claude Michel, Michel Rueher, Patrick Taillibert:
Utilisation des contraintes pour la génération automatique de cas de test structurels. Tech. Sci. Informatiques 21(9): 1163-1187 (2002) - [c26]Yahia Lebbah, Michel Rueher, Claude Michel:
A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations. CP 2002: 109-123 - 2001
- [c25]Claude Michel, Michel Rueher, Yahia Lebbah:
Solving Constraints over Floating-Point Numbers. CP 2001: 524-538
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-21 18:05 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:
