English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Paths vs. Trees in Set-based Program Analysis

Charatonik, W., Podelski, A., & Talbot, J.-M. (2000). Paths vs. Trees in Set-based Program Analysis. In Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL-00) (pp. 330-337). New York, USA: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3455-3 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3456-1
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Charatonik, Witold1, Author           
Podelski, Andreas1, Author           
Talbot, Jean-Marc1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: Set-based analysis of logic programs provides an accurate method for descriptive type-checking of logic programs. The key idea of this method is to upper approximate the least model of the program by a regular set of trees. In 1991, Fr\"uhwirth, Shapiro, Vardi and Yardeni raised the question whether it can be more efficient to use the domain of sets of paths instead, {\em i.e.}, to approximate the least model by a regular set of words. We answer the question negatively by showing that type-checking for path-based analysis is as hard as the set-based one, that is DEXPTIME-complete. This result has consequences also in the areas of set constraints, automata theory and model checking.

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: 519749
Other: Local-ID: C1256104005ECAFC-5E4283F029E41586C125685C0050524A-CharatonikPodelskiTalbot-POPL00
 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: 330 - 337 Identifier: ISBN: 1-58113-125-9