Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • 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 (engelsk)Inngår i: Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, ACM Digital Library, 2008, s. 61-70Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
ACM Digital Library, 2008. s. 61-70
HSV kategori
Forskningsprogram
Inbyggda system
Identifikatorer
URN: urn:nbn:se:ltu:diva-31664Lokal ID: 5e91e090-c117-11dd-a054-000ea68e967bISBN: 978-1-595-93977-7 (tryckt)OAI: oai:DiVA.org:ltu-31664DiVA, id: diva2:1004898
Konferanse
ACM/SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation : 07/01/2008 - 08/01/2008
Merknad
Upprättat; 2008; 20081203 (pawpie)Tilgjengelig fra: 2016-09-30 Laget: 2016-09-30 Sist oppdatert: 2017-11-25bibliografisk kontrollert

Open Access i DiVA

fulltekst(157 kB)28 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 157 kBChecksum SHA-512
43eb17bdc83ea3dfbf7f52ab8afcdde5421b8c8ef8fd530268c46cd5107467018455d09935cd228c3d105f6c7ff341f76c940c03dad93625ecc1099eb29ebd97
Type fulltextMimetype application/pdf

Personposter BETA

Pietrzak, Pawel

Søk i DiVA

Av forfatter/redaktør
Pietrzak, Pawel

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 28 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

isbn
urn-nbn

Altmetric

isbn
urn-nbn
Totalt: 35 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf