Word-level Symbolic Trajectory Evaluation

Symbolic trajectory evaluation (STE) is a model checking technique that has been successfully used to verify industrial designs. Existing implementations of STE, however, reason at the level of bits, allowing signals to take values in {0, 1, X}. This limits the amount of abstraction that can be achieved, and presents inherent limitations to scaling. The main contribution of this paper is to show how much more abstract lattices can be derived automatically from RTL descriptions, and how a model checker for the general theory of STE instantiated with such abstract lattices can be implemented in practice. This gives us the first practical word-level STE engine, called STEWord. Experiments on a set of designs similar to those used in industry show that STEWord scales better than word-level BMC and also bit-level STE.Comment: 19 pages, 3 figures, 2 tables, full version of paper in International Conference on Computer-Aided Verification (CAV) 201

A Faithful Semantics for Generalised Symbolic Trajectory Evaluation

Generalised Symbolic Trajectory Evaluation (GSTE) is a high-capacity formal verification technique for hardware. GSTE uses abstraction, meaning that details of the circuit behaviour are removed from the circuit model. A semantics for GSTE can be used to predict and understand why certain circuit properties can or cannot be proven by GSTE. Several semantics have been described for GSTE. These semantics, however, are not faithful to the proving power of GSTE-algorithms, that is, the GSTE-algorithms are incomplete with respect to the semantics. The abstraction used in GSTE makes it hard to understand why a specific property can, or cannot, be proven by GSTE. The semantics mentioned above cannot help the user in doing so. The contribution of this paper is a faithful semantics for GSTE. That is, we give a simple formal theory that deems a property to be true if-and-only-if the property can be proven by a GSTE-model checker. We prove that the GSTE algorithm is sound and complete with respect to this semantics

GSTE is partitioned model checking

Verifying whether an ω-regular property is satisfied by a finite-state system is a core problem in model checking. Standard techniques build an automaton with the complementary language, compute its product with the system, and then check for emptiness. Generalized symbolic trajectory evaluation (GSTE) has been recently proposed as an alternative approach, extending the computationally efficient symbolic trajectory evaluation (STE) to general ω-regular properties. In this paper, we show that the GSTE algorithms are essentially a partitioned version of standard symbolic model-checking (SMC) algorithms, where the partitioning is driven by the property under verification. We export this technique of property-driven partitioning to SMC and show that it typically does speed up SMC algorithm

Coverage measurement for software application level verification using symbolic trajectory evaluation techniques

Copyright © 2004 IEEEDesign verification of a systems-on-a-chip is a bottleneck for hardware design projects. A new solution is a design verification methodology that applies coverage driven verification at the embedded software application level. This methodology currently lacks an appropriate coverage measurement technique. This paper proposes a new coverage model for the software application level. Using this coverage model, a novel technique to represent and measure coverage is described. This technique uses ideas such as control graph structures and checking algorithms to estimate the completeness of software application verification.Adriel Cheng, Atanas Parashkevov, Cheng-Chew Li

Detectability of non-differentiable generalized synchrony

Generalized synchronization of chaos is a type of cooperative behavior in directionally-coupled oscillators that is characterized by existence of stable and persistent functional dependence of response trajectories from the chaotic trajectory of driving oscillator. In many practical cases this function is non-differentiable and has a very complex shape. The generalized synchrony in such cases seems to be undetectable, and only the cases, in which a differentiable synchronization function exists, are considered to make sense in practice. We show that this viewpoint is not always correct and the non-differentiable generalized synchrony can be revealed in many practical cases. Conditions for detection of generalized synchrony are derived analytically, and illustrated numerically with a simple example of non-differentiable generalized synchronization.Comment: 8 pages, 8 figures, submitted to PR

Symmetry Decomposition of Chaotic Dynamics

Discrete symmetries of dynamical flows give rise to relations between periodic orbits, reduce the dynamics to a fundamental domain, and lead to factorizations of zeta functions. These factorizations in turn reduce the labor and improve the convergence of cycle expansions for classical and quantum spectra associated with the flow. In this paper the general formalism is developed, with the $N$-disk pinball model used as a concrete example and a series of physically interesting cases worked out in detail.Comment: CYCLER Paper 93mar01