• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Typestate verification: Abstraction techniques and complexity results (2003)

Cached

  • Download as a PDF

Download Links

  • [www.cs.wisc.edu]
  • [pages.cs.wisc.edu]
  • [pages.cs.wisc.edu]
  • [www.cs.wisc.edu]
  • [www.cs.tau.ac.il]
  • [www.research.ibm.com]
  • [pages.cs.wisc.edu]
  • [www.cs.wisc.edu]
  • [pages.cs.wisc.edu]
  • [www.cs.tau.ac.il]
  • [www.research.ibm.com]
  • [www.research.ibm.com]
  • [www.math.tau.ac.il]
  • [www.cs.technion.ac.il]
  • [www.cs.technion.ac.il]
  • [pag.lcs.mit.edu]
  • [pag.csail.mit.edu]
  • [pag.lcs.mit.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by J. Field , D. Goyal , G. Ramalingam , E. Yahav
Venue:In Proc. of SAS’03, volume 2694 of LNCS
Citations:30 - 10 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Field03typestateverification:,
    author = {J. Field and D. Goyal and G. Ramalingam and E. Yahav},
    title = {Typestate verification: Abstraction techniques and complexity results},
    booktitle = {In Proc. of SAS’03, volume 2694 of LNCS},
    year = {2003},
    pages = {439--462},
    publisher = {Springer}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Abstract. We consider the problem of typestate verification for shallow programs; i.e., programs where pointers from program variables to heap-allocated objects are allowed, but where heap-allocated objects may not themselves contain pointers. We prove a number of results relating the complexity of verification to the nature of the finite state machine used to specify the property. Some properties are shown to be intractable, but others which appear to be quite similar admit polynomial-time verification algorithms. While there has been much progress on many aspects of automated program verification, we are not aware of any previous work relating the difficulty of typestate verification to properties of the finite state automaton. Our results serve to provide insight into the inherent complexity of important classes of verification problems. In addition, the program abstractions used for the polynomial-time verification algorithms may be of independent interest. 1

Keyphrases

typestate verification    complexity result    abstraction technique    heap-allocated object    many aspect    important class    similar admit polynomial-time verification algorithm    inherent complexity    finite state automaton    polynomial-time verification algorithm    much progress    independent interest    finite state machine    automated program verification    previous work    shallow program    program variable    verification problem    program abstraction   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University