skip to main content
research-article
Free Access

Reasoning about the unknown in static analysis

Published:01 August 2010Publication History
First page image

References

  1. Aiken, A., Bugrara, S., Dillig, I., Dillig, T., Hackett, B., Hawkins, P. An overview of the SATURN project. In PASTE (2007), 43--48. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Ball, T. Rajamani, S. Bebop: A symbolic model checker for Boolean programs. In SPIN (2000), 113--130. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Ball, T., Rajamani, S. Automatically validating temporal safety properties of interfaces. LNCS 2057 (2001), 103--122. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Boole, G. An Investigation of the Laws of Thought. Dover Publications, Incorporated, 1858. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Cook, B., Gotsman, A., Podelski, A., Rybalchenko, A., Vardi, M. Proving that programs eventually do something good. In POPL (2007), 265--276. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Das, M., Lerner, S., Seigle, M. ESP: Path-sensitive program verification in polynomial time. In PLDI (2002), 57--68. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Henglein, F. Type inference and semi-unification. In Conference on LISP and Functional Programming (1988), 184--197. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Henzinger, T., Jhala, R., Majumdar, R., McMillan, K. Abstractions from proofs. In POPL (2004), 232--244. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Mycroft, A. Polymorphic type schemes and recursive definitions. In International Symposium on Programming (1984), 217--228. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Reps, T., Horwitz, S., Sagiv, M. Precise interprocedural dataflow analysis via graph reachability. In POPL (1995), 49--61. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Schmidt, D. A calculus of logical relations for over-and underapproximating static analyses. Science of Computer Programming 64, 1 (2007), 29--53. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Reasoning about the unknown in static analysis

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            • Published in

              cover image Communications of the ACM
              Communications of the ACM  Volume 53, Issue 8
              August 2010
              136 pages
              ISSN:0001-0782
              EISSN:1557-7317
              DOI:10.1145/1787234
              Issue’s Table of Contents

              Copyright © 2010 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 August 2010

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • research-article
              • Popular
              • Refereed

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader

            HTML Format

            View this article in HTML Format .

            View HTML Format