14,092 research outputs found
A rigorous analysis of the cavity equations for the minimum spanning tree
We analyze a new general representation for the Minimum Weight Steiner Tree
(MST) problem which translates the topological connectivity constraint into a
set of local conditions which can be analyzed by the so called cavity equations
techniques. For the limit case of the Spanning tree we prove that the fixed
point of the algorithm arising from the cavity equations leads to the global
optimum.Comment: 5 pages, 1 figur
On abstraction refinement for program analyses in Datalog
A central task for a program analysis concerns how to efficiently find a program abstraction that keeps only information relevant for proving properties of interest. We present a new approach for finding such abstractions for program analyses written in Datalog. Our approach is based on counterexample-guided abstraction refinement: when a Datalog analysis run fails using an abstraction, it seeks to generalize the cause of the failure to other abstractions, and pick a new abstraction that avoids a similar failure. Our solution uses a boolean satisfiability formulation that is general, complete, and optimal: it is independent of the Datalog solver, it generalizes the failure of an abstraction to as many other abstractions as possible, and it identifies the cheapest refined abstraction to try next. We show the performance of our approach on a pointer analysis and a typestate analysis, on eight real-world Java benchmark programs
Logic Programming Applications: What Are the Abstractions and Implementations?
This article presents an overview of applications of logic programming,
classifying them based on the abstractions and implementations of logic
languages that support the applications. The three key abstractions are join,
recursion, and constraint. Their essential implementations are for-loops, fixed
points, and backtracking, respectively. The corresponding kinds of applications
are database queries, inductive analysis, and combinatorial search,
respectively. We also discuss language extensions and programming paradigms,
summarize example application problems by application areas, and touch on
example systems that support variants of the abstractions with different
implementations
A Survey of Symbolic Execution Techniques
Many security and software testing applications require checking whether
certain properties of a program hold for any possible usage scenario. For
instance, a tool for identifying software vulnerabilities may need to rule out
the existence of any backdoor to bypass a program's authentication. One
approach would be to test the program using different, possibly random inputs.
As the backdoor may only be hit for very specific program workloads, automated
exploration of the space of possible inputs is of the essence. Symbolic
execution provides an elegant solution to the problem, by systematically
exploring many possible execution paths at the same time without necessarily
requiring concrete inputs. Rather than taking on fully specified input values,
the technique abstractly represents them as symbols, resorting to constraint
solvers to construct actual instances that would cause property violations.
Symbolic execution has been incubated in dozens of tools developed over the
last four decades, leading to major practical breakthroughs in a number of
prominent software reliability applications. The goal of this survey is to
provide an overview of the main ideas, challenges, and solutions developed in
the area, distilling them for a broad audience.
The present survey has been accepted for publication at ACM Computing
Surveys. If you are considering citing this survey, we would appreciate if you
could use the following BibTeX entry: http://goo.gl/Hf5FvcComment: This is the authors pre-print copy. If you are considering citing
this survey, we would appreciate if you could use the following BibTeX entry:
http://goo.gl/Hf5Fv
Explaining the unobserved: why quantum mechanics is not only about information
A remarkable theorem by Clifton, Bub and Halvorson (2003)(CBH) characterizes
quantum theory in terms of information--theoretic principles. According to Bub
(2004, 2005) the philosophical significance of the theorem is that quantum
theory should be regarded as a ``principle'' theory about (quantum) information
rather than a ``constructive'' theory about the dynamics of quantum systems.
Here we criticize Bub's principle approach arguing that if the mathematical
formalism of quantum mechanics remains intact then there is no escape route
from solving the measurement problem by constructive theories. We further
propose a (Wigner--type) thought experiment that we argue demonstrates that
quantum mechanics on the information--theoretic approach is incomplete.Comment: 34 Page
Explaining the Unobserved: Why Quantum Theory Ain't Only About Information
A remarkable theorem by Clifton, Bub and Halvorson (2003) (CBH) characterizes quantum theory in terms of information--theoretic principles. According to Bub (2004, 2005) the philosophical significance of the theorem is that quantum theory should be regarded as a ``principle'' theory about (quantum) information rather than a ``constructive'' theory about the dynamics of quantum systems. Here we criticize Bub's principle approach arguing that if the mathematical formalism of quantum mechanics remains intact then there is no escape route from solving the measurement problem by constructive theories. We further propose a (Wigner--type) thought experiment that we argue demonstrates that quantum mechanics on the information--theoretic approach is incomplete
Frequency vs. Association for Constraint Selection in Usage-Based Construction Grammar
A usage-based Construction Grammar (CxG) posits that slot-constraints
generalize from common exemplar constructions. But what is the best model of
constraint generalization? This paper evaluates competing frequency-based and
association-based models across eight languages using a metric derived from the
Minimum Description Length paradigm. The experiments show that
association-based models produce better generalizations across all languages by
a significant margin
Pilot-wave theory and quantum fields
Pilot-wave theories provide possible solutions to the measurement problem. In
such theories, quantum systems are not only described by the state vector, but
also by some additional variables. These additional variables, also called
beables, can be particle positions, field configurations, strings, etc. In this
paper we focus our attention on pilot-wave theories in which the additional
variables are field configurations. The first such theory was proposed by Bohm
for the free electromagnetic field. Since Bohm, similar pilot-wave theories
have been proposed for other quantum fields. The purpose of this paper is to
present an overview and further development of these proposals. We discuss
various bosonic quantum field theories such as the Schroedinger field, the free
electromagnetic field, scalar quantum electrodynamics and the Abelian Higgs
model. In particular, we compare the pilot-wave theories proposed by Bohm and
by Valentini for the electromagnetic field, finding that they are equivalent.
We further discuss the proposals for fermionic fields by Holland and Valentini.
In the case of Holland's model we indicate that further work is required in
order to show that the model is capable of reproducing the standard quantum
predictions. We also consider a similar model, which does not seem to reproduce
the standard quantum predictions. In the case of Valentini's model we point out
a problem that seems hard to overcome.Comment: 65 pages, no figures, LaTex; v2 minor changes, some extensions; v3
minor improvements; v4 some typos correcte
COSMICAH 2005: workshop on verification of COncurrent Systems with dynaMIC Allocated Heaps (a Satellite event of ICALP 2005) - Informal Proceedings
Lisboa Portugal, 10 July 200
- âŚ