S. Abramsky and C. Hankin. An introduction to abstract interpretation. In Samson Abramsky and Chris Hankin, editors, Abstract Interpretation of Declarative Languages, chapter 1, pages 9--31. Ellis Horwood, 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... The development of backward strictness analysis was motivated in part by the need for a method that could detect certain forms of data structure strictness such as head strictness, since a forward technique was not forthcoming, and suspected to be impossible by any forward analysis BHA framework [3]. A projection may be used to specify upper and lower bounds of the definedness of values (a semantic interpretation) or upper and lower bounds on evaluation (an operational interpretation) see e.g. 4] In particular, projections can usefully encode head strictness as well as ordinary ....

Abramsky, S. and Hankin, C. "An introduction to abstract interpretation." Ch. 1 of Abstract Interpretation of Declarative Languages. Abramsky, S. and Hankin, C. (eds.). Ellis-Horwood, 1987.

....analysis of fault tolerance properties for distributed systems. Our approach is not based on exhaustive statespace exploration. Instead, it is a novel hybrid of ideas from stream processing (or data flow) models of networks of processes [Kah74,Bro87,Bro90] and abstract interpretation of programs [AH87]. An important feature of our approach is its emphasis on communication (rather than state) consistent with the thesis that distributed systems have natural descriptions in terms of communication. In stream processing models, each component of a system is represented by an input output function ....

....to the target. Exact computation of all possible sequences of messages that might be sent is generally infeasible. To help make automated analysis feasible, our framework supports flexible and powerful approximations, or abstractions, as they are called in the literature on abstract interpretation [AH87] and program refinement [KMP94] Traditionally, Automated Stream Based Analysis of Fault Tolerance 3 stream processing models are used as mathematical semantics and incorporate no approximations. The approximations in our framework enable compact representation of the highly non deterministic ....

Samson Abramsky and Chris Hankin. An introduction to abstract interpretation. In Samson Abramsky and Chris Hankin, editors, Abstract Interpretation of Declarative Languages, chapter 1. Ellis-Horwood, 1987.

....and their success patterns that are reachable from a given input query. 4.1.1 Abstract Interpretation The standard concepts of abstract interpretation are reviewed in this section. Abstract interpretation is a formal framework for static analysis of the run time properties of logic programs [1], 7] 9] 15] 34] 39] 43] Definition 4.1.1: A poset (D; vD ) is a complete partially ordered set (cpo) iff every chain Y in D has a least upper bound (tDY ) in D. A poset (D; vD ) is a pointed cpo iff it is a complete partially ordered set and it has a least element. We describe ....

....result) i, i, i, d Schema Clauses Incr(u 1 ; u 2 ) Terminating(u 1 ) Initial result(u 1 ; u 2 ) Incr(u 1 ; u 2 ) Terminating(u 1 ) Deconstruction(u 1 ; v 1 ; v 2 ) Incr(v 2 ; v 3 ) Non initial result(u 1 ; v 1 ; v 3 ; u 2 ) Ground representation of Incremental schema. schema(incr, [1,2]) schemaclause(1, pvar(3) arg(var(1) i,tvar(1) arg(var(2) d,tvar(2) pvar(1) arg(var(1) i,tvar(1) pvar(2) arg(var(1) i,tvar(1) arg(var(2) d,tvar(2) schemaclause(2, pvar(3) arg(var(1) i,tvar(1) arg(var(2) d,tvar(2) not pvar(1) arg(var(1) i,tvar(1) pvar(4) ....

S. Abramsky and C. Hankin, An Introduction to Abstract Interpretation, Chapter 1, in Abstract Interpretation of Declarative Languages, edited by S. Abramsky and C. Hankin, Ellis Horwood Limited - John Wiley & Sons, 1987.

....are used to compute approximations of the set of all possible substitutions which can occur at each step of the execution of the program. The abstract interpretation approach, developed in [CC77] for data flow analysis of imperative programs, has been successfully applied to logic programs (see [AH87] for a brief introduction to the major stages in the development of the field; see [CC92] for a survey on its applications to logic programs) Since both the problems of groundness and of sharing among program variables at run time is undecidable, it remains a hard problem to find an abstract ....

S. Abramsky and C. Hankin. An Introduction to Abstract Interpretation. In Abstract Interpretation of declarative languages, pp. 9--31, eds. S. Abramsky and C. Hankin, Ellis Horwood, 1987.

....notion of variable and of the basic computational mechanism, does not provide a direct formalization of such a procedural interpretation. As a consequence various approaches have been proposed and a number of semantics for Prolog programs have been introduced to perform dataflow analysis (cf. [AH87]) This paper does not introduce a new approach: instead, it gives a novel use of techniques originally developed for imperative programs, to describe the meaning of Prolog programs. The novelty amounts to formalize the logic and the control part of a logic program separately, by means of the ....

....define an abstract interpretation framework for dataflow analysis of logic programs. Although the original work on abstract interpretation was intended for imperative programs ( CC77] it has been widely applied to declarative programming languages, due to the generality of its basic scheme (cf. [AH87], CC92] First, the concrete domain Conc equipped with a partial order is approximated by an abstract domain Abs equipped with a partial order v, such that there is a Galois connection (f a ; f c ) between Conc and Abs, i.e. f a : Conc Abs, f c : Abs Conc are total monotone functions ....

S. Abramsky and C. Hankin. An introduction to abstract interpretation. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of declarative languages, pages 9--31. Ellis Horwood, 1987.

No context found.

S. Abramsky and C. Hankin. An introduction to abstract interpretation. In Samson Abramsky and Chris Hankin, editors, Abstract Interpretation of Declarative Languages, chapter 1, pages 9--31. Ellis Horwood, 1987.

No context found.

S. Abramsky and C. Hankin. An introduction to abstract interpretation. In Abstract Interpretation of Declarative Languages. Ellis Horwood Ltd, 1987.

No context found.

S. Abramsky and C. Hankin, "An Introduction to Abstract Interpretation", from Abstract Interpretation of Declarative languages, Samson Abramsky and Chris Hankin, editors, Ellis Horwood, 1987.

No context found.

S. Abramsky and C. Hankin. An Introduction to Abstract Interpretation. In Abstract Interpretation of Declarative Languages [AH87a], chapter 1, pages 63102.

No context found.

S. Abramsky and C. Hankin. An Introduction to Abstract Interpretation. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, pages 9--31. Ellis Horwood Ltd, 1987.

No context found.

S. Abramsky and C. Hankin. An introduction to abstract interpretation. In Abstract Interpretation of Declarative Languages. Ellis Horwood Ltd, 1987.

No context found.

Samson Abramsky and Chris Hankin. An introduction to abstract interpretation, chapter 1, pages 9--31, in Abstract Interpretation of Declarative Languages. Ellis Horwood, 1987.

No context found.

Abramsky, S. and Hankin, C. "An introduction to abstract interpretation." Chapter 1 of [AH87b]

No context found.

S. Abramsky and C. Hankin. An introduction to abstract interpretation. In Abstract Interpretation of Declarative Languages. Ellis Horwood Ltd, 1987.

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