* Symbolic Execution, Paths Conditions and Constraints
@ 1996-09-09 0:00 christophe meudec
0 siblings, 0 replies; only message in thread
From: christophe meudec @ 1996-09-09 0:00 UTC (permalink / raw)
Dear all,
I am looking for references on CLP (Constraint Logic Programming) and
its relevance to symbolic execution of program code (in C or ADA etc).
In particular on how to use CLP languages to help with determining the
consistency of path conditions (i.e. from symbolic execution you obtain
a path condition over integers, reals, booleans...is this path
feasible?).
For interest, I am using Eclipse to try to built such a solver for ADA
path conditions.
Is anybody trying (or has tried) to do something similar?
Regards,
--------------------
Christophe Meudec
University of York, UK
Department of Computer Science
chris@minster.york.ac.uk
Tel: 01904 434732
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~1996-09-09 0:00 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
1996-09-09 0:00 Symbolic Execution, Paths Conditions and Constraints christophe meudec
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox