Results 1  10
of
741,974
Complete symbolic reachability analysis using backandforth narrowing
 In International Conference on Algebra and Coalgebra in Computer Science
, 2005
"... Abstract. We propose a method called backandforth narrowing for solving reachability goals of the form ( ∃ − → x).t1 → ∗ t ′ 1 ∧... ∧ tn → ∗ t ′ n in general term rewrite systems. The method is a complete semidecision procedure in the sense that it is guaranteed to find a solution when one exis ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
variables in the righthand side. Such generality is often essential while modeling concurrent systems or axiomatizing inference systems as rewrite rules, and in such applications backandforth narrowing can be used as a sound and complete technique for symbolic reachability analysis or as a deductive procedure for proving
Complete Symbolic Reachability Analysis Using BackandForth Narrowing
"... 1 Introduction A concurrent or an inference system can be naturally expressed as a rewrite systemR = ( \Sigma, R), where \Sigma is a signature and R is a collection of rewrite rules. For a concurrentsystem terms represent states, and a rewrite rule ..."
Abstract
 Add to MetaCart
1 Introduction A concurrent or an inference system can be naturally expressed as a rewrite systemR = ( \Sigma, R), where \Sigma is a signature and R is a collection of rewrite rules. For a concurrentsystem terms represent states, and a rewrite rule
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 574 (50 self)
 Add to MetaCart
in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a calculus on computation trees over realnumbered time. Unfortunately
COUNTING THE BACKANDFORTH TYPES
, 2010
"... Given a class of structures K and n ∈ ω, we study the dichotomy between there being countably many nbackandforth equivalence classes and there being continuum many. In the latter case we show that, relative to some oracle, every set can be weakly coded in the (n − 1)st jump of some structure in ..."
Abstract
 Add to MetaCart
Given a class of structures K and n ∈ ω, we study the dichotomy between there being countably many nbackandforth equivalence classes and there being continuum many. In the latter case we show that, relative to some oracle, every set can be weakly coded in the (n − 1)st jump of some structure
Culture in action: Symbols and strategies
 American Sociological Review
, 1986
"... Culture influences action not by providing the ultimate values toward which action is oriented, but by shaping a repertoire or "tool kit " of habits, skills, and styles from which people construct "strategies of action. " Two models of cultural influence are developed, for settle ..."
Abstract

Cited by 455 (0 self)
 Add to MetaCart
determine which among competing ideologies survive in the long run. This alternative view of culture offers new opportunities for systematic, differentiated arguments about culture's causal role in shaping action. The reigning model used to understand culture's effects on action is fundamentally
Reachability Analysis of Pushdown Automata: Application to ModelChecking
, 1997
"... We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like mode ..."
Abstract

Cited by 385 (39 self)
 Add to MetaCart
We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like
Convex Analysis
, 1970
"... In this book we aim to present, in a unified framework, a broad spectrum of mathematical theory that has grown in connection with the study of problems of optimization, equilibrium, control, and stability of linear and nonlinear systems. The title Variational Analysis reflects this breadth. For a lo ..."
Abstract

Cited by 5350 (67 self)
 Add to MetaCart
In this book we aim to present, in a unified framework, a broad spectrum of mathematical theory that has grown in connection with the study of problems of optimization, equilibrium, control, and stability of linear and nonlinear systems. The title Variational Analysis reflects this breadth. For a
Opportunistic Beamforming Using Dumb Antennas
 IEEE Transactions on Information Theory
, 2002
"... Multiuser diversity is a form of diversity inherent in a wireless network, provided by independent timevarying channels across the different users. The diversity benefit is exploited by tracking the channel fluctuations of the users and scheduling transmissions to users when their instantaneous cha ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
channel quality is near the peak. The diversity gain increases with the dynamic range of the fluctuations and is thus limited in environments with little scattering and/or slow fading. In such environments, we propose the use of multiple transmit antennas to induce large and fast channel fluctuations so
A Practical Guide to Wavelet Analysis
, 1998
"... A practical stepbystep guide to wavelet analysis is given, with examples taken from time series of the El Nio Southern Oscillation (ENSO). The guide includes a comparison to the windowed Fourier transform, the choice of an appropriate wavelet basis function, edge effects due to finitelength t ..."
Abstract

Cited by 833 (3 self)
 Add to MetaCart
intervals. It is shown that smoothing in time or scale can be used to increase the confidence of the wavelet spectrum. Empirical formulas are given for the effect of smoothing on significance levels and confidence intervals. Extensions to wavelet analysis such as filtering, the power Hovmller, cross
Interprocedural Slicing Using Dependence Graphs
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1990
"... ... This paper concerns the problem of interprocedural slicinggenerating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends previou ..."
Abstract

Cited by 822 (85 self)
 Add to MetaCart
previous dependence representations to incorporate collections of procedures (with procedure calls) rather than just monolithic programs. Our main result is an algorithm for interprocedural slicing that uses the new representation. (It should be noted that our work concerns a somewhat restricted kind
Results 1  10
of
741,974