Specifying an invariant property (range of addresses) in the...

Data processing: software development – installation – and managem – Software program development tool – Translation of code

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C717S141000

Reexamination Certificate

active

07013460

ABSTRACT:
Method and apparatus for verifying at runtime an invariant property of a data structure. In various example embodiments, code that verifies whether a runtime value of the data structure is consistent with the invariant property is automatically generated in response to an annotation of the data structure in the source code. In executing the program, the runtime value of the data structure is compared to the invariant property in the automatically generated code. If the runtime property is inconsistent with the invariant property, the program branches to exception handler code.

REFERENCES:
patent: 4079453 (1978-03-01), Dahl
patent: 4584666 (1986-04-01), Zolnowsky et al.
patent: 4667290 (1987-05-01), Goss et al.
patent: 4782444 (1988-11-01), Munshi et al.
patent: 5226128 (1993-07-01), Rau et al.
patent: 5276819 (1994-01-01), Rau et al.
patent: 5361354 (1994-11-01), Greyzck
patent: 5644709 (1997-07-01), Austin
patent: 5832205 (1998-11-01), Kelly et al.
patent: 5842022 (1998-11-01), Nakahira et al.
patent: 5953530 (1999-09-01), Rishi et al.
patent: 6078745 (2000-06-01), De Greef et al.
patent: 6128639 (2000-10-01), Pase
patent: 6129515 (2000-10-01), Soechting et al.
patent: 6151706 (2000-11-01), Lo et al.
patent: 6199152 (2001-03-01), Kelly et al.
patent: 6539541 (2003-03-01), Geva
patent: 6543012 (2003-04-01), Viswanathan et al.
patent: 6591413 (2003-07-01), Humphrey et al.
Automatic Selection of High-Order Transformations in the IBM XL FORTRAN Compilers, V. Sarkar, IBM Research, 1997, pp. 1-40.
“Optimizing of Array Subscript Checks”, J.M. Asuru, ACM Letters on Programming Languages and Systems, Jun. 1992, pp. 109-118.
“A Reexamination of Optimization of Array Subscript Range Checks”, Wei-Ngan Chin et al, ACM, vol. 17, No. 2, Mar. 1995, pp. 217-227.
“Elimination of Redundant Array Subscript Range Checks”, Priydarshan Kolte et al, ACM, 1995, pp. 270-278.
“The Range Test: A Dependence Test for Symbolic, Non-linear Expressions”, William Blume et al, IEEE, 1994, pp. 528-537.
“Application of the Goal Invariant to Structuring of Programs”, J.W. Laski, Jan. 1982, ACM, pp. 27-36.
“Writing an Operating System with Modula-3”, Emin Sirer et al, pp. 1-7, Nov. 3, 1995.
“Compilers Principles, Techniques and Tools”, Alfred Aho et al, Sep. 12, 1985, pp. 1-796.
“Advanced Compiler Design & Implementation”, Steven S. Muchnick, Aug. 19, 1997, pp. xxii-xxvi, 43-65, 454-459.
“Building an Optimizing Compiler”, Robert Morgan, Dec. 26, 1997, pp. 204-219.
“Design of Multi-Invariant Data Strucutres for Robust Shared Accesses in Multiprocessor Systems”, I-Ling Yen et al, IEEE, Mar. 2001, pp. 193-207.
Optimization of Array subscript Range Checks, Jonathan M. Asura, ACM, 1992, pp. 109-118.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Specifying an invariant property (range of addresses) in the... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Specifying an invariant property (range of addresses) in the..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Specifying an invariant property (range of addresses) in the... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3543296

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.