Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A practical type analysis for verification of modular Prolog programs
Complutense University, Madrid.
Technical University of Madrid.
Technical University of Madrid.
2008 (English)In: Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, ACM Digital Library, 2008, 61-70 p.Conference paper, Published paper (Refereed)
Abstract [en]

Regular types are a powerful tool for computing very precise descriptive types for logic programs. However, in the context of reallife, modular Prolog programs, the accurate results obtained by regular types often come at the price of efficiency. In this paper we propose a combination of techniques aimed at improving analysis efficiency in this context. As a first technique we allow optionally reducing the accuracy of inferred types by using only the types defined by the user or present in the libraries. We claim that, for the purpose of verifying type signatures given in the form of assertions the precision obtained using this approach is sufficient, and show that analysis times can be reduced significantly. Our second technique is aimed at dealing with situations where we would like to limit the amount of reanalysis performed, especially for library modules. Borrowing some ideas from polymorphic type systems, we show how to solve the problem by admitting parameters in type specifications. This allows us to compose new call patterns with some precomputed analysis info without losing any information. We argue that together these two techniques contribute to the practical and scalable analysis and verification of types in Prolog programs.

Place, publisher, year, edition, pages
ACM Digital Library, 2008. 61-70 p.
National Category
Embedded Systems
Research subject
Embedded System
Identifiers
URN: urn:nbn:se:ltu:diva-31664Local ID: 5e91e090-c117-11dd-a054-000ea68e967bISBN: 978-1-595-93977-7 (print)OAI: oai:DiVA.org:ltu-31664DiVA: diva2:1004898
Conference
ACM/SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation : 07/01/2008 - 08/01/2008
Note
Upprättat; 2008; 20081203 (pawpie)Available from: 2016-09-30 Created: 2016-09-30Bibliographically approved

Open Access in DiVA

fulltext(157 kB)6 downloads
File information
File name FULLTEXT01.pdfFile size 157 kBChecksum SHA-512
43eb17bdc83ea3dfbf7f52ab8afcdde5421b8c8ef8fd530268c46cd5107467018455d09935cd228c3d105f6c7ff341f76c940c03dad93625ecc1099eb29ebd97
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Pietrzak, Pawel
Embedded Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 6 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 20 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf