Performing checks on the resource usage of computer programs

Details Performing checks on the resource usage of computer programs Performing checks on the resource usage of computer programs

2004-12-21

2009-08-11

Zhen, Wei Y (Department: 2191)

Data processing: software development, installation, and managem

Software program development tool

Testing or debugging

C717S131000

Reexamination Certificate

active

07574695

ABSTRACT:
A method and apparatus for performing checks on program code. In one embodiment, the method comprises receiving program code and statically verifying information about one or more dynamic checks in the program code, where each of the one or more dynamic checks in the program code checks an operation in the program code.

REFERENCES:
patent: 6546546 (2003-04-01), Van Doorn
patent: 6553362 (2003-04-01), Saxe et al.
patent: 6817014 (2004-11-01), Hundt et al.
patent: 6886094 (2005-04-01), Blandy
patent: 7207045 (2007-04-01), Goiffon
patent: 7260746 (2007-08-01), Demsky et al.
patent: 2002/0083418 (2002-06-01), Saxe et al.
patent: 2002/0133806 (2002-09-01), Flanagan et al.
patent: 2003/0126590 (2003-07-01), Burrows et al.
patent: 1217520 (2002-06-01), None
Nimmer, Jeremy and Michael Ernst; Static verification of dynamically detected program invariants: Integrating Daikon and ESC/Java; Jul. 23, 2001; In proceedings of RV'01, First Work-shop on Run-time Verification, Paris, France.
Saidi, Hassen et al.; Self-Regenerative Software Components; Oct. 31, 2003; ACM New York, NY; p. 115-120.
Kumar, Scott K. et al.; Retargetable and reconfigurable software dynamic translation; Mar. 23-26, 2003; Code Generation and Optimization, 2003. CGO 2003. International. p. 36-47.
Hawblitzel, Chris et al.; A Case for Language-Based Protection; Mar. 1998; Dept. of Comp. Sci., Cornell Univ., Tech. Reports TR98-1670.
Evans, David; Static Detection of Dynamic Memory errors; ACM; 1996.
Crary, Karl; Resource Bound Certification; Annual Symposium on Principles of Programming Language; Proceedings of the 27th ACM SIGPLAN-SIGACT symposium of Principles of programming languages: ACM 2000.
Saidi, hassen et al; Self-Regenerative Software Components; Oct. 2003; ACM NY, NY, p. 115-120.
Kumar, Scott Retargetable and reconfigurable software dynamic translation; Mar. 2003; Code Generation and Optimization, 2003.
Hawblitzel, Chris; A Case for Language-Based Protection; Mar. 1998; Cornell Univ. Tech Reports TR98-1670.
Flanagan, Cormac et al., “Extended Static Checking for JAVA”, Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation table of contents, Berlin, Germany, pp. 234-245.
International Search Report mailed Mar. 27, 2006. PCT/US2004/043654. 6 pages.
Written Opinion of the International Searching Authority. PCT/US2004/043654. 7 pages.
Crary K; Weirich S, “Resouce Bounds Certification”. Proceeding of POPL '00: Symposium on Principles of Programming Languages, 200. XP002371010. Boston, MA, USA.
Wallach D E, et al, “SAFKASI: A Security Mechanism for Language-Based Systems” ACM Transactions of Software Engineering and Methodology, Association for Computing Machinery, New York, US. vol. 9, No. 4, Oct. 2000. pp. 341-378. XP008058988.
Appel A W, et al, “A Trustworthy Proof Checker”, Journal of Automated Reasoning, vol. 31, No. 3-4. Sep. 2003. XP002371012.
PCT Written Opinion for PCT Appln No. US2004/043654, mailed Jun. 26, 2006 (7 pages).
Crary, K; Weirch, S: “Resource bound certification” Proceedings of POPL '00: Symposium on Principles of Programming Languages, 2000, XP002371010 Boston, MA, USA.
Bledsoe, W.W., “The Sup-Inf method in Presurger arithmetic,” Technical Report, University of Texas Math Department, Dec. 1974.
Detlefs, David, “An overview of the Extended Static Checking System,”Proceedings of the First Formal Methods in Software Practice Workshop, 1996.
Detlefs, David L. et al., “Extended static checking,”SRC Research Report 159, Compaq Systems Research Center, 130 Lytton Avenue, Palo Alto, Dec. 1998.
Dijkstra, Edsger,A Discipline of Programming. Prentice-Hall, 1976. pp. 37-40.
Erlingsson, Ulfar, et al., “SASI enforcement of security policies: a retrospective,”New Security Paragdigms Workshop, Caledon, Canada, Sep. 1999.
Luckham et al., “Stanford Pascal verifier user manual,” Technical Report STAN-CS-79-731, Department of Computer Science, Stanford University, Mar. 1979.
Fitzgerald, Robert et al., “Marmot: an optimizing complier for Java,”Software Practice and Experience, 30(3): 199-232, Mar. 2000.
Gong Li,Inside Java 2 Platform Security. Addison-Wesley, 1999. pp. 43-106.
Hopcroft, J. E., et al.,Introduction to Automata Theory, Languages, and Computation, Addison Wesley Publishing Company, Massachusetts, 1979. pp. 77-92.
Kim, Moonjoo, et al., “JavaMaC: a run-time assurance tool for Java programs,”Electronic Notes in Theoretical Computer Science, 55(2), 2001.
Mitchell, J. C.,Foundations for Programming Languages. MIT Press, 1996. pp. 75-76.
Morrisett, Greg, et al., “From system F to typed assembly language,”Principles of Programming Languages, San Diego, California, Jan. 1998.
Necula, George,Computing with proofs, PhD thesis, Carnegie Mellon, 1998.
Nelson, Greg et al., Simplification by cooperating decision procedures,ACM Transactions on Programming Languages and Systems, 1(2)245-257, Oct. 1979
Owre, S. et al., “PVS: A prototype verification system,” In Deepka Kapur, editor,11thInternational Conference on Automated Deduction(CADE), vol. 607 ofLecture Notes in Artificial Intelligence, pp. 748-752, Saratoga, NY, Jun. 1992. Springer-Verlag.
Pandey, Raju et al., “Providing fine-grained access control for Java programs via binary editing,”Concurrency: Practice and Experience: 12:1405-1430, 2000.
Shostak, Robert, “Deciding linear inequalities by computing loop residues,”Journal of the ACM, 28(4) 769-779, Oct. 1981.
Shostak, Robert E., “Deciding combinations of theories,”Journal of the ACM, 31(1):1-12, Jan. 1984.
Wallach, Dan et al., “Extensible security architectures for Java,”16thSymposium on Operating Systemse Principles, Saint-Malo, France, Oct. 1997.
Xi, Hongwei et al., “Eliminating array bound checking through dependent types,”Programming Language Design and Implementation, Montreal, Canada, Jun. 1998.

Affiliated with

Also associated with

Rating

Performing checks on the resource usage of computer 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 Performing checks on the resource usage of computer programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performing checks on the resource usage of computer programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4061978