Results 1 - 10 of 2,863

On-the-Fly Analysis of Distributed Computations

by Eddy Fromentin , Claude Jard, Guy-Vincent Jourdan, Michel Raynal , 1995
"... At some abstraction level a distributed computation can be modeled as a partial order on a set of observable events. This paper presents an analysis technique which can be superimposed on distributed computations to analyze the structure of control flows terminating at observable events. A general ..."
Abstract - Cited by 5 (2 self) - Add to MetaCart
At some abstraction level a distributed computation can be modeled as a partial order on a set of observable events. This paper presents an analysis technique which can be superimposed on distributed computations to analyze the structure of control flows terminating at observable events. A general

Efficient On-the-fly Analysis of Program Behavior and Static Cache Simulation

by Frank Mueller, David B. Whalley - In Static Analysis Symposium , 1994
"... . The main contributions of this paper are twofold. First, a general framework for control-flow partitioning is presented for efficient on-the-fly analysis, i.e. for program behavior analysis during execution using a small number of instrumentation points. The formal model is further refined for cer ..."
Abstract - Cited by 11 (8 self) - Add to MetaCart
. The main contributions of this paper are twofold. First, a general framework for control-flow partitioning is presented for efficient on-the-fly analysis, i.e. for program behavior analysis during execution using a small number of instrumentation points. The formal model is further refined

On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels

by Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson - In CAV'98. LNCS 1427 , 1998
"... . We consider symbolic on-the-fly verification methods for systems of finite-state machines that communicate by exchanging messages via unbounded and lossy FIFO queues. We propose a novel representation formalism, called simple regular expressions (SREs), for representing sets of states of proto ..."
Abstract - Cited by 77 (19 self) - Add to MetaCart
. We consider symbolic on-the-fly verification methods for systems of finite-state machines that communicate by exchanging messages via unbounded and lossy FIFO queues. We propose a novel representation formalism, called simple regular expressions (SREs), for representing sets of states

On-the-fly Detection of the First Races in Programs with Nested Parallelism

by Yong-Kee Jun, Charles E. McDowell - 2nd Int'l Conf. on Parallel and Distributed Processing Technique and Application, CSREA , 1996
"... Detecting races is important for debugging shared-memory parallel programs, because the races result in unintended nondeterministic executions of the programs. Previous on-the-fly techniques to detect races in programs with nested parallelism cannot guarantee that the race detected first is not ..."
Abstract - Cited by 6 (6 self) - Add to MetaCart
: parallel programming, debugging, on-the-fly analysis, race detection, effectiveness 1 Int...

Space-efficient On-the-fly Race Detection for Programs with Nested Parallelism

by Dong-Gook Kim And, Dong-gook Kim, Yong-kee Jun - 1st Int'l Conf. on Parallel and Distributed Systems (Euro-PDS'97), IASTED , 1997
"... Detecting races is important for debugging sharedmemory parallel programs, because the races result in unintended nondeterministic executions of the programs. Previous monitoring techniques for on-the-fly race detection show serious space overhead. This paper presents a new technique for on-the-fly ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
phase. This technique, therefore, makes on-the-fly race detection more practical in debugging a large class of parallel programs. Keywords: parallel programming, debugging, race detection, on-the-fly analysis, sequential monitoring, space complexity 1 Introduction Parallel processing can

Scalable On-the-fly Detection of the First Races in Parallel Programs

by Jeong-si Kim, Yong-Kee Jun - In Proceedings of the 12th ACM Int. Conf. on Supercomputing , 1998
"... Detecting races is important for debugging shared-memory parallel programs, because the races result in unintended nondeterministic executions of the programs. Most on-thefly techniques to detect the races cause the central bottlenecks of serializing all accesses of each thread to a shared variable. ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
. The amount of such bottlenecks can be reduced in case of detecting the first races that may cause the other races. This paper presents a new scalable on-the-fly technique which reduces the central bottlenecks to serializing at most two accesses of each thread to a shared variable for detecting the first

On-The-Fly Detection of Access Anomalies

by Edith Schonberg - In Proceedings of the SIGPLAN 1989 Conference on Programming Language Design and Implementation , 1998
"... Access anomalies are a common class of bugs in shared-memory parallel programs. An access anomaly occurs when two concurrent execution threads both write (or one thread reads and the other writes) the same shared memory location. Approaches to the detection of access anomalies include static analysi ..."
Abstract - Cited by 74 (0 self) - Add to MetaCart
analysis, post-mortem trace analysis, and onthe -fly monitoring. A general on-the-fly algorithm for access anomaly detection is presented, which can be applied to programs with both nested fork-join and synchronization operations. The advantage of on-the-fly detection over post-mortem analysis

On-The-Fly Clause Improvement?

by Hyojung Han, Fabio Somenzi
"... Abstract. Most current propositional SAT solvers apply resolution at various stages to derive new clauses or simplify existing ones. The former happens during conict analysis, while the latter is usually done during preprocessing. We show how subsumption of the operands by the resolvent can be inexp ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
be inexpensively detected during resolution; we then show how this detection is used to improve three stages of the SAT solver: variable elimination, clause distillation, and conict analysis. The on-the-y subsumption check is easily integrated in a SAT solver. In par-ticular, it is compatible with the strong

Token flow control

by Amit Kumar, et al.
"... As companies move towards many-core chips, an efficient onchip communication fabric to connect these cores assumes critical importance. To address limitations to wire delay scalability and increasing bandwidth demands, state-of-the-art on-chip networks use a modular packet-switched design with route ..."
Abstract - Cited by 635 (35 self) - Add to MetaCart
As companies move towards many-core chips, an efficient onchip communication fabric to connect these cores assumes critical importance. To address limitations to wire delay scalability and increasing bandwidth demands, state-of-the-art on-chip networks use a modular packet-switched design

On-The-Fly Model Checking of RCTL Formulas

by Ilan Beer, Shoham Ben-david, Avner Landver, Avner L - In Proc. 10 th International Conference on Computer Aided Verification (CAV’98), LNCS 1427 , 1998
"... The specification language RCTL, an extension of CTL, is defined by adding the power of regular expressions to CTL. In addition to being a more expressive and natural hardware specification language than CTL, a large family of RCTL formulas can be verified on-the-fly (during symbolic reachability ..."
Abstract - Cited by 48 (15 self) - Add to MetaCart
reachability analysis). On-the-fly model checking, as a powerful verification paradigm, is especially efficient when the specification is false and extremely efficient when the computation needed to get to a failing state is short. It is suitable for the inherently gradual design process since it detects a
Results 1 - 10 of 2,863