Data processing: software development – installation – and managem – Software program development tool – Translation of code
Reexamination Certificate
2006-08-01
2006-08-01
Chavis, John (Department: 2193)
Data processing: software development, installation, and managem
Software program development tool
Translation of code
Reexamination Certificate
active
07086041
ABSTRACT:
A representation of types, type-checker, and compiler are provided for checking consistency in various forms of an intermediate language. Type-checking a programming language in a compiler is accomplished by taking one or more rule sets as input to a type-checker, which selects one or more of the rule sets based upon any one, or combination of two or more, of numerous criteria. Among them are stage of compilation, source language, architecture, and level of typing present in the language being type-checked. The language is then type-checked using the selected one or more rule sets. The rule sets can include one rule set corresponding to strong type-checking, one rule set corresponding to weak type-checking, and one rule set corresponding to representation type-checking. In the alternative, a compiler can be provided with a type-checker that constructs the one or more sets of rules at runtime from a larger set of rules based on any one, or combination of two or more, of the previously mentioned criteria.
REFERENCES:
patent: 5488727 (1996-01-01), Agrawal et al.
patent: 5598560 (1997-01-01), Benson
patent: 5628016 (1997-05-01), Kukol
patent: 5696974 (1997-12-01), Agrawal et al.
patent: 5742828 (1998-04-01), Canady et al.
patent: 5768595 (1998-06-01), Gillies
patent: 5857105 (1999-01-01), Ayers et al.
patent: 5918235 (1999-06-01), Kirshenbaum et al.
patent: 5937195 (1999-08-01), Ju et al.
patent: 5943499 (1999-08-01), Gillies et al.
patent: 5966702 (1999-10-01), Fresko et al.
patent: 5999739 (1999-12-01), Soni et al.
patent: 6009273 (1999-12-01), Ayers et al.
patent: 6070011 (2000-05-01), Liu et al.
patent: 6148302 (2000-11-01), Beylin et al.
patent: 6149318 (2000-11-01), Chase et al.
patent: 6182284 (2001-01-01), Sreedhar et al.
patent: 6247169 (2001-06-01), DeLong
patent: 6249910 (2001-06-01), Ju et al.
patent: 6289446 (2001-09-01), Nilsson
patent: 6353924 (2002-03-01), Ayers et al.
patent: 6374368 (2002-04-01), Mitchell et al.
patent: 6412109 (2002-06-01), Ghosh
patent: 6421667 (2002-07-01), Codd et al.
patent: 6460178 (2002-10-01), Chan et al.
patent: 6481008 (2002-11-01), Chaiken et al.
patent: 6625804 (2003-09-01), Ringseth et al.
patent: 6625808 (2003-09-01), Tarditi
patent: 6662356 (2003-12-01), Edwards et al.
patent: 6678805 (2004-01-01), Corduneanu et al.
patent: 6745383 (2004-06-01), Agarwal et al.
patent: 6748584 (2004-06-01), Witchel et al.
patent: 2002/0083425 (2002-06-01), Gillies et al.
patent: 2002/0095667 (2002-07-01), Archambault
patent: 2002/0166115 (2002-11-01), Sastry
patent: 2002/0170044 (2002-11-01), Tarditi
patent: 2003/0101335 (2003-05-01), Gillies et al.
patent: 2003/0101380 (2003-05-01), Chaiken et al.
patent: 2003/0217196 (2003-11-01), Chan et al.
patent: 2003/0217197 (2003-11-01), Chan et al.
patent: 2003/0226133 (2003-12-01), Grover
patent: 2004/0049769 (2004-03-01), Lueh et al.
patent: 2004/0098710 (2004-05-01), Radigan
patent: WO 01/48607 (2001-07-01), None
“Common Language Infrastructure (CLI), Partition 1: Concepts and Architecture,” ECMA TC39/TG3, Section 11.6, pp. 1-103, Oct. 2002.
“The LEX & YACC Page,” http://dinosaur.compilertools.net/, 4 pages, website visited on Jun. 16, 2003.
“SMGN Reference Manual,” http://suif.stanford.edu/suif/suif2/doc-2.20-4/, pp. 1-3, May 2003.
“Zephyr Abstract Syntax Description Language (ASDL): Zephyr ASDL,” http://web.archive.org/web/19991103153820/http://www.cs.virginia.edu/zephyr/asdl.html, 1 page, Nov. 3, 1999.
“Zephyr Compiler Infrastructure: Zephyr: Tools for a National Compiler Infrastructure,” http://web.archive.org/web/20000817014546/http://www.cs.virginia.edu/zephyr/, 1 page, Aug. 17, 2000.
“Zephyr Computer Systems Description Languages (CSDL): Generating Machine-Dependent Compiler Parts Using CSDL,” http://web.archive.org/web/20000829045324/www.cs.virginia.edu/zephyr/csdl/, 1 page, Aug. 29, 2000.
“Zephyr Register Transfer Lists (RTLs): Compiling with Register Transfer Lists (RTLs),” http://web.archive.org/web/20000829045407/http://www.cs.virginia.edu/zephyr/rtl.html, 2 pages, Aug. 29, 2000.
“Zephyr Very Portable Optimizer (vpo): Machine-Independent Optimization,” http://web.archive.org/web/20010424131242/http://www.cs.virginia.edu/zephyr/vpo/, 1 page, Apr. 24, 2001.
ADL-Tabatabai et al., “Code Reuse in an Optimizing Compiler,” ACM SIGPLAN Notices, Proceedings of the Eleventh Annual Conference on Object-Oriented Programming Systems, Languages, and Applications, vol. 31, Issue 10, pp. 51-68, Oct. 1996.
Aigner et al., “An Overview of the SUIF2 Compiler Infrastructure,” Technical Report, Computer Systems Laboratory, Stanford University and Portland Group, Inc., pp. 1-14, 2000.
Aigner et al., “SUIF Compiler System: The SUIF Program Representation,” Computer Systems Laboratory, Stanford University and The Portland Group, Inc., http://suif.stanford.edu/suif/suif2/doc-2.2.0-4/suifguide/, pp. 1-30, Aug. 14, 2000.
Appel et al., “The Zephyr Compiler Infrastructure,” Internal Report, http://www.cs.virginia.edu/zephyr, Princeton University and University of Virginia, pp. 1-10, Nov. 6, 1998.
Ayers et al., “Scabable Cross-Module Optimization,” ACM SIGPLAN Notices, Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation, vol. 33, Issue 5, pp. 301-312, May 1998.
Benitez et al., “Target-Specific Global Code Improvement: Principles and Applications,” Technical Report CS-94-92, Department of Computer Science, University of Virginia, pp. 1-14, 1994.
Blickstein et al., “The GEM Optimizing Compiler System,” Digital Technical Journal, vol. 4, No. 4, Special Issue, pp. 1-17, 1992.
Brooks et al., “Design of An Optimizing, Dynamically Retargetable Compiler for Common Lisp,” Proceedings of the 1986 ACM Conference on LISP and functional programming, pp. 67-85, Aug. 1986.
Devanbu, “Re-targetability in Software Tools,” ACM SIGAPP Applied Computing Review, vol. 7, Issue 3, pp. 19-26, Sep. 1999.
Engler, “VCODE: A Retargetable, Extensible, Very Fast Dynamic Code Generation System,” ACM SIGPLAN Notices, Proceedings of the ACM SIGPLAN 1996 Conference on Programming Language Design and Implementation, vol. 31, Issue 5, pp. 160-170, May 1996.
Ganapathi et al., “Retargetable Compiler Code Generation,” ACM Computing Surveys (CSUR), vol. 14, Issue 4, pp. 573-592, Dec. 1982.
Goodenough, “Exception Handling: Issues and a Proposed Notation,” Communications of the ACM, vol. 18, No. 12, pp. 683-696, Dec. 1975.
Guilan et al., “Retargetable Cross Compilation Techniques—Comparision and Analysis of GCC and Zephyr,”ACM SIGPLAN Notices, Technical Correspondence, vol. 37, Issue 6, pp. 38-44, Jun. 2002.
Hayes et al., “Component Design of Retargetable Program Analysis Tools that Reuse Intermediate Representations,” Proceedings of the 22ndInternational Conference on Software Engineering, Limerick, Ireland, ACM, pp. 356-365, Jun. 2000.
Heine et al., “Interprocedural Program Analyses,” ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation, Vancouver, B.C., 22 pages, http://suif.stanford.edu/suif/suif2/doc-2.2.0-4/tutorial/analysis.ppt, Jun. 2000.
Heine, “An Overview of the SUIF2 Base Infrastructure,” ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation, Vancouver, B.C., 30 pages, http://suif.stanford.edu/suif/suif2/doc-2.2.0-4/tutorial/basesuif.ppt, Jun. 2000.
Holzle et al., “OSUIF: SUIF For Objects,” ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation, Vancouver, B.C., pp. 1-17, http://suif.stanford.edu/suif/suif2/doc-2.2.0-4/tutorial/osuif-intro.ps, Jun. 2000.
Kessler et al., “EPIC—A Retargetable, Highly Optimizing Lisp Compiler,” ACM SIGPLAN Notices, Proceedings of the 1986 SIGPLAN Symposium on Compiler Construction, vol. 21, Issue 7, pp. 118-130, Jul. 1986.
Khedker
Plesko Mark Ronald
Tarditi, Jr. David Read
Chavis John
Klarquist & Sparkman, LLP
LandOfFree
Extensible type system for representing and checking... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Extensible type system for representing and checking..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extensible type system for representing and checking... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3703740