We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration for model checking concurrent software. Our technique hinges on a new characterization of partial orders defined by computations of a concurrent program in terms of quasi-monotonic sequences of thread-ids. This characterizatio...

We present a new approach to the verification of hardware systems with data dependencies using temporal logic symbolic model checking. As a benchmark we take Tomasulo’s algorithm [10] for out-of-order instruction scheduling. Our approach is similar to the idea of uninterpreted function symbols [4]. We use symbolic values and instructions instead of concrete ones. This allows us to show the corr...

In this position paper, we seek to extend the layered perception-action paradigm for on-line learning such that it includes an explicit symbolic processing capability. By incorporating symbolic processing at the apex of the perception action hierarchy in this way, we ensure that abstract symbol manipulation is fully grounded, without the necessity of specifying an explicit representational fram...

This paper on the Egyptian feminist playwright Nawal El Sadaawi’s play Isis (1986) seeks to explore the psychological and social dimensions of castration by applying the Slovenian Marxist and Lacanian philosopher Slavoj Žižek’s ideas on symbolic castration, ideological fantasy and mask. The focus will be on Žižek’s understanding of Lacan’s ideas on symbolic castration. It will be proved that Ra...

The Islamic Revolution of Iran has included symbolic aspects. The fundamental question of the article is that, what are the symbolic aspects of the Islamic Revolution of Iran and why the Islamic Republic of Iran has used these features to influence Islamic countries? Since the bearers of the word and the symbolic goods have the most legitimacy in social and political fields, this revolution has...

Ramscar and colleagues (2010, this volume) describe the "feature-label-order" (FLO) effect on category learning and characterize it as a constraint on symbolic learning. I argue that FLO is neither a constraint on symbolic learning in the sense of "learning elements of a symbol system" (instead, it is an effect on nonsymbolic, association learning) nor is it, more than any other constraint on c...

This paper presents an algorithm for fast large-change sensitivity computation for approximate symbolic analysis. The sensitivity is used for identifying negligible elements of circuit model that can be removed in order to simplify symbolic solution. The method is based on combination of the Sherman-Morison formula and sparse matrix techniques. Effectiveness of the method was tested on several ...

This paper considers the symbolic determinant computation. The aptness of permutation method for symbolic determinant is justified and a new efficient algorithm is proposed to implement the permutation method. Exploiting the fact computers perform arithmetic operations fast, the proposed algorithm generate all the permutations without manipulation on additional 2nd array or redundancies found i...

An interactive system called SIASCA which automates the calculation of symbolic expressions (SEs) representing the dominant behavior of analog circuits, is introduced. SIASCA includes a more general class of active devices whose behavior is modeled at different levels of abstraction using nullors in order to enhance the capability of symbolic analysis to calculate simplified SEs. Key-Words: Sym...

Matching is the process of comparing two or more structures to discover their likenesses or differences. It is a common operation performed in symbolic classification, pattern recognition, data mining and expert systems. The definition of a matching operator for Boolean symbolic objects is important for the development of symbolic data analysis techniques. In this paper we give the definition o...