## Watchpoint Semantics: A Tool for Compositional and Focussed Static Analyses (2001)

Venue: | Proc. of the Static Analysis Symposium, SAS'01 |

Citations: | 8 - 7 self |

### BibTeX

@INPROCEEDINGS{Spoto01watchpointsemantics:,

author = {Fausto Spoto},

title = {Watchpoint Semantics: A Tool for Compositional and Focussed Static Analyses},

booktitle = {Proc. of the Static Analysis Symposium, SAS'01},

year = {2001},

pages = {127--145},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

We abstract a denotational trace semantics for an imperative language into a compositional and focussed watchpoint semantics.

### Citations

660 | Systematic design of program analysis frameworks - Cousot, Cousot - 1979 |

556 | Principles of Program Analysis
- Nielson, Nielson, et al.
- 2005
(Show Context)
Citation Context ... context of model-checking. However, for properties of states, like in sign, interval, class and security context analysis of variables (and, more generally, in all those analyses calledsrst-order in =-=[12]-=-, page 210), trees are not needed and can be safely abstracted into sets of states. Abstract denotational semantics need a representation of the abstract input /output behaviour of a procedure. Since ... |

299 | Solving shapeanalysis problems in languages with destructive updating
- Sagiv, Reps, et al.
- 1996
(Show Context)
Citation Context ...of states described here is used below to dene a trace semantics for our language. Each of its abstractions will induce an abstraction of that semantics (Section 6), as usual in AI (see for instance [14]). More complex notions of states could be used here, maybe dealing with locations and memory. Denition 3. Let V alue = Int and = [ 2Typing where, for 2 Typing, states 2 map variables ... |

246 |
The Formal Semantics of Programming Languages
- Winskel
- 1993
(Show Context)
Citation Context ...to a signicant improvement in the time and space costs of the analysis. 1.1 Related Works Traditionally, compositionality is synonym with denotational semantics. But the usual denotational semantics [=-=16]-=- provides an input/output characterisation of procedures which is too abstract to observe their internal behaviour. This has been recognised in [5], where Cousot models information at internal program... |

152 |
Abstract interpretation: A unied lattice model for static analysis of programs by construction of approximation of xed points
- Cousot, Cousot
- 1977
(Show Context)
Citation Context ...ogram in very few points, with a cost proportional to their number. Oursrst contribution here is the denition of a compositional and focussed watchpoint semantics, as an abstract interpretation (AI) [=-=6-=-] specied by the watchpoints of interest of a more concrete trace semantics. An optimality result (Equation (4)) states that no precision is lost by this abstraction w.r.t. the information at the watc... |

101 | Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
- Cousot
(Show Context)
Citation Context ...nal semantics. But the usual denotational semantics [16] provides an input/output characterisation of procedures which is too abstract to observe their internal behaviour. This has been recognised in =-=[5]-=-, where Cousot models information at internal program points through a more concrete, denotational trace semantics. Here, a procedure is denoted by a map from an initial state to a trace of states rep... |

78 | Demanddriven computation of interprocedural data
- Duesterwald, Gupta, et al.
- 1995
(Show Context)
Citation Context ... [1]. Focussed or demand-driven frameworks for analysis have been developed in the past. In [2] backward propagation of assertions was applied to the debugging of a high-order imperative language. In =-=[8,9,13-=-] backward data ow analysis from a given query is dened and shown more ecient than an exhaustive, unfocussed analysis. The analyses in [8,9] are provably as precise as the corresponding unfocussed ver... |

76 | Global Flow Analysis as a Practical Compilation Tool
- HERMENEGILDO, WARREN, et al.
- 1992
(Show Context)
Citation Context ...mantics instantiated for sign analysis. It shows that the space and time costs of the analysis are proportional to the number of watchpoints. Thesnal contribution is to show that abstract compilation =-=[11-=-] leads to a signicant improvement in the time and space costs of the analysis. 1.1 Related Works Traditionally, compositionality is synonym with denotational semantics. But the usual denotational sem... |

59 | A practical framework for demand-driven interprocedural data flow analysis. TOPLAS
- Duesterwald, Gupta, et al.
(Show Context)
Citation Context ... [1]. Focussed or demand-driven frameworks for analysis have been developed in the past. In [2] backward propagation of assertions was applied to the debugging of a high-order imperative language. In =-=[8,9,13-=-] backward data ow analysis from a given query is dened and shown more ecient than an exhaustive, unfocussed analysis. The analyses in [8,9] are provably as precise as the corresponding unfocussed ver... |

38 | Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop
- Codish, Demoen
- 1994
(Show Context)
Citation Context ...ogram points. However, its actual application to a real programming language is not tackled there. Abstract compilation (AC) was born and applied only in the context of the analysis of logic programs =-=[3,11]-=-. It is an optimised computation of thesxpoint of an abstract semantics where at the i-th iteration part of the analysis is compiled when it becomes clear that it will not change at the (i + 1)-th ite... |

35 | Abstract Interpretation by dynamic partitioning
- Bourdoncle
- 1992
(Show Context)
Citation Context ... Section 6 we show a solution when the abstract domain elements can be written in terms of union-irreducible elements. For the general case, we rely on the functional partinioning technique dened in [=-=1]-=-. Focussed or demand-driven frameworks for analysis have been developed in the past. In [2] backward propagation of assertions was applied to the debugging of a high-order imperative language. In [8,9... |

24 | Trace-based program analysis
- Colby, Lee
- 1996
(Show Context)
Citation Context ...ocedure is denoted by a map from an initial state to a trace of states representing its execution from the initial state. Our trace semantics is a instance of the maximal trace semantics of [5]. Even =-=[4]-=- observes that traces contain more information than a traditional input/output denotation w.r.t. software pipelining, loopinvariant removal and data alias detection. That framework is however based on... |

20 |
Trace-Based Abstract Interpretation of Operational Semantics
- Schmidt
- 1998
(Show Context)
Citation Context ...more information than a traditional input/output denotation w.r.t. software pipelining, loopinvariant removal and data alias detection. That framework is however based on an operational denition. In [=-=15-=-] an operational trace semantics is dened and abstracted through AI into an abstract trace semantics. The abstraction of a trace is a (regular) tree, because of the non-deterministic nature of the abs... |

17 |
Precise interprocedural data analysis via graph reachability
- Reps, Horwitz, et al.
- 1995
(Show Context)
Citation Context ... [1]. Focussed or demand-driven frameworks for analysis have been developed in the past. In [2] backward propagation of assertions was applied to the debugging of a high-order imperative language. In =-=[8,9,13-=-] backward data ow analysis from a given query is dened and shown more ecient than an exhaustive, unfocussed analysis. The analyses in [8,9] are provably as precise as the corresponding unfocussed ver... |

16 | Resultant semantics for Prolog
- Gabbrielli, Levi, et al.
- 1996
(Show Context)
Citation Context ...ear that it will not change at the (i + 1)-th iteration. Our work has been heavily in uenced by the systematic construction of semantics for logic programming from the observable property of interest =-=[10]-=-. There, semantics for resultants, call patterns and computed answers of logic programs are derived through AI of the very concrete semantics of SLD-derivations. In particular, the call pattern semant... |

6 |
Abstract debugging of high-order imperative languages
- Bourdoncle
(Show Context)
Citation Context ...union-irreducible elements. For the general case, we rely on the functional partinioning technique dened in [1]. Focussed or demand-driven frameworks for analysis have been developed in the past. In [=-=2-=-] backward propagation of assertions was applied to the debugging of a high-order imperative language. In [8,9,13] backward data ow analysis from a given query is dened and shown more ecient than an e... |