34,352 research outputs found
Canonical Graph Shapes
Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding results in large individual states and large, or even unbounded, state spaces. As usual, some form of abstraction is necessary in order to arrive at a tractable model.
In this paper we propose a decidable fragment of first-order graph logic that we call local shape logic (LSL) as a possible abstraction mechanism, inspired by previous work of Sagiv, Reps and Wilhelm. An LSL formula constrains the multiplicities of nodes and edges in state graphs; abstraction is achieved by reasoning not about individual, concrete state graphs but about their characteristic shape properties. We go on to define the concept of the canonical shape of a state graph, which is expressed in a monomorphic sub-fragment of LSL, for which we define a graphical representation.
We show that the canonical shapes give rise to an automatic finite abstraction of the state space of a software system, and we give an upper bound to the size of this abstract state space
Fractal tiles associated with shift radix systems
Shift radix systems form a collection of dynamical systems depending on a
parameter which varies in the -dimensional real vector space.
They generalize well-known numeration systems such as beta-expansions,
expansions with respect to rational bases, and canonical number systems.
Beta-numeration and canonical number systems are known to be intimately related
to fractal shapes, such as the classical Rauzy fractal and the twin dragon.
These fractals turned out to be important for studying properties of expansions
in several settings. In the present paper we associate a collection of fractal
tiles with shift radix systems. We show that for certain classes of parameters
these tiles coincide with affine copies of the well-known tiles
associated with beta-expansions and canonical number systems. On the other
hand, these tiles provide natural families of tiles for beta-expansions with
(non-unit) Pisot numbers as well as canonical number systems with (non-monic)
expanding polynomials. We also prove basic properties for tiles associated with
shift radix systems. Indeed, we prove that under some algebraic conditions on
the parameter of the shift radix system, these tiles provide
multiple tilings and even tilings of the -dimensional real vector space.
These tilings turn out to have a more complicated structure than the tilings
arising from the known number systems mentioned above. Such a tiling may
consist of tiles having infinitely many different shapes. Moreover, the tiles
need not be self-affine (or graph directed self-affine)
Graph Abstraction and Abstract Graph Transformation
Many important systems like concurrent heap-manipulating programs, communication networks, or distributed algorithms are hard to verify due to their inherent dynamics and unboundedness. Graphs are an intuitive representation of states of these systems, where transitions can be conveniently described by graph transformation rules.
We present a framework for the abstraction of graphs supporting abstract graph transformation. The abstraction method naturally generalises previous approaches to abstract graph transformation. The set of possible abstract graphs is finite. This has the pleasant consequence of generating a finite transition system for any start graph and any finite set of transformation rules. Moreover, abstraction preserves a simple logic for expressing properties on graph nodes. The precision of the abstraction can be adjusted according to properties expressed in this logic to be verified
Unfolding Shape Graphs
Shape graphs have been introduced in [Ren04a, Ren04b] as an abstraction to be used in model checking object oriented software, where states of the system are represented as graphs. Intuitively, the graphs modeling the states represent the structure of objects dynamically allocated in the heap. State transitions are then generated by applying graph transformation rules corresponding to the statements of the program. Since the state space of such systems is potentially unbounded, the graphs representing the states are abstracted by shape graphs. Graph transformation systems may be analyzed [BCK01, BK02] by constructing finite structures that approximate their behaviour with arbitrary accuracy, by using techniques developed in the context of Petri nets. The approach of [BK02] is to construct a chain of finite under-approximations of the Winskel’s style unfolding of a graph grammar, as well as a chain of finite over-approximations of the unfolding, where both chains converge to the full unfolding. The approximations may then be used to check properties of the underlying graph transformation system. We apply this technique to approximate the behaviour of systems represented by shape graphs and graph tranformation rules
An Analytical Study of Large SPARQL Query Logs
With the adoption of RDF as the data model for Linked Data and the Semantic
Web, query specification from end- users has become more and more common in
SPARQL end- points. In this paper, we conduct an in-depth analytical study of
the queries formulated by end-users and harvested from large and up-to-date
query logs from a wide variety of RDF data sources. As opposed to previous
studies, ours is the first assessment on a voluminous query corpus, span- ning
over several years and covering many representative SPARQL endpoints. Apart
from the syntactical structure of the queries, that exhibits already
interesting results on this generalized corpus, we drill deeper in the
structural char- acteristics related to the graph- and hypergraph represen-
tation of queries. We outline the most common shapes of queries when visually
displayed as pseudographs, and char- acterize their (hyper-)tree width.
Moreover, we analyze the evolution of queries over time, by introducing the
novel con- cept of a streak, i.e., a sequence of queries that appear as
subsequent modifications of a seed query. Our study offers several fresh
insights on the already rich query features of real SPARQL queries formulated
by real users, and brings us to draw a number of conclusions and pinpoint
future di- rections for SPARQL query evaluation, query optimization, tuning,
and benchmarking
Using Description Logics for RDF Constraint Checking and Closed-World Recognition
RDF and Description Logics work in an open-world setting where absence of
information is not information about absence. Nevertheless, Description Logic
axioms can be interpreted in a closed-world setting and in this setting they
can be used for both constraint checking and closed-world recognition against
information sources. When the information sources are expressed in well-behaved
RDF or RDFS (i.e., RDF graphs interpreted in the RDF or RDFS semantics) this
constraint checking and closed-world recognition is simple to describe. Further
this constraint checking can be implemented as SPARQL querying and thus
effectively performed.Comment: Extended version of a paper of the same name that will appear in
AAAI-201
Null twisted geometries
We define and investigate a quantisation of null hypersurfaces in the context
of loop quantum gravity on a fixed graph. The main tool we use is the
parametrisation of the theory in terms of twistors, which has already proved
useful in discussing the interpretation of spin networks as the quantization of
twisted geometries. The classical formalism can be extended in a natural way to
null hypersurfaces, with the Euclidean polyhedra replaced by null polyhedra
with space-like faces, and SU(2) by the little group ISO(2). The main
difference is that the simplicity constraints present in the formalims are all
first class, and the symplectic reduction selects only the helicity subgroup of
the little group. As a consequence, information on the shapes of the polyhedra
is lost, and the result is a much simpler, abelian geometric picture. It can be
described by an Euclidean singular structure on the 2-dimensional space-like
surface defined by a foliation of space-time by null hypersurfaces. This
geometric structure is naturally decomposed into a conformal metric and scale
factors, forming locally conjugate pairs. Proper action-angle variables on the
gauge-invariant phase space are described by the eigenvectors of the Laplacian
of the dual graph. We also identify the variables of the phase space amenable
to characterize the extrinsic geometry of the foliation. Finally, we quantise
the phase space and its algebra using Dirac's algorithm, obtaining a notion of
spin networks for null hypersurfaces. Such spin networks are labelled by SO(2)
quantum numbers, and are embedded non-trivially in the unitary,
infinite-dimensional irreducible representations of the Lorentz group.Comment: 22 pages, 3 figures. v2: minor corrections, improved presentation in
section 4, references update
- …