Xref: utzoo comp.lang.c:39173 comp.lang.pascal:6669 Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!dali.cs.montana.edu!uakari.primate.wisc.edu!sdd.hp.com!wuarchive!udel!rochester!pt.cs.cmu.edu!o.gp.cs.cmu.edu!fs7.ece.cmu.edu!rajen From: rajen@edsel.ece.cmu.edu (Ramchandani Rajen Sham) Newsgroups: comp.lang.c,comp.lang.c++.,comp.lang.pascal Subject: symbolic similation/abstract execution of procedural languages Keywords: symbolic, simulation, abstract, execution Message-ID: <1991May10.164523.22529@fs7.ece.cmu.edu> Date: 10 May 91 16:45:23 GMT Sender: news@fs7.ece.cmu.edu (USENET News System) Reply-To: rajen@edsel.ece.cmu.edu (Ramchandani Rajen Sham) Organization: Electrical and Computer Engineering, Carnegie Mellon Lines: 36 Originator: rajen@edsel.ece.cmu.edu I am looking for any code that will enable me to perform symbolic simulation/ abstract execution of any high level procedural language. It would be nice if it has the capability of resolving brach conditions whenever possible. Or on the other hand if you have some program that is capable of deciding if a statement is true or false depending on the conditions it has seen so far i would like to hear from you. what is mean is: given the following hypothetical code fragment sum = 0; loop read ( x, y); -(1) if x > 2 then sum = sum + x - 2 else sum = sum + x ; -(2) if y > x && y > 2 then sum = sum + y - 2 else sum = sum + y; -(3) end loop the executer would trace a path thus PC(1): input x1, y1; PC(2): ( x1 > 2 AND sum = x1 - 2 ) OR (x1 <= 2 AND sum = x1) PC(3): ( x1 > 2 AND sum = x1 - 2) AND (y1 > x1 && y1 > 2 AND sum = sum + y1 -2 ) pruned to ( x1 > 2 AND y1 > x1 AND sum = x1 + y1 -4) by the resolver [ i.e it was able to deduce that y1 >2 was redundant] OR ( ...............................) The last thing on this wish list of mine is if you have some program that generates input data values to satisfy a given set of conditions, will be equalities, inequalities and contain boolean operations. If you have any pointers to similar work being done elsewhere i could like to hear from you. Thanks a lot rajen@edsel.ece.cmu.edu