Transition predicate abstraction and fair termination

Podelski, Andreas; Rybalchenko, Andrey

Local TagsRelease HistoryDetailsSummary

Transition predicate abstraction and fair termination

Podelski, A., & Rybalchenko, A. (2007). Transition predicate abstraction and fair termination. ACM Transactions on Programming Languages and Systems, 29: 15, pp. 15.1-15.31.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0028-8C7B-D Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0028-8C7C-B

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Podelski, Andreas¹, Author
Rybalchenko, Andrey^{2, 3}, Author

Affiliations:
1Max Planck Society, ou_persistent13
2Group A. Rybalchenko, Max Planck Institute for Software Systems, Max Planck Society, ou_2105299
3Programming Logics, MPI for Informatics, Max Planck Society, ou_40045

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2008-03-28Date issued: 2007

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 352580
Other: C125718C00511B58-8BDDF551CA647042C12573EF0048E3A8-Podelski2007

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: ACM Transactions on Programming Languages and Systems

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 29 Sequence Number: 15 Start / End Page: 15.1 - 15.31 Identifier: ISSN: 0164-0925