Quadtrees as an Abstract Domain

Quadtrees have proved popular in computer graphics and spatial databases as a way of representing regions in two dimensional space. This hierarchical data-structure is flexible enough to support non-convex and even disconnected regions, therefore it is natural to ask whether this datastructure can form the basis of an abstract domain. This paper explores this question and suggests that quadtrees offer a new approach to weakly relational domains whilst their hierarchical structure naturally lends itself to representation with boolean functions

Integer polyhedra for program analysis

Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from imprecision when it is necessary to take into account the integrality of the represented space. Imprecision also arises when non-linear constraints occur. Moreover, in terms of tractability, even a space defined by linear constraints can become unmanageable owing to the excessive number of inequalities. Thus it is useful to identify those inequalities whose omission has least impact on the represented space. This paper shows how these issues can be addressed in a novel way by growing the integer hull of the space and approximating the number of integral points within a bounded polyhedron

Implicit Real Vector Automata

peer reviewedThis paper addresses the symbolic representation of non-convex real polyhedra, i.e., sets of real vectors satisfying arbitrary Boolean combinations of linear constraints. We develop an original data structure for representing such sets, based on an implicit and concise encoding of a known structure, the Real Vector Automaton. The resulting formalism provides a canonical representation of polyhedra, is closed under Boolean operators, and admits an efficient decision procedure for testing the membership of a vector

Reachability analysis for timed automata using max-plus algebra

International audienceWe show that max-plus polyhedra are usable as a data structure in reachability analysis of timed automata. Drawing inspiration from the extensive work that has been done on difference bound matrices, as well as previous work on max-plus polyhedra in other areas, we develop the algorithms needed to perform forward and backward reachability analysis using max-plus polyhedra. To show that the approach works in practice and theory alike, we have created a proof-of-concept implementation on top of the model checker opaal

Landscaping with fluxes and the E8 Yukawa Point in F-theory

Integrality in the Hodge theory of Calabi-Yau fourfolds is essential to find the vacuum structure and the anomaly cancellation mechanism of four dimensional F-theory compactifications. We use the Griffiths-Frobenius geometry and homological mirror symmetry to fix the integral monodromy basis in the primitive horizontal subspace of Calabi-Yau fourfolds. The Gamma class and supersymmetric localization calculations in the 2d gauged linear sigma model on the hemisphere are used to check and extend this method. The result allows us to study the superpotential and the Weil-Petersson metric and an associated tt* structure over the full complex moduli space of compact fourfolds for the first time. We show that integral fluxes can drive the theory to N=1 supersymmetric vacua at orbifold points and argue that fluxes can be chosen that fix the complex moduli of F-theory compactifications at gauge enhancements including such with U(1) factors. Given the mechanism it is natural to start with the most generic complex structure families of elliptic Calabi-Yau 4-fold fibrations over a given base. We classify these families in toric ambient spaces and among them the ones with heterotic duals. The method also applies to the creating of matter and Yukawa structures in F-theory. We construct two SU(5) models in F-theory with a Yukawa point that have a point on the base with an $E_8$-type singularity on the fiber and explore their embeddings in the global models. The explicit resolution of the singularity introduce a higher dimensional fiber and leads to novel features.Comment: 150 page

Some advances in the polyhedral model

Department Head: L. Darrell Whitley.2010 Summer.Includes bibliographical references.The polyhedral model is a mathematical formalism and a framework for the analysis and transformation of regular computations. It provides a unified approach to the optimization of computations from different application domains. It is now gaining wide use in optimizing compilers and automatic parallelization. In its purest form, it is based on a declarative model where computations are specified as equations over domains defined by "polyhedral sets". This dissertation presents two results. First is an analysis and optimization technique that enables us to simplify---reduce the asymptotic complexity---of such equations. The second is an extension of the model to richer domains called Ƶ-Polyhedra. Many equational specifications in the polyhedral model have reductions---application of an associative and commutative operator to collections of values to produce a collection of answers. Moreover, expressions in such equations may also exhibit reuse where intermediate values that are computed or used at different index points are identical. We develop various compiler transformations to automatically exploit this reuse and simplify the computational complexity of the specification. In general, there is an infinite set of applicable simplification transformations. Unfortunately, different choices may result in equivalent specifications with different asymptotic complexity. We present an algorithm for the optimal application of simplification transformations resulting in a final specification with minimum complexity. This dissertation also presents the Ƶ-Polyhedral model, an extension to the polyhedral model to more general sets, thereby providing a transformation framework for a larger set of regular computations. For this, we present a novel representation and interpretation of Ƶ-Polyhedra and prove a number of properties of the family of unions of Ƶ-Polyhedra that are required to extend the polyhedral model. Finally, we present value based dependence analysis and scheduling analysis for specifications in the Ƶ-Polyhedral model. These are direct extensions of the corresponding analyses of specifications in the polyhedral model. One of the benefits of our results in the Ƶ-Polyhedral model is that our abstraction allows the reuse of previously developed tools in the polyhedral model with straightforward pre- and post-processing

Biporous Metal-Organic Framework with Tunable CO2/CH4 Separation Performance Facilitated by Intrinsic Flexibility.

In this work, we report the synthesis of SION-8, a novel metal-organic framework (MOF) based on Ca(II) and a tetracarboxylate ligand TBAPy4- endowed with two chemically distinct types of pores characterized by their hydrophobic and hydrophilic properties. By altering the activation conditions, we gained access to two bulk materials: the fully activated SION-8F and the partially activated SION-8P with exclusively the hydrophobic pores activated. SION-8P shows high affinity for both CO2 ( Qst = 28.4 kJ/mol) and CH4 ( Qst = 21.4 kJ/mol), while upon full activation, the difference in affinity for CO2 ( Qst = 23.4 kJ/mol) and CH4 ( Qst = 16.0 kJ/mol) is more pronounced. The intrinsic flexibility of both materials results in complex adsorption behavior and greater adsorption of gas molecules than if the materials were rigid. Their CO2/CH4 separation performance was tested in fixed-bed breakthrough experiments using binary gas mixtures of different compositions and rationalized in terms of molecular interactions. SION-8F showed a 40-160% increase (depending on the temperature and the gas mixture composition probed) of the CO2/CH4 dynamic breakthrough selectivity compared to SION-8P, demonstrating the possibility to rationally tune the separation performance of a single MOF by manipulating the stepwise activation made possible by the MOF's biporous nature