(Enter summary)
Abstract: Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Since the basic operational step in program execution is a test for solvability of constraints in a given algebraic structure, CLP has in addition an algebraic semantics. CLP is then a general paradigm which may be instantiated on various semantic domains, thus achieving a good expressive power. One relevant feature is the... (Update)
Context of citations to this paper: More
...imposed. Our study on the applications to dataflow analysis started with the definition of an abstract interpretation for CLP(FD) 1 [2, 3], following the framework proposed in [9] The objective was to derive spatial approximations of the success set of program predicates. The...
...ideal) implemented language and system [28] 18 4. 2 Bounds and relations analysis for numeric domains The analysis described in [6,7,3] is based on constraint inference, a variant of constraint propagation [19] This technique, developed in the field of artificial intelligence,...
Cited by: More
Generalized Semantics And Abstract Interpretation For.. - Giacobazzi, Debray, Levi (1995)
(Correct)
A hierarchy of Constraint Systems for Data-Flow Analysis of.. - Bagnara (1996)
(Correct)
Constraint Systems for Pattern Analysis of Constraint Logic-Based .. - Bagnara (1995)
(Correct)
Similar documents (at the sentence level):
68.8%: Static Analysis of CLP Programs over Numeric Domains - Bagnara, Giacobazzi, Levi (1992)
(Correct)
32.1%: An Application of Constraint Propagation to Data-Flow.. - Bagnara, Giacobazzi, Levi (1993)
(Correct)
9.1%: A Generalized Semantics for Constraint Logic Programs - Roberto Giacobazzi Saumya (1992)
(Correct)
Active bibliography (related documents): More All
0.3: On the Detection of Implicit and Redundant Numeric Constraints in .. - Bagnara (1994)
(Correct)
0.2: Negative Boolean Constraints - Marriott, Odersky (1994)
(Correct)
0.2: Making Abstract Interpretations Complete - Giacobazzi, Ranzato (1997)
(Correct)
Similar documents based on text: More All
0.6: Waltz Quick Start - Roberts (1996)
(Correct)
0.4: Modelling Prolog Control - Roberto Barbuti Michael (1992)
(Correct)
0.3: A General Framework for Semantics-based Bottom-up.. - Barbuti, Giacobazzi.. (1993)
(Correct)
Related documents from co-citation: More All
9: Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979
8: Abstract interpretation: a unified lattice model for static analysis of programs.. (context) - Cousot, Cousot - 1977
8: An application of constraint propagation to data-flow analysis
- Bagnara, Giacobazzi et al. - 1993
BibTeX entry: (Update)
R. Bagnara, R. Giacobazzi, and G. Levi. Static Analysis of CLP Programs over Numeric Domains. In Actes Workshop on Static Analysis '92, Bordeaux, 1992. http://citeseer.ist.psu.edu/article/bagnara92static.html More
@inproceedings{ bagnaragl92,
Author = "R. Bagnara and R. Giacobazzi and G. Levi",
Title = "Static Analysis of {CLP} Programs over Numeric Domains",
Editor = "M. Billaud and P. Cast{\'e}ran and MM. Corsini and
K. Musumbu and A. Rauzy",
BookTitle = "Actes ``Workshop on Static Analysis '92''",
Address = "Bordeaux",
Pages ="43--50",
Month = "September",
Year = 1992,
Volume = "81--82",
Series = "Bigre",
Note = "Extended abstract",
url = "citeseer.ist.psu.edu/article/bagnara92static.html" }
Citations (may not include all citations):
1044
Maintaining Knowledge About Temporal Intervals (context) - Allen - 1983
815
Abstract Interpretation: A Unified Lattice Model for Static .. (context) - Cousot, Cousot - 1977
702
Consistency in Networks of Relations (context) - Mackworth - 1977
561
Constraint Logic Programming (context) - Jaffar, Lassez - 1987
245
The Omega Test: a Fast and Practical Integer Programming Alg..
- Pugh - 1991
216
Semantic foundation of concurrent constraint programming
- Saraswat, Rinard et al. - 1991
185
The Complexity of Some Polynomial Network Consistency Algori.. (context) - Mackworth, Freuder - 1985
142
Constraint Propagation with Interval Labels (context) - Davis - 1987
134
ACM Transactions on Programming Languages and Systems (context) - Jaffar, Michaylov et al. - 1991
87
Fourier-Motzkin Elimination and its Dual (context) - Dantzig, Eaves - 1973
43
The Sup-Inf Method in for Proving Presburger Formulas (context) - Shostak - 1977
35
A Generalized Semantics for Constraint Logic Programs
- Giacobazzi, Debray et al. - 1992
15
Some Global Compile-Time Optimizations for CLP (context) - Jorgensen, Marriot et al. - 1991
14
to Floating-Point Arithmetic (context) - Lee, van Emden - 1992
14
Commonsense Arithmetic Reasoning (context) - Simmons - 1986
13
The Sup-Inf Method in Presburger Arithmetic (context) - Bledsoe - 1974
6
Interpretazione Astratta di Linguaggi Logici con Vincoli su .. (context) - Bagnara - 1992
5
Representing and Reasoning About Change in Geologic Interpre.. (context) - Simmons - 1983
4
Spatial Query Optimization: from Boolean Constraints to Rang.. (context) - Helm, Marriot et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://strudel.di.unipi.it/papers/): More
Properties of the Lattice of Observables in Logic Programming - Amato, Levi (1997)
(Correct)
A Reactive Implementation of Pos Using ROBDDs - Bagnara (1996)
(Correct)
An OR-Compositional Semantics for Logic Programs - Bossi, GABBRIELLI, LEVI, MEO (1993)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC