K. Apt (1999):
The Essence of Constraint Propagation.
Theoretical Computer Science 221(1-2),
pp. 179–210,
doi:10.1016/S0304-3975(99)00032-8.
Roberto Bagnara, Elisa Ricci, Enea Zaffanella & Patricia M. Hill (2002):
Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library.
In: Springer: SAS'02: In M. V. Hermenegildo and G. Puebla, editors, Proc. of the Static Analysis Symposium,
LNCS 2477,
pp. 213–229,
doi:10.1007/3-540-45789-5_17.
S. Bardin & P. Herrmann (2011):
OSMOSE: Automatic Structural Testing of Executables.
Software Testing, Verification and Reliability (STVR) 21(1),
pp. 29–54,
doi:10.1002/stvr.423.
Peter Boonstoppel, Cristian Cadar & Dawson Engler (2008):
RWset: Attacking path explosion in constraint-based test generation.
In: Int. Conference on Tools and Algorithms for the Constructions and Analysis of Systems (TACAS'08),
pp. 351–366,
doi:10.1007/978-3-540-78800-3_27.
B. Botella, A. Gotlieb & C. Michel (2006):
Symbolic execution of floating-point computations.
The Software Testing, Verification and Reliability journal 16(2),
pp. pp 97–121,
doi:10.1002/stvr.333.
Richard H. Carver (1996):
Testing abstract distributed programs and their implementations: A constraint-based approach.
Journal of Systems and Software 33(3),
pp. 223–237,
doi:10.1016/0164-1212(96)00024-6.
F. Charreteur, B. Botella & A. Gotlieb (2009):
Modelling dynamic memory management in Constraint-Based Testing.
The Journal of Systems and Software 82(11),
pp. 1755–1766.
Special Issue: TAIC-PART 2007 and MUTATION 2007,
doi:10.1016/j.jss.2009.06.029.
F. Charreteur & A. Gotlieb (2010):
Constraint-Based Test Input Generation for Java Bytecode.
In: Proc. of the 21st IEEE Int. Symp. on Softw. Reliability Engineering (ISSRE'10),
San Jose, CA, USA,
doi:10.1109/ISSRE.2010.26.
Chiu Wo Choi, Warwick Harvey, J. H. M. Lee & Peter J. Stuckey (2006):
Finite Domain Bounds Consistency Revisited.
In: Australian Conference on Artificial Intelligence,
pp. 49–58,
doi:10.1007/11941439_9.
P. Cousot & R. Cousot (1977):
Abstract Interpretation : A unified lattice model for static analysis of programs by construction or approximation of fixpoints.
In: Proceedings of Symp. on Principles of Programming Languages.
ACM,
pp. 238–252,
doi:10.1145/512950.512973.
P. Cousot & N. Halbwachs (1978):
Automatic Discovery of Linear Restraints Among Variables of a Program..
In: Proceedings of Symp. on Principles of Programming Languages.
ACM,
pp. 84–96,
doi:10.1145/512760.512770.
Patrick Cousot & Radhia Cousot (1976):
Static Determination of dynamic properties of programs.
In: Proc. of the 2nd International Symp. on Programming.
Dunod,
pp. 106–130.
Giorgio Delzanno & Andreas Podelski (2001):
Constraint-based deductive model checking.
International Journal on Software Tools for Technology Transfer (STTT) 3(3),
pp. 250–270,
doi:10.1007/s100090100049.
T. Denmat, A. Gotlieb & M. Ducasse (2007):
An Abstract Interpretation Based Combinator for Modeling While Loops in Constraint Programming.
In: Proceedings of Principles and Practices of Constraint Programming (CP'07),
Springer Verlag, LNCS 4741,
Providence, USA,
pp. 241–255,
doi:10.1007/978-3-540-74970-7_19.
T. Denmat, A. Gotlieb & M. Ducasse (2007):
Improving Constraint-Based Testing with Dynamic Linear Relaxations.
In: 18th IEEE International Symposium on Software Reliability Engineering (ISSRE' 2007),
Trollhättan, Sweden,
doi:10.1109/ISSRE.2007.12.
Cormac Flanagan (2004):
Automatic software model checking via constraint logic..
Sci. Comput. Program. 50(1-3),
pp. 253–270.
Available at http://dx.doi.org/10.1016/j.scico.2004.01.006.
Gordon Fraser & Franz Wotawa (2007):
Test-Case Generation and Coverage Analysis for Nondeterministic Systems Using Model-Checkers.
In: ICSEA,
pp. 45,
doi:10.1109/ICSEA.2007.71.
P. Godefroid, N. Klarlund & K. Sen (2005):
DART: directed automated random testing.
In: Proc. of PLDI'05,
pp. 213–223,
doi:10.1145/1064978.1065036.
A. Gotlieb (2009):
EUCLIDE: A Constraint-Based Testing platform for critical C programs.
In: 2th IEEE International Conference on Software Testing, Validation and Verification (ICST'09),
Denver, CO,
doi:10.1109/ICST.2009.10.
A. Gotlieb (2012):
TCAS software verification using Constraint Programming.
The Knowledge Engineering Review 27(3),
pp. 343–360,
doi:10.1017/S0269888912000252.
A. Gotlieb, B. Botella & M. Rueher (1998):
Automatic Test Data Generation Using Constraint Solving Techniques.
In: Proc. of Int. Symp. on Soft. Testing and Analysis (ISSTA'98),
pp. 53–62,
doi:10.1145/271771.271790.
A. Gotlieb, B. Botella & M. Rueher (2000):
A CLP Framework for Computing Structural Test Data.
In: Proceedings of Computational Logic (CL'2000),
LNAI 1891,
London, UK,
pp. 399–413,
doi:10.1007/3-540-44957-4_27.
A. Gotlieb, T. Denmat & B. Botella (2005):
Constraint-based test data generation in the presence of stack-directed pointers.
In: 20th IEEE/ACM International Conference on Automated Software Engineering (ASE'05),
Long Beach, CA, USA.
4 pages,
doi:10.1145/1101908.1101958.
A. Gotlieb, T. Denmat & B. Botella (2007):
Goal-oriented test data generation for pointer programs.
Information and Soft. Technol. 49(9-10),
pp. 1030–1044,
doi:10.1016/j.infsof.2006.10.016.
T. Henzinger, R. Jhala, R. Majumdar & G. Sutre (2003):
Software verification with Blast.
In: Proc. of 10th Workshop on Model Checking of Software (SPIN),
pp. 235–239,
doi:10.1007/3-540-44829-2_17.
K. Marriott & P.J. Stuckey (1998):
Programming with Constraints : An Introduction.
The MIT Press.
R.A. Moore (1966):
Interval Analysis.
Prentice Hall,
New Jersey.
M.N. Wegman & F.K. Zadeck (1991):
Constant Propagation with Conditional Branches.
ACM Transactions on Programming Language and Systems 13(2),
pp. 181–210,
doi:10.1145/103135.103136.
N. Williams, B. Marre, P. Mouy & M. Roger (2005):
PathCrawler: Automatic Generation of Path Tests by Combining Static and Dynamic Analysis.
In: Proc. Dependable Computing - EDCC'05,
doi:10.1007/11408901_21.
eptcs@eptcs.org