From: Willem V. <wv...@em...> - 2006-04-12 19:13:24
|
We are just finishing up a new version of JPF (should be done very soon) at which point I'll add the specific kind of abstract state matching described in that paper as well as a much more elaborate scheme as discussed in an upcoming ISSTA paper. ETA is probably sometime next month. In the longer term we'll make it possible to customize state matching through the main system - note that the one used in the mentioned papers are essentially put on top of JPF rather than inside. ETA for this more elaborate scheme is end of summer. -- Willem C. Visser Automated Software Engineering Group RIACS/NASA Ames Research Center wv...@em... M/S 269-2 http://ase.arc.nasa.gov Moffett Field, CA 94035 (650)604-3515 fax 4036 rm 235 > -----Original Message----- > From: jav...@li... > [mailto:jav...@li...] On Behalf Of Adam > Kiezun > Sent: Wednesday, April 12, 2006 12:07 PM > To: jav...@li... > Subject: [Javapathfinder-user] Abstract state matching > > hi, > (I asked this question on the sourceforge forum before but maybe I'll be > more > lucky here) > > Is abstraction-based state matching available in JPF now? > > I mean something a'la "Test Input Generation for Red Black Trees using > Abstraction" Visser et al (ASE'05) > > If yes, how can I use it? If not, do you have estimated timelime for this > feature? > > Thanks > /adam > > > ------------------------------------------------------- > This SF.Net email is sponsored by xPML, a groundbreaking scripting > language > that extends applications into web and mobile media. Attend the live > webcast > and join the prime developer group breaking into this new coding > territory! > http://sel.as-us.falkag.net/sel?cmd=lnk&kid=110944&bid=241720&dat=121642 > _______________________________________________ > Javapathfinder-user mailing list > Jav...@li... > https://lists.sourceforge.net/lists/listinfo/javapathfinder-user |