de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
 
 
DownloadE-Mail
  Transition predicate abstraction and fair termination

Podelski, A., & Rybalchenko, A. (2005). Transition predicate abstraction and fair termination. In Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2005 (pp. 124-139). New York, USA: ACM.

Item is

Basic

show hide
Item Permalink: http://hdl.handle.net/11858/00-001M-0000-000F-2820-4 Version Permalink: http://hdl.handle.net/11858/00-001M-0000-000F-2821-2
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Podelski, Andreas1, Author              
Rybalchenko, Andrey1, Author              
Palsberg, Jens, Editor
Abadi, Martín, Editor
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, escidoc:40045              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2005-04-272005
 Publication Status: Published in print
 Pages: -
 Publishing info: New York, USA : ACM
 Table of Contents: -
 Rev. Method: -
 Identifiers: eDoc: 279118
Other: Local-ID: C1256104005ECAFC-57767FAFB6FB6779C1256FC00041E44D-PodelskiRybalchenkoPOPL2005
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Long Beach, CA, USA
Start-/End Date: 2005-01-12 -

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2005
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, USA : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 124 - 139 Identifier: ISBN: 1-58113-830-X