Method and system for bidirectional bitwise constant...

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

C717S127000, C717S151000

Reexamination Certificate

active

06848099

ABSTRACT:
A method and system for bidirectional bitwise constant propogation by abstract interpretation is disclosed. In one embodiment, the method performs optimizing an implementation of a programming language, comprising; analyzing one or more values computed by a program written in the programming language, wherein analyzing one or more values comprises; representing each bit within a value of the one or more values as an abstract element of a lattice having a set of abstract elements including 0A, 1A, ⊥Aand TA, wherein the lattice is an abstraction of a concrete domain containing 0, 1, and ⊥; analyzing one or more output bits that are produced by an operation in terms of one or more input bits that are input to the operation; and analyzing the input bits that are input to the operation in terms of the output bits that are produced by the operation.

REFERENCES:
Bourdoncle, Francois, “Assertion-Based Debugging of Imperative Programs by Abstract Interpretation”, Digital Paris Research Laboratory, 85, avenue Victor Hugo, 92500 Rueil-Malmaison—France, bourdoncle@prl.dec.com, pp. 16.
Cousot, Patrick, “The Abstract Interpretation Perspective”, ACM Workshop on Strategic Directions in Computing Research, MIT Laboratory for Computer Science, Cambridge, Massachusetts, USA, Jun. 14-15, 1996, pp. 1-8.
Cousot, Patrick, “Abstract Interpretation”, http://www.ens.fr/_cousot, ACM Computing Surveys, vol. 28, No. 2, pp. 324-328, Jun. 1996.
Cousot, Patrick, “Abstract Interpretation: Achievements and Perspectives”, Proceedings of the SSGRR 2000 Computer & eBusiness International Conference, Compact disk paper 224, L'Aquila, Italy, Jul. 31-Aug. 6, 2000. Scuola Superiore G. Reiss Romoli, pp. 1-7.
Cousot, Patrick, et al., “Abstract Interpretation And Applications to Logic Programs”, Journal of Logic Programming, 13(2-3):103-179, 1992.
Coursot, Patrick, “Abstract Interpretation Based Static Analysis Parameterized by Semantics”, Proceedings of the 4th International Symposium on Static Analysis, SAS'97, Paris, France, Sep. 8-10, 1997, P. van Hentenryck (Ed.), Lecture Notes in Computer Science 1302, Springer-Verlag, pp. 388-394.
Coursot, Patrick, et al., “Abstract Interpretation Frameworks”, Journal of Logic and Computation, 2(4):511-547, Aug. 1992.
Coursot, Patrick, et al., “Abstract Interpretation of Algebraic Polynomial Systems” (Extended Abstract), In M. Johnson, editor, Proceedings of the Sixth International Conference on Algebraic Methodology and Software Technology, AMAST'97, Sydney, Australia, Lecture Notes in Computer Science 1349, pp. 138-154, Springer-Verlag, Berlin, Germany, Dec. 13-18, 1997.
Coursot, Patrick, Asychronous Iterative Methods For Solving A Fixed Point System of Monotone Equations in a Complete Lattice, In Research Report R.R. 88, Laboratoire IMAG, University of Grenoble, France. 15 pages. Sep. 1977.
Coursot, Patrick, et al., “Automatic Discovery of Linear Restraints Among Variables of a Program”, In Conference Record of the Fifth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Program ming Languages, pp. 84-97, Tuscon, Arizona, 1978. ACM Press, New York, NY, USA.
Coursot, Patrick, et al., “Automatic Synthesis of Optimal Invariant Assertions: Mathematical Foundations”, In Proceedings of the ACM Symposium on Artificial Intelligence & Programming Languages, 1977, Rochester, NY, USA. SIGPLAN Notices, vol. 12, Nb 8, Aug. 15-17, 1977, pp. 1-12; SIGART Newsletter, No. 64, Aug. 15, 17, 1977, pp. 1-12; ACM Press, New York, NY, USA.
Coursot, Patrick, et al., “Abstract Interpretation: a Unified Lattice Model For Static Analysis of Programs by Construction of Approximation of Fixpoints”, In Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 238-252, Los Angeles, California, 1977. ACM Press, New York, NY, USA.
Coursot, Patrick, “Constructive Design of a Heirarchy of Semantics of a Transition System by Abstract Interpretation” (Extended Abstract), Electronic Notes in Theoretical Computer Science, 6 (1997) URL: http://www.elsevier.nl/locate/entcs/volume6.html, 25 pages.
Coursot, Patrick, et al., “Refining Model Checking by Abstract Interpretation”, Automated Software Engineering Journal, special issue on Automated Software Analysis, 6(1):69-95, 1999.
Coursot, Patrick, et al., “Relational Abstract Interpretation of High-Order Functional Programs” (Extended Abstract). Actes JTASPEFL'91, Bordeaux, Oct. 9-11, 1991, in BIGRE, No. 74, pp. 33-36, IRISA, Rennes, France, 1991.
Coursot, Patrick, et al., “Static Determinants of Dynamic Properties of Generalized Type Unions”, In Proceedings of an ACM Conference on Language Design for Reliable Software, D. Wortman (Ed.), Mar. 28-30, 1977, Raleigh, NC, USA. SIGPLAN Notices, vol. 12, Nb3, Mar. 1977, pp. 77-94, ACM Press, New York, NY, USA.
Coursot, Patrick, et al., “Static Determination of Dynamic Properties of Programs”, In B. Robinet, editor, Proceedings of the second international symposium on Programming, Paris, France, pp. 106-130, Apr. 13-15, 1976, Dunod, Paris.
Coursot, Patrick, et al., “Static Verification of Dynamic Type Properties of Variables”, Research Report RR. 25, Laboratoire IMAG, University of Grenoble, France. 18 pages. Nov. 1975.
Coursot, Patrick, et al., “Temporal Abstract Interpretation”, Conference Record of the 27th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Programming Languages, Boston, Mass., Jan. 19-21, 2000. ACM Press, New York, U.S.A. pp. 12-25.
Coursot, Patrick, “The Calculation Design of a Generic Abstract Interpreter”, Course notes for the NATO International Summer School 1998 on Calculation System Design. Marktoberdorf, Germany, Jul. 28-Aug. 9, 1998, organized by F.L. Bauer, M. Broy, E.W. Dijkstra, D. Gries and C.A.R. Hoare, pp. 1-88.
Coursot, Patrick, “Types as Abstract Interpretations” (Invited Paper), Conference Record of the 24th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Programming Languages, Paris, France, Jan. 15-17, 1997. ACM Press, New York, U.S.A. pp. 316-331.
Hunt, Sebastian, “Abstract Interpretation of Functional Languages: From Theory to Practice”, University of London, Imperial College of Science, Technology and Medicine, Department of Computing, A thesis submitted for the degree of Doctor of Philosophy of the University of London, Oct. 1991, pp. 1-166.
Coursot, Patrick, et al., “Static Determination of Dynamic Properties of Recursive Procedures”, in IFIP Conference on Formal Description of Programming Concepts, E.J. Neuhold, (Ed.), pp. 237-277, St-Andrews, N.B., Canada, 1977. North-Holland Publishing Company 1978).
Giacobazzi, Roberto, et al., “Making Abstract Interpretations Complete”, Universita Di Pisa, Dipartimento Di Informatica, Technical Report: TR-97-22, Nov. 3, 1997, ADDR: Corso Italia 40,56125 Pisa, Italy, pp. 1-44.
Verbrugge, Clark, et al., “Generalized Constant Propagation A Study in C”, {clump, phaedrus, hendren} @cs.mcgill.ca, School of Computer Science, McGill University, Montreal, Quebec, Canada H3A 2A7, In Proceedings of the 1996 International Conference on Compiler Construction (CC '96), Linkoping, Swenden, Apr. 24-26, 1996, LNCS 1060, Springer-Verlag, Copyright(c) 1996 Clark Verbrugge, Laurie Hendren, Phong Co. pp. 16.
Cousot, Patrick, et al., “Abstract Interpretation Based Program Testing”, Proceedings of the SSGRR 2000 Computer & eBusiness International Conference, Compact disk paper 248, L'Aquila, Italy, Jul. 31-Aug. 6, 2000. Scuola Superiore G. Reiss Romoli, pp. 1-10.

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

Method and system for bidirectional bitwise constant... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and system for bidirectional bitwise constant..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for bidirectional bitwise constant... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3416487

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