3,092 research outputs found
Experiments in Theorem Proving for Topological Hybrid Logic
International audienceThis paper discusses two experiments in theorem proving for hybrid logic under the topological interpre-tation. We begin by discussing the topological interpretation of hybrid logic and noting what it adds to the topological interpretation of orthodox modal logic. We then examine two implemented proof methods. The first makes use of HyLoBan, a terminating theorem prover that searches for a winning search strategy in certain topologically motivated games. The second is a translation-based approach that makes use of HyLoTab, a tableaux-based theorem prover for hybrid logic under the standard relational interpretation. We compare the two methods, and note a number of directions for further work
Interpolant-Based Transition Relation Approximation
In predicate abstraction, exact image computation is problematic, requiring
in the worst case an exponential number of calls to a decision procedure. For
this reason, software model checkers typically use a weak approximation of the
image. This can result in a failure to prove a property, even given an adequate
set of predicates. We present an interpolant-based method for strengthening the
abstract transition relation in case of such failures. This approach guarantees
convergence given an adequate set of predicates, without requiring an exact
image computation. We show empirically that the method converges more rapidly
than an earlier method based on counterexample analysis.Comment: Conference Version at CAV 2005. 17 Pages, 9 Figure
Satisfiability of Non-Linear Transcendental Arithmetic as a Certificate Search Problem
For typical first-order logical theories, satisfying assignments have a
straightforward finite representation that can directly serve as a certificate
that a given assignment satisfies the given formula. For non-linear real
arithmetic with transcendental functions, however, no general finite
representation of satisfying assignments is available. Hence, in this paper, we
introduce a different form of satisfiability certificate for this theory,
formulate the satisfiability verification problem as the problem of searching
for such a certificate, and show how to perform this search in a systematic
fashion. This does not only ease the independent verification of results, but
also allows the systematic design of new, efficient search techniques.
Computational experiments document that the resulting method is able to prove
satisfiability of a substantially higher number of benchmark problems than
existing methods
A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms
Distributed algorithms have many mission-critical applications ranging from
embedded systems and replicated databases to cloud computing. Due to
asynchronous communication, process faults, or network failures, these
algorithms are difficult to design and verify. Many algorithms achieve fault
tolerance by using threshold guards that, for instance, ensure that a process
waits until it has received an acknowledgment from a majority of its peers.
Consequently, domain-specific languages for fault-tolerant distributed systems
offer language support for threshold guards.
We introduce an automated method for model checking of safety and liveness of
threshold-guarded distributed algorithms in systems where the number of
processes and the fraction of faulty processes are parameters. Our method is
based on a short counterexample property: if a distributed algorithm violates a
temporal specification (in a fragment of LTL), then there is a counterexample
whose length is bounded and independent of the parameters. We prove this
property by (i) characterizing executions depending on the structure of the
temporal formula, and (ii) using commutativity of transitions to accelerate and
shorten executions. We extended the ByMC toolset (Byzantine Model Checker) with
our technique, and verified liveness and safety of 10 prominent fault-tolerant
distributed algorithms, most of which were out of reach for existing
techniques.Comment: 16 pages, 11 pages appendi
Patching task-level robot controllers based on a local µ-calculus formula
We present a method for mending strategies for
GR(1) specifications. Given the addition or removal of edges
from the game graph describing a problem (essentially transition
rules in a GR(1) specification), we apply a µ-calculus
formula to a neighborhood of states to obtain a “local strategy”
that navigates around the invalidated parts of an original
synthesized strategy. Our method may thus avoid global resynthesis
while recovering correctness with respect to the new
specification. We illustrate the results both in simulation and
on physical hardware for a planar robot surveillance task
- …