English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Efficient Algorithms for Pre$^\star$ and Post$^\star$ on Interprocedural Parallel Flow Graphs

Esparza, J., & Podelski, A. (2000). Efficient Algorithms for Pre$^\star$ and Post$^\star$ on Interprocedural Parallel Flow Graphs. In Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL-00) (pp. 1-11). New York, USA: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-342D-1 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-342E-0
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Esparza, Javier1, Author           
Podelski, Andreas1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-122000
 Publication Status: Issued
 Pages: -
 Publishing info: New York, USA : ACM
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 519793
Other: Local-ID: C1256104005ECAFC-A9208369E45B2127C1256A110037E8D1-EsparzaPodelskiPOPL00
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Boston, Massachusetts, USA
Start-/End Date: 2000

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL-00)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, USA : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 1 - 11 Identifier: ISBN: 1-58113-125-9