We generalize the various path orderings and the conditions under which they work, and describe an implementation of this general ordering. We look at methods for proving termination of orthogonal systems and give a new solution to a problem of Zantema's. 1 I n t r o d u c t i o n If no infinite sequences of rewrites are possible, a rewrite system is said to have tile termiuation property. In p...

Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among threads. Most modern software model checkers can handle only one source of non-determinism efficiently, but not both. This paper describes a SAT-based model checker for asynchronous Boolean programs that handles both sources effec...

We consider linear difference equations with polynomial coefficients over C and their solutions in the form of doubly infinite sequences (sequential solutions). We investigate the C-linear space of subanalytic solutions, i.e., those sequential solutions that are the restrictions to Z of some analytic solutions of the original equation. It is shown that this space coincides with the space of the...

A class dictionary defines all data structures which appear in a program as well as a language for describing data specified by the data structures. We demonstrate that class dictionaries are ideal for simplifying object-oriented programming. Our class dictionary based approach to object-oriented programming is independent of any particular programming language, so it is applicable to a large v...

State space explosion is a fundamental obstacle in formal veriication of designs and protocols. Several techniques for combating this problem have emerged in the past few years, among which two are signiicant: symbolic state space search using BDDs and partial order reductions. In asynchronous systems, interleavings of independent concurrent events are equivalent, and only a representative inte...

Many machine reading approaches, from shallow information extraction to deep semantic parsing, map natural language to symbolic representations of meaning. Representations such as first-order logic capture the richness of natural language and support complex reasoning, but often fail in practice due to their reliance on logical background knowledge and the difficulty of scaling up inference. In...

We discuss compact symbolic representations of large state spaces, based on binary decision diagrams (BDD). Extensions of BDDs are considered, in order to represent stochastic transition systems for performabil-ity analysis. Parallel composition of components can be performed in this context, without leading to state space explosion. Furthermore, we discuss state space reduction by Markovian bi...

Abstract In this paper we present an efficient computational and symbolic algorithms for solving a backward pentadiagonal linear systems. The implementation of the algorithms using Computer Algebra Systems (CAS) such as MAPLE, MACSYMA, MATHEMATICA, and MATLAB are straightforward. An examples are given in order to illustrate the algorithms. The symbolic algorithm is competitive the other methods...