4,890 research outputs found
Verification and Synthesis of Symmetric Uni-Rings for Leads-To Properties
This paper investigates the verification and synthesis of parameterized
protocols that satisfy leadsto properties on symmetric
unidirectional rings (a.k.a. uni-rings) of deterministic and constant-space
processes under no fairness and interleaving semantics, where and are
global state predicates. First, we show that verifying for
parameterized protocols on symmetric uni-rings is undecidable, even for
deterministic and constant-space processes, and conjunctive state predicates.
Then, we show that surprisingly synthesizing symmetric uni-ring protocols that
satisfy is actually decidable. We identify necessary and
sufficient conditions for the decidability of synthesis based on which we
devise a sound and complete polynomial-time algorithm that takes the predicates
and , and automatically generates a parameterized protocol that
satisfies for unbounded (but finite) ring sizes. Moreover, we
present some decidability results for cases where leadsto is required from
multiple distinct predicates to different predicates. To demonstrate
the practicality of our synthesis method, we synthesize some parameterized
protocols, including agreement and parity protocols
Formal Executable Models for Automatic Detection of Timing Anomalies
A timing anomaly is a counterintuitive timing behavior in the sense that a local fast execution slows down an overall global execution. The presence of such behaviors is inconvenient for the WCET analysis which requires, via abstractions, a certain monotony property to compute safe bounds. In this paper we explore how to systematically execute a previously proposed formal definition of timing anomalies. We ground our work on formal designs of architecture models upon which we employ guided model checking techniques. Our goal is towards the automatic detection of timing anomalies in given computer architecture designs
Sparsity-Sensitive Finite Abstraction
Abstraction of a continuous-space model into a finite state and input
dynamical model is a key step in formal controller synthesis tools. To date,
these software tools have been limited to systems of modest size (typically
6 dimensions) because the abstraction procedure suffers from an
exponential runtime with respect to the sum of state and input dimensions. We
present a simple modification to the abstraction algorithm that dramatically
reduces the computation time for systems exhibiting a sparse interconnection
structure. This modified procedure recovers the same abstraction as the one
computed by a brute force algorithm that disregards the sparsity. Examples
highlight speed-ups from existing benchmarks in the literature, synthesis of a
safety supervisory controller for a 12-dimensional and abstraction of a
51-dimensional vehicular traffic network
Improving BDD Based Symbolic Model Checking with Isomorphism Exploiting Transition Relations
Symbolic model checking by using BDDs has greatly improved the applicability
of model checking. Nevertheless, BDD based symbolic model checking can still be
very memory and time consuming. One main reason is the complex transition
relation of systems. Sometimes, it is even not possible to generate the
transition relation, due to its exhaustive memory requirements. To diminish
this problem, the use of partitioned transition relations has been proposed.
However, there are still systems which can not be verified at all. Furthermore,
if the granularity of the partitions is too fine, the time required for
verification may increase. In this paper we target the symbolic verification of
asynchronous concurrent systems. For such systems we present an approach which
uses similarities in the transition relation to get further memory reductions
and runtime improvements. By applying our approach, even the verification of
systems with an previously intractable transition relation becomes feasible.Comment: In Proceedings GandALF 2011, arXiv:1106.081
Generalizing input-driven languages: theoretical and practical benefits
Regular languages (RL) are the simplest family in Chomsky's hierarchy. Thanks
to their simplicity they enjoy various nice algebraic and logic properties that
have been successfully exploited in many application fields. Practically all of
their related problems are decidable, so that they support automatic
verification algorithms. Also, they can be recognized in real-time.
Context-free languages (CFL) are another major family well-suited to
formalize programming, natural, and many other classes of languages; their
increased generative power w.r.t. RL, however, causes the loss of several
closure properties and of the decidability of important problems; furthermore
they need complex parsing algorithms. Thus, various subclasses thereof have
been defined with different goals, spanning from efficient, deterministic
parsing to closure properties, logic characterization and automatic
verification techniques.
Among CFL subclasses, so-called structured ones, i.e., those where the
typical tree-structure is visible in the sentences, exhibit many of the
algebraic and logic properties of RL, whereas deterministic CFL have been
thoroughly exploited in compiler construction and other application fields.
After surveying and comparing the main properties of those various language
families, we go back to operator precedence languages (OPL), an old family
through which R. Floyd pioneered deterministic parsing, and we show that they
offer unexpected properties in two fields so far investigated in totally
independent ways: they enable parsing parallelization in a more effective way
than traditional sequential parsers, and exhibit the same algebraic and logic
properties so far obtained only for less expressive language families
- …