Model checking of non-terminating software programs

Details Model checking of non-terminating software programs Model checking of non-terminating software programs

2011-04-05

2011-04-05

Dam, Tuan Q (Department: 2192)

Data processing: software development, installation, and managem

Software program development tool

Testing or debugging

C717S104000, C717S105000, C717S127000

Reexamination Certificate

active

07921411

ABSTRACT:
A method for verifying software program code includes specifying a property that the software program code is expected to satisfy. The software program code and the property are transformed into an initial logical formula in a static single assignment (SSA) form, the formula including variables. A loop in the software program code is identified. Successive over-approximations are applied to a portion of the initial logical formula corresponding to the loop in order to produce a modified logical formula in the SSA form that represents a finite over-approximation of a set of states that are reachable by the loop. It is verified that the software program code satisfies the specified property by determining whether there is an assignment of the variables that satisfies the modified logical formula.

REFERENCES:
patent: 6944838 (2005-09-01), McMillan
patent: 7058925 (2006-06-01), Ball et al.
patent: 7584455 (2009-09-01), Ball
patent: 7653520 (2010-01-01), De Moura et al.
patent: 2004/0019468 (2004-01-01), De Moura et al.
patent: 2005/0071147 (2005-03-01), Clarke et al.
patent: 2005/0166167 (2005-07-01), Ivancic et al.
patent: 2005/0229044 (2005-10-01), Ball
patent: 2005/0262456 (2005-11-01), Prasad
patent: 2005/0283743 (2005-12-01), Mulholland et al.
patent: 2006/0031730 (2006-02-01), Hsiao et al.
patent: 2006/0282807 (2006-12-01), Ivancic et al.
patent: 2007/0011629 (2007-01-01), Shacham et al.
patent: 2007/0157180 (2007-07-01), Tillmann et al.
patent: 2007/0168988 (2007-07-01), Eisner et al.
patent: 2007/0226665 (2007-09-01), Ganai et al.
K.L. Interpolation and SAT-Based Model Checking, 2003, pp. 1-13.
Applications of Craig Interpolants in Model Checking http://www.cadence.com/company/cadence—labs/mcmillan—TACAS—2005—Applications.pdf.
Bounded model checking of infinite state systems (Source: http://rsg.informatik.uni-kl.de/publications/data/ScSc06.pdf).
Bounded model checking of concurrent programs (Source: http://www.inf.ethz.ch/personal/daniekro/classes/se-sem/ss2005/papers/192.pdf).
Bounded model checking of infinite state systems: exploiting the automata hierarchy http://rsg.informatik.uni-kl.de/publications/data/ScSc04b.pdf#search=%22%22Bounded%20model%20checking%20of%20infinite%20state%20systems%3A%20exploiting%20the%20automata%20hierarchy%22%22).
Interpolant-based Transition Relation Approximation http://www.cse.ucsd.edu/˜rjhala/papers/interpolant—based—transition—relation—approximation.pdf#search=%22%22Blast%20software%20model%20checker%22%22.
R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, F. K. Zadeck: An Efficient Method of Computing Static Single Assignment Form.POPL 1989: 25-35.
W. Craig: Linear Reasoning. A New Form o fthe Herbrand-Gentzen Theorem.The Journal of Symbolic Logic, 1957: 250-268.

Affiliated with

Also associated with

Rating

Model checking of non-terminating software programs does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Model checking of non-terminating software programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Model checking of non-terminating software programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2721149