|
|
|
|
|
Programme
|
|
A. King :
"Discovering Congruence Constraints with SAT"
|
|
A. Gotlieb : "EUCLIDE : demo and
Dynamic Linear Relaxations"
|
|
M. Rueher : “CPBPV Constraints for bounded
program verification”
|
|
N. Williams : “Cheminement de PathCrawler”
|
|
B. Marre : “Domaine de contraintes
numériques dans Gatel (Colibri)”
|
|
|
|
Programme
|
|
N. Kosmatov "All-Paths Test
Generation for Programs with Internal Aliases"
|
|
A. Gotlieb "Towards optimal interval
arithmetic for wrap-around integer computations"
|
|
M. Leconte
" "Which semantic for buisness
rules analysis ?"
|
|
C.
Michel "Floating-point simplex"
|
|
|
|
|
- Meeting (26 Nov. 2009 in
INRIA Paris) - Floating-Points computations
- Meeting (30/31 Mars 2010 in
Nice)
Nadlib Lazaar: On
testing constraint programs
.
Said Belaid: Approximation sur
les réels de contraintes sur les flottants.
Mickael Delahaye : Explanation-based generalization of
infeasible path.
Olivier Ponsini:
Vérification d'invariants
de boucle inductifs
Bruno Berstel: Using Constraints to Verify Properties of Rule
A. Gotlieb – CAVERN Administratif
N. Wiliams, B. Botella,
A. Gotlieb – “Memory models in software
verification tools”
B. Marre, C. Michel -- “Real and linear
relaxations of floating-point constraints”
A. Gotlieb, M. Leconte,
B. Marre -- Constraint solving on modular
arithmetic
|
