An Input Output Symbolic Transition System (IOSTS) specifies all expected sequences of input and output messages of a reactive system. Symbolic execution over this IOSTS then allows to generate a set of test cases that can exercise the various possible behaviors of the system it represents. In this paper, we extend the IOSTS framework with explicit program calls, possibly equipped with contract...

When asked to bisect mentally numerical intervals, neglect patients show a displacement of the numerical midpoint similar to the one observed in physical line bisection. This spatial-numerical bias has been taken as evidence of the spatial nature of numerical magnitude representations. However, to date, neuropsychological studies in neglect patients have only used symbolic numerical material. H...

This paper is an attempt to explore how Lacanian concepts of desire, unconscious, as well as alienation are reflected in the major characters of Vladimir Vladimirovich Nabokov’s Lolita. Before unleashing the new, inexplicable yet highly fascinating aspects of psychoanalysis by the advent of French poststructuralist and psychoanalyst Jacques Lacan, Freudian psychoanalysis used to play the pivota...

Symbolic execution runs programs with symbolic inputs instead of concrete ones. A symbolic input models a range of values, which may be constrained or modified during program execution. The output of symbolic execution is the set of all possible program execution paths, and for each path and variable v — the symbolic expression to which v is bound, i.e. the set of constraints on v on the path a...

This paper introduces a new, efficient method for deriving compact symbolic representations of very large (labelled) Markov chains resulting from high-level model specifications such as stochastic Petri nets, stochastic process algebras, etc.. This so called “activity-local” scheme is combined with a new data structure, called zero-suppressed multi-terminal binary decision diagram, and a new ef...

An automatized method to search for complex symbolic dynamics is proposed. The method can be used to show that a given dynamical system is chaotic in the topological sense. Application of this method in the analysis of a third-order memristor circuit is presented. Several examples of symbolic dynamics are constructed. Positive lower bounds for the topological entropy of an associated return map...

In this work the implicit function theorem is used for searching local symbolic resolution of differential equations. General results of existence for first order equations are proven and some examples, one relative to cavitation in a fluid, are developed. These examples seem to show that local approximation of non linear differential equations can give useful informations about symbolic form o...

In some fields such as Mathematics Mechanization, automated reasoning and Trustworthy Computing etc., exact results are needed. Symbolic computations are used to obtain the exact results. Symbolic computations are of high complexity. In order to improve the situation, exactly interpolating methods are often proposed for the exact results and approximate interpolating methods for the approximate...