Efficient Computation of Fixpoints that Arise in Complex Program Analysis

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 270
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorli-ling chenko
dc.contributor.authorluddy harrisonko
dc.contributor.authorkwangkeun yiko
dc.date.accessioned2013-02-27T19:11:00Z-
dc.date.available2013-02-27T19:11:00Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued1995-
dc.identifier.citationJOURNAL OF PROGRAMMING LANGUAGES, v.1, no.3, pp.31 - 68-
dc.identifier.issn0963-9306-
dc.identifier.urihttp://hdl.handle.net/10203/70303-
dc.languageEnglish-
dc.publisherCompSciNet-
dc.titleEfficient Computation of Fixpoints that Arise in Complex Program Analysis-
dc.typeArticle-
dc.type.rimsART-
dc.citation.volume1-
dc.citation.issue3-
dc.citation.beginningpage31-
dc.citation.endingpage68-
dc.citation.publicationnameJOURNAL OF PROGRAMMING LANGUAGES-
dc.contributor.localauthorkwangkeun yi-
dc.contributor.nonIdAuthorli-ling chen-
dc.contributor.nonIdAuthorluddy harrison-
Appears in Collection
RIMS Journal Papers
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0