1993
DOI: 10.1007/3-540-57264-3_39
|View full text |Cite
|
Sign up to set email alerts
|

Abstract rewriting

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
10
0
3

Year Published

1994
1994
2018
2018

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 16 publications
(13 citation statements)
references
References 6 publications
0
10
0
3
Order By: Relevance
“…To obtain a manageable analysis, we consider only top-level constructors in the analysis so that a value is some constructor-rooted expression. In principle, this could be extended to any depth bound k (as used in the abstract diagnosis of functional programs [2] or in the abstraction of term rewriting systems [8,9]), but in practice only a depth k = 1 (i.e., top-level constructors) is useful due to the quickly growing size of the abstract domain for k > 1. For instance, for lists we distinguish the values [] (empty list) and ":" (non-empty lists) and for Booleans we distinguish the values True and False.…”
mentioning
confidence: 99%
“…To obtain a manageable analysis, we consider only top-level constructors in the analysis so that a value is some constructor-rooted expression. In principle, this could be extended to any depth bound k (as used in the abstract diagnosis of functional programs [2] or in the abstraction of term rewriting systems [8,9]), but in practice only a depth k = 1 (i.e., top-level constructors) is useful due to the quickly growing size of the abstract domain for k > 1. For instance, for lists we distinguish the values [] (empty list) and ":" (non-empty lists) and for Booleans we distinguish the values True and False.…”
mentioning
confidence: 99%
“…We first recall the abstract domains and the associated abstract operators together with some previous results concerning them. We note that a different analysis of unsatisfiability is introduced in [6] for constructor-based programs where the computation is done by abstract rewriting. This method is not comparable to ours, since there are examples which can be analyzed by only one of the two methods and our method is able to capture some computational properties related to the use of logical variables that abstract rewriting does not.…”
Section: Abstract Basic Conditional Narrowingmentioning
confidence: 99%
“…Sin embargo, las técnicas avanzadas de compilación, que dependen del análisis global del programa, requieren el desarrollo de nuevos métodos de análi-sis para programas lógico-funcionales [Han94b]. Sin pretender ser exhaustivos, algunos de los principales trabajos en este campo se han centrado en los siguientes puntos: análisis de la insatisfacibilidad ecuacional [AFM95,BEØ93], análisis de modos [BPM93,Han94c,HZ94], análisis de la groundness [Boy93,HL96], análisis de la demanda [MKM + 93], análisis para la identificación del paralelismo implícito [SR92,SR93], análisis para la detección de computaciones deterministas [BPM93], etc.…”
Section: Análisis Semánticounclassified
“…En [HL96], se define un análisis de la groundness a partir de una definición denotacional de narrowing perezoso, siguiendo la aproximación al análisis de programas lógicos presentada en [JS87]. Mucho más cercanos a nuestra técnica de análisis se encuentran los trabajos sobre reescritura abstracta, presentados en [BEØ93,BE95], en los que se define un método para aproximar conjuntos de formas normales para instancias básicas de términos con respecto a un programa CB. Se definen las nociones de descripción de un término y de programa abstracto, que se computa como el menor punto fijo de un operador de transformación de programas.…”
Section: Comparación Con Otras Aproximacionesunclassified
See 1 more Smart Citation