Since Kadmon and Landman’s influential 1993 paper (K&L), the insight that any serves as a domain widening indefinite has proven very productive. My objective in this paper is to discuss how we cash out that intuition. K&L tied any to the lifting of restrictions: In an NP of the form ‘any CN’, ‘any’ widens the interpretation of the common noun phrase (CN) along a contextual dimension.’ (K&L: 361...

Non-trivial analysis problems require posets with infinite ascending and descending chains. In order to compute reasonably precise post-fixpoints of the resulting systems of equations, Cousot and Cousot have suggested accelerated fixpoint iteration by means of widening and narrowing (Cousot and Cousot, 1976, 1977a). The strict separation into phases, however, may unnecessarily give up precision...

Despite the ubiquity of ROBDDs in program analysis, and extensive literature on ROBDD minimisation, there is a dearth of work on approximating ROBDDs. The need for approximation arises because many ROBDD operations result in an ROBDD whose size is quadratic in the size of the inputs. Furthermore, if ROBDDs are used in abstract interpretation, the running time of the analysis is related not only...