Interpretation of Domain-Specific Embedded Languages Kevin Backhouse Lincoln College Submitted for the degree of Doctor of Philosophy in Computation September 23, 2002

Domain Completeness Isabella Mastroeni and Anindya Banerjee a Università di Verona, Verona, Italy e-mail:[email protected] b IMDEA Software Institute, Madrid, Spain e-mail: [email protected] Received 13 October 2010 This paper explores a three dimensional characterization of a declassification-based noninterference policy and its consequences. Two of the dimensions consist in...

Numeric abstract domains are key to many verification problems. Their ability to scale hinges on using convex approximations of the possible variable valuations. In certain cases, this approximation is too coarse to verify certain verification conditions, namely those that require disjunctive invariants. A common approach to infer disjunctive invariants is to track a set of states. However, thi...

Substantial machine learning research has addressed the task of learning new knowledge given a (possibly incomplete or incorrect) domain theory, but leaves open the question of where such domain theories originate from in the rst place. In this paper we address the problem of constructing a domain theory itself from more general, abstract knowledge which may be available. The basis of our metho...

This article presents the Two Variable Per Inequality abstract domain (TVPI domain for short). This so-called weakly-relational domain is able to express systems of linear inequalities where each inequality has at most two variables. The domain represents a sweet-point in the performance-cost tradeoff between the faster Octagon domain and the more expressive domain of general convex polyhedra. ...

Completeness in abstract interpretation is an ideal and rare situation where the abstract semantics is able to take full advantage of the power of representation of the underlying abstract domain. In this paper, we develop an algebraic theory of completeness in abstract interpretation. We show that completeness is an abstract domain property and we prove that there always exist both the greates...

We propose a new numerical abstract domain for static analysis by abstract interpretation, the domain of Weighted Hexagons. It is capable of expressing interval constraints and relational invariants of the form x ≤ a · y, where x and y are variables and a denotes a non-negative constant. This kind of domain is useful in analysis of safety for array accesses when multiplication is used (e.g. in ...