serlpsf-issues — Issues related to serl psf.

[serlpsf-issues] Help: How to use path information for custom analysis?

[Ashu P. <ash...@gm...>]

Hi,

    I am trying to implement a path sensitive null dereference
interprocedural analysis in Soot. As soot does not contain support for path
sensitive analysis, I am trying to use path information provided by your
PSF framework. However, I could not figure out how to use path sensitive
info provided by your framework directly, without having to parse the text
files generated by your plugin.
Maybe you could provide some written help manual, if you have one.

Please reply asap.


Regards,

Ashu Pachauri
M Tech (CSE)
Indian Institute of Technology, Kanpur

Re: [serlpsf-issues] Nested While loops

[Chandan R. <rup...@cl...>]

Hi Daqing,

The bug was on computation logic of the loop condition. The previous code
assumed that there could be only one loop exit but the code you sent me has
two loop exits for the inner loop and that is why it broke. Its been fixed.
Please download the new version from:

https://sourceforge.net/projects/serlpsf/files/SerlPSF.zip

Thanks,

Chandan


PS: For the folks subscribed to the mailing list, please download the new
version of the framework to work with sorting algorithm detection.


On Thu, Mar 24, 2011 at 4:52 PM, Daqing Hou <dh...@cl...> wrote:

>  public static void insertionSort1(){////(Right Code)just output the line
> number of outer "while" and "++i".
> int[] a={5,3,6,12,9,4};
> int i=0;
> while (i<a.length){
> int j=i-1;
> int tmp = a[i];
> while (j>=0)
> {
> if (a[j]>tmp)
> {
> a[j+1] = a[j];
> --j;
> }
> else break;
> }
> a[j+1]=tmp;
> ++i;
> }
> }
>



-- 
Chandan Raj Rupakheti
PhD Student
Department of Electrical and Computer Engineering
Clarkson University, Box 5722
Potsdam, NY 13699
Office: +1-315-268-3764 (CAMP - 115)
rup...@cl...
cha...@gm...
http://clarkson.edu/~rupakhcr