251,556 research outputs found

    Regular Matching and Inclusion on Compressed Tree Patterns with Constrained Context Variables

    Get PDF
    International audienceWe study the complexity of regular matching and inclusion for compressed tree patterns with context variables subject to regular constraints. Context variables with regular constraints permit to properly generalize on unranked tree patterns with hedge variables. Regular inclusion on unranked tree patterns is relevant to certain query answering on Xml streams with references. We show that regular matching and inclusion with regular constraints can be reduced in polynomial time to the corresponding problem without regular constraints

    What is decidable about string constraints with the ReplaceAll function

    Get PDF
    The theory of strings with concatenation has been widely argued as the basis of constraint solving for verifying string-manipulating programs. However, this theory is far from adequate for expressing many string constraints that are also needed in practice; for example, the use of regular constraints (pattern matching against a regular expression), and the string-replace function (replacing either the first occurrence or all occurrences of a ``pattern'' string constant/variable/regular expression by a ``replacement'' string constant/variable), among many others. Both regular constraints and the string-replace function are crucial for such applications as analysis of JavaScript (or more generally HTML5 applications) against cross-site scripting (XSS) vulnerabilities, which motivates us to consider a richer class of string constraints. The importance of the string-replace function (especially the replace-all facility) is increasingly recognised, which can be witnessed by the incorporation of the function in the input languages of several string constraint solvers. Recently, it was shown that any theory of strings containing the string-replace function (even the most restricted version where pattern/replacement strings are both constant strings) becomes undecidable if we do not impose some kind of straight-line (aka acyclicity) restriction on the formulas. Despite this, the straight-line restriction is still practically sensible since this condition is typically met by string constraints that are generated by symbolic execution. In this paper, we provide the first systematic study of straight-line string constraints with the string-replace function and the regular constraints as the basic operations. We show that a large class of such constraints (i.e. when only a constant string or a regular expression is permitted in the pattern) is decidable. We note that the string-replace function, even under this restriction, is sufficiently powerful for expressing the concatenation operator and much more (e.g. extensions of regular expressions with string variables). This gives us the most expressive decidable logic containing concatenation, replace, and regular constraints under the same umbrella. Our decision procedure for the straight-line fragment follows an automata-theoretic approach, and is modular in the sense that the string-replace terms are removed one by one to generate more and more regular constraints, which can then be discharged by the state-of-the-art string constraint solvers. We also show that this fragment is, in a way, a maximal decidable subclass of the straight-line fragment with string-replace and regular constraints. To this end, we show undecidability results for the following two extensions: (1) variables are permitted in the pattern parameter of the replace function, (2) length constraints are permitted

    Matchings and Hamilton Cycles with Constraints on Sets of Edges

    Full text link
    The aim of this paper is to extend and generalise some work of Katona on the existence of perfect matchings or Hamilton cycles in graphs subject to certain constraints. The most general form of these constraints is that we are given a family of sets of edges of our graph and are not allowed to use all the edges of any member of this family. We consider two natural ways of expressing constraints of this kind using graphs and using set systems. For the first version we ask for conditions on regular bipartite graphs GG and HH for there to exist a perfect matching in GG, no two edges of which form a 44-cycle with two edges of HH. In the second, we ask for conditions under which a Hamilton cycle in the complete graph (or equivalently a cyclic permutation) exists, with the property that it has no collection of intervals of prescribed lengths whose union is an element of a given family of sets. For instance we prove that the smallest family of 44-sets with the property that every cyclic permutation of an nn-set contains two adjacent pairs of points has size between (1/9+o(1))n2(1/9+o(1))n^2 and (1/2−o(1))n2(1/2-o(1))n^2. We also give bounds on the general version of this problem and on other natural special cases. We finish by raising numerous open problems and directions for further study.Comment: 21 page

    Bach equation and the matching of spacetimes in conformal cyclic cosmology models

    Get PDF
    We consider the problem of matching two spacetimes, the previous and present aeons, in the Conformal Cyclic Cosmology model. The common boundary between them inherits two sets of constraints -- one for each solution of the Einstein field equations extended to the conformal boundaries. The previous aeon is assumed to be an asymptotically de Sitter spacetime, so the standard conformal formulation of the Einstein field equations suffice to derive the constraints on the future null infinity. For the future aeon, which is supposed to evolve from an initial singularity, they are obtained with the use of the Bach equation. This equation is regular at the past conformal infinity for conformally flat and conformally Einstein spacetimes, so we will mostly focus on them here. An example of the electrovacuum spacetime which does not fall into this class and has regular conformal Bach tensor will be discussed in the appendix.Comment: 10 pages; updated to match the published versio

    Verification of regular arrays by symbolic simulation

    Get PDF
    Journal ArticleMany algorithms have an efficient hardware formulation as a regular array of cells, which can be implemented in VLSI as regular circuit structures. Bit-sliced microprocessors, pattern matching circuits, associative cache memories, Hue-grain systolic arrays, and embedded memory-with-logic structures are representative of the regular array design style. In this paper, we illustrate a verification approach for regular arrays. Our approach for the verification of regular arrays combines formal verification at the high level and symbolic simulation at the low level(e.g., switch-level). The verification approach is based on a simple hardware specification formalism called HOP, a parallel composition algorithm for regular arrays called PCA, and a switch-level symbolic simulator (e.g., COSMOS). We illustrate our verification approach on the Least Recently Used(LRU) priority algorithm implemented as a two-dimensional array of LRU cells in VLSI. We also show a new technique of encoding input constraints as parametric boolean expressions on inputs to reduce the number of symbolic simulation vectors required for verification. The use of this technique in LRU array verification results in the simulation of only one symbolic simulation vector independent of the size of the LRU array
    • …
    corecore