NDLI: Combinations of abstract domains for logic programming

Please wait, while we are loading the content...

Memory subsystem performance of programs using copying garbage collection

Correctness of trap-based breakpoint implementations

Dominators, super blocks, and program coverage

The typed polymorphic label-selective λ-calculus

A functional theory of local names

From λσ to λν: a journey through calculi of explicit substitutions

Portable, unobtrusive garbage collection for multiprocessor systems

Higher-order concurrent programs with finite communication topology (extended abstract)

Proving concurrent constraint programs correct

Manifest types, modules, and separate compilation

A type-theoretic approach to higher-order modules with sharing

A type system for prototyping languages

Decidable bounded quantification

Soft typing with conditional types

Automated synthesis of interface adapters for reusable classes

Implementation of the typed call-by-value λ-calculus using a stack of regions

Deriving algorithms from type inference systems: application to strictness analysis

Formally optimal boxing

Combinations of abstract domains for logic programming

Analyzing logic programs with dynamic scheduling

Higher-order equational logic programming

A needed narrowing strategy

Detecting pipeline structural hazards quickly

An incremental algorithm for maintaining the dominator tree of a reducible flowgraph

Value dependence graphs: representation without taxation

Lazy array data-flow dependence analysis

An operational framework for value-passing processes

CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms (preliminary report)

Combinatory representation of mobile processes

Multi-pass execution of functional logic programs

Composing tree attributions

A staging calculus and its application to the verification of translators (preliminary report)

Reducing indirect function call overhead in C++ programs

Call forwarding: a simple interprocedural optimization technique for dynamically typed languages

The revival transformation

Selective and lightweight closure conversion

Representing monads

A generic account of continuation-passing styles

Building interpreters by composing monads

Combinations of abstract domains for logic programming

Content Provider	ACM Digital Library
Author	Van Hentenryck, Pascal Cortesi, Agostino Le Charlier, Baudouin
Abstract	Abstract interpretation [7] is a systematic methodology to designstatic program analysis which has been studied extensively in the logicprogramming community, because of the potential for optimizations inlogic programming compilers and the sophistication of the analyses whichrequire conceptual support. With the emergence of efficient genericabstract interpretation algorithms for logic programming, the mainburden in building an analysis is the abstract domain which gives a safeapproximation of the concrete domain of computation. However, accurateabstract domains for logic programming are often complex because of thevariety of analyses to perform their interdependence, and the need tomaintain structural information. The purpose of this paper is to proposeconceptual and software support for the design of abstract domains. Itcontains two main contributions: the notion of open product and ageneric pattern domain. The openproduct is a new way of combining abstract domainsallowing each combined domain to benefit from information from the othercomponents through the notions of queries and open operations. The openproduct is general-purpose and can be used for other programmingparadigms as well. The generic patterndomain Pat (R OPS) which would be very difficult todesign otherwise. On this last domain, designers need only contributeabout 20% (about 3,400 lines) of the complete system (about 17,700lines).
Starting Page	227
Ending Page	239
Page Count	13
File Format	PDF
ISBN	0897916360
DOI	10.1145/174675.177880
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1994-02-01
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Combinations of abstract domains for logic programming: open product and generic pattern construction (2000).

Abstract Domains for Constraint Programming, with the Example of Octagons

A logical model for relational abstract domains

Combinations of Reusable Abstract Domains for a Multilingual Static Analyzer

Improving abstract interpretations by combining domains

Logic programming for combinatorial problems

Verification of parameterized systems with combinations of abstract domains

ALPprolog – A new logic programming method for dynamic domains. Theory and Practice of Logic Programming (2011)

Inductive logic programming for bioinformatics in prova abstract.

Combinations of abstract domains for logic programming

Similar Documents

Combinations of abstract domains for logic programming: open product and generic pattern construction (2000).

Abstract Domains for Constraint Programming, with the Example of Octagons

A logical model for relational abstract domains

Combinations of Reusable Abstract Domains for a Multilingual Static Analyzer

Improving abstract interpretations by combining domains

Logic programming for combinatorial problems

Verification of parameterized systems with combinations of abstract domains

ALPprolog – A new logic programming method for dynamic domains. Theory and Practice of Logic Programming (2011)

Inductive logic programming for bioinformatics in prova abstract.

Combinations of abstract domains for logic programming