Results 1  10
of
297
Developers ask reachability questions
 In Proc. Int’l Conf. Software Eng (ICSE
, 2010
"... A reachability question is a search across feasible paths through a program for target statements matching search criteria. In three separate studies, we found that reachability questions are common and often time consuming to answer. In the first study, we observed 13 developers in the lab and foun ..."
Abstract

Cited by 30 (10 self)
 Add to MetaCart
A reachability question is a search across feasible paths through a program for target statements matching search criteria. In three separate studies, we found that reachability questions are common and often time consuming to answer. In the first study, we observed 13 developers in the lab
Answering reachability questions
, 2011
"... Software developers understanding and exploring code spend much of their time asking questions and searching for answers. Yet little has been known about the questions devel‐ opers ask, the strategies used to answer them, and the challenges developers face. Through interviews, surveys, and observat ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
of developers ’ work to design more useful tools for developers. These studies reveal that reachability questions are a central part of understanding and ex‐ ploring code. A reachability question is a search along paths through code. Developers ask reachability questions when reasoning about causality
Reachability Analysis of Dynamical Systems having PiecewiseConstant Derivatives
 Theoretical Computer Science
, 1995
"... In this paper we consider a class of hybrid systems, namely dynamical systems with piecewiseconstant derivatives (PCD systems). Such systems consist of a partition of the Euclidean space into a finite set of polyhedral sets (regions). Within each region the dynamics is defined by a constant vector ..."
Abstract

Cited by 129 (20 self)
 Add to MetaCart
field, hence discrete transitions occur only on the boundaries between regions where the trajectories change their direction. With respect to such systems we investigate the reachability question: Given an effective description of the systems and of two polyhedral subsets P and Q of the state
Semantic Reachability
 Electronic Notes in Theoretical Computer Science (ENTCS
, 1997
"... This paper is an approach to combine the reachability problem with semantic notions like bisimulation equivalence. It deals with questions of the following form: Is there a reachable state that is bisimulation equivalent to a given state ? Here we show some decidability results for process algebras ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper is an approach to combine the reachability problem with semantic notions like bisimulation equivalence. It deals with questions of the following form: Is there a reachable state that is bisimulation equivalent to a given state ? Here we show some decidability results for process algebras
Model Checking via Reachability Testing for Timed Automata
, 1997
"... In this paper we develop an approach to modelchecking for timed automata via reachability testing. As our specification formalism, we consider a densetime logic with clocks. This logic may be used to express safety and bounded liveness properties of realtime systems. We show how to automatically ..."
Abstract

Cited by 47 (13 self)
 Add to MetaCart
synthesize, for every logical formula ', a socalled test automaton T' in such a way that checking whether a system S satisfies the property ' can be reduced to a reachability question over the system obtained by making T' interact with S.
Reachability and the Power of Local Ordering
, 1994
"... The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered () structures expressible in firstorder logic augmented with the appropriate Transitive Closure operator [I87]: (FO+DTC+ ) captur ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered () structures expressible in firstorder logic augmented with the appropriate Transitive Closure operator [I87]: (FO
The Power of Reachability Testing for Timed Automata
 THEORETICAL COMPUTER SCIENCE
, 2001
"... The computational engine of the verification tool UPPAAL consists of a collection of efficient algorithms for the analysis of reachability properties of systems. Modelchecking of properties other than plain reachability ones may currently be carried out in such a tool as follows. Given a property t ..."
Abstract

Cited by 38 (11 self)
 Add to MetaCart
properties may be analyzed by UPPAAL in such a way. This paper gives an answer to this question by providing a complete characterization of the class of properties for which modelchecking can be reduced to reachability testing in the sense outlined above. This result is obtained as a corollary of a stronger
Reachability Problems: An Update
"... Abstract. There has been a great deal of progress in the fifteen years that have elapsed since Wigderson published his survey on the complexity of the graph connectivity problem [Wig92]. Most significantly, Reingold solved the longstanding question of the complexity of the st connectivity problem i ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
in undirected graphs, showing that this is complete for logspace (L) [Rei05]. This survey talk will focus on some of the remaining open questions dealing with graph reachability problems. Particular attention will be paid to these topics: – Reachability in planar directed graphs (and more generally, in graphs
Maintaining Maintainability = Recognizing Reachability
 In Proc. International Workshop on Empirical Studies of Software Maintenance
, 2000
"... How do we assess the maintainablilty of our systems? Given the infinity of parameters we could extract from our programs, what is the least we must collect to tell us the most about maintainablilty? To answer this question, we offer a ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
How do we assess the maintainablilty of our systems? Given the infinity of parameters we could extract from our programs, what is the least we must collect to tell us the most about maintainablilty? To answer this question, we offer a
Criteria for reachability of quantum states
, 2002
"... Abstract. We address the question of which quantum states can be interconverted under the action of a timedependent Hamiltonian. In particular, we consider the problem as applied to mixed states, and investigate the difference between pure and mixedstate controllability introduced in previous wor ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. We address the question of which quantum states can be interconverted under the action of a timedependent Hamiltonian. In particular, we consider the problem as applied to mixed states, and investigate the difference between pure and mixedstate controllability introduced in previous
Results 1  10
of
297