Results 1  10
of
129
From Stack Traces to Lazy Rewriting Sequences EXTENDED ABSTRACT
"... Debugging lazy functional programs poses serious challenges. Due to the complicated nature of lazy evaluation, some debugging tools abandon laziness altogether. Other debuggers preserve laziness but present it in a way that may confuse programmers because the focus of evaluation jumps around in a se ..."
Abstract
 Add to MetaCart
as a useful tool for novice programmers and programmers new to lazy programming. Mathematically speaking, our stepper renders lazy computations as the standard rewriting sequences of a program rewriting system. Our lazy semantics introduces lazy evaluation as a form of parallel program rewriting
Compact Normalisation Trace via Lazy Rewriting
, 2001
"... Innermost strategies are usually used in compiling term rewriting systems (TRSs) since they allow to eciently build result terms in a bottomup fashion. However, innermost strategies do not always give the shortest normalising derivation. In many cases, using an appropriate laziness annotation on th ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
and to extract lazy derivations in the original TRS from normalising derivations in the transformed TRS. We apply our result to improve the eciency of equational reasoning in the Coq proof assistant using ELAN as an external rewriting engine.
All from one, one for all: on model checking using representatives
 LNCS
, 1993
"... Checking that a given finite state program satisfies a linear temporal logic property is suffering in many cases from a severe space and time explosion. One way to cope with this is to reduce the state graph used for model checking. We define an equivalence relation between infinite sequences, based ..."
Abstract

Cited by 184 (6 self)
 Add to MetaCart
Checking that a given finite state program satisfies a linear temporal logic property is suffering in many cases from a severe space and time explosion. One way to cope with this is to reduce the state graph used for model checking. We define an equivalence relation between infinite sequences
A Binary Rewriting Defense against Stack Based Overflow attacks
 In Proceedings of the USENIX Annual Technical Conference
, 2003
"... Buffer overflow attack is the most common and arguably the most dangerous attack method used in Internet security breach incidents reported in the public literature. Various solutions have been developed to address the buffer overflow vulnerability problem in both research and commercial communities ..."
Abstract

Cited by 65 (1 self)
 Add to MetaCart
, there are scenarios in which it is not feasible, e.g., legacy applications that are purchased from an outside vendor. The work reported in this paper explores application of static binary translation to protect Internet software from buffer overflow attacks. Specifically, we use a binary rewriting approach to augment
LRU stack processing
 IBM JOURNAL OF RESEARCH AND DEVELOPMENT
, 1975
"... Stack processing, and in particular stack processing for the least recently used replacement algorithms, may present computational problems when it is applied to a sequence of page references with many different pages. This paper describes a new technique for LRU stack processing that permits ef ..."
Abstract

Cited by 41 (0 self)
 Add to MetaCart
efficient processing of these sequences. An analysis of the algorithm and a comparison of its running times with those of the conventional stack processing algorithms are presented. Finally we discuss a multipass implementation, which was found necessary to process trace data from a large data base system.
Infinitary Rewriting and Cyclic Graphs
 Electronic Notes in Theoretical Computer Science
, 1995
"... Infinitary rewriting allows infinitely large terms and infinitely long reduction sequences. There are two computational motivations for studying these: the infinite data structures implicit in lazy functional programming, and the use of rewriting of possibly cyclic graphs as an implementation techni ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Infinitary rewriting allows infinitely large terms and infinitely long reduction sequences. There are two computational motivations for studying these: the infinite data structures implicit in lazy functional programming, and the use of rewriting of possibly cyclic graphs as an implementation
Infinitary rewriting  Theory and Applications
, 2009
"... Infinitary rewriting generalises usual finitary rewriting by providing infinite reduction sequences with a notion of convergence. The idea of – at least conceptually – assigning a meaning to infinite derivations is wellknown, for example, from lazy functional programming or from process calculi. In ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Infinitary rewriting generalises usual finitary rewriting by providing infinite reduction sequences with a notion of convergence. The idea of – at least conceptually – assigning a meaning to infinite derivations is wellknown, for example, from lazy functional programming or from process calculi
A Binary Rewriting Defense against Stack based Buffer Overflow Attacks
"... Buffer overflow attack is the most common and arguably the most dangerous attack method used in Internet security breach incidents reported in the public literature. Various solutions have been developed to address the buffer overflow vulnerability problem in both research and commercial communities ..."
Abstract
 Add to MetaCart
, there are scenarios in which it is not feasible, e.g., legacy applications that are purchased from an outside vendor. The work reported in this paper explores application of static binary translation to protect Internet software from buffer overflow attacks. Specifically, we use a binary rewriting approach to augment
Evaluation Strategies for Term Rewriting Systems
, 2002
"... Term rewriting systems are widely used in computer science as a model of computation to relate syntax and semantics. In order to implement term rewriting system we need to use a strategy since there are many reduction sequences from a term in general. A strategy chooses one from such sequences. It i ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Term rewriting systems are widely used in computer science as a model of computation to relate syntax and semantics. In order to implement term rewriting system we need to use a strategy since there are many reduction sequences from a term in general. A strategy chooses one from such sequences
An Overview of Median and Stack Filtering
 Circuits, Systems, and Signal Processing, Special issue on Median and Morphological Filtering
, 1992
"... Abstract. Within the last two decades a small group of researchers has built a useful, nontrivial theory of nonlinear signal processing around the medianrelated filters known as rankorder filters, orderstatistic filters, weighted median filters, and stack filters. This required significant effort ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
effort to overcome the bias, both in education and research, toward linear theory, which has been dominant since the days of Fourier, Laplace, and "Convolute." We trace the development of this theory of nonlinear filtering from its beginnings in the study of noiseremoval properties
Results 1  10
of
129