[PPL-devel] Parma Polyhedra Library

[varza victor]

Dear Roberto,

Thank you very much for answering me. It was my fault that I was
misunderstood. My question is about this paper "The Parma Polyhedra
Library: Toward a Complete Set of Numerical Abstractions for the Analysis
and Verification" (
http://bugseng.com/products/ppl/documentation/BagnaraHZ08SCP.pdf)whichdescribes
a method to find min and max for a linear programming problem.
The author used LP_Problem class which I haven't found in the source code
of the PPL. He also suggest (page 13) that the LP Solver is only in the CVS
repository.

Kind regards,
Victor


2013/3/28 Roberto Bagnara <bagnara at cs.unipr.it>

> On 03/27/13 18:39, varza victor wrote:
> > Hi,
> > My name is Victor Varza, I'm student at Politehnica University of
> > Bucharest and I working at a research about actual fuzzing testing
> > tools and methods.I want to use your library (PPL) to generate some
> > test case from a given constraint sistem. I have searched in your
> > papers to find how to do this but I haven't find something that
> > could help me. I'm working in C++ and I need some example to
> > generate data for a poliedrom. Could you please help me in this way?
> >
> > Best regards,
> > VIctor
>
> Dear Victor,
>
> I am not sure I understand.  The PPL Git repository (and any source
> distribution for that matter) is packed with tests and sample code.
> The manual contains lots of examples.  And you can download entire
> applications using the PPL following links from
>
>   http://bugseng.com/products/ppl/applications
>
> Kind regards,
>
>    Roberto
>
> --
>      Prof. Roberto Bagnara
>
> Applied Formal Methods Laboratory - University of Parma, Italy
> mailto:bagnara at cs.unipr.it
>                               BUGSENG srl - http://bugseng.com
>                               mailto:roberto.bagnara at bugseng.com
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.cs.unipr.it/pipermail/ppl-devel/attachments/20130328/816fa067/attachment.htm>