Results 1  10
of
1,313
A Compositional Approach to Performance Modelling
, 1996
"... Performance modelling is concerned with the capture and analysis of the dynamic behaviour of computer and communication systems. The size and complexity of many modern systems result in large, complex models. A compositional approach decomposes the system into subsystems that are smaller and more ea ..."
Abstract

Cited by 746 (102 self)
 Add to MetaCart
. These techniques are presented in terms of notions of equivalence between modelling entities. A framewo...
ContextSensitive TermRewriting
, 2008
"... At first an introduction to contextsensitive rewritesystems is given. The main part of this paper deals with the topic how one can prove termination of contextsensitive rewritesystems. This can be done either by either transforming them into non contextsensitive ones or by extending the existing ..."
Abstract
 Add to MetaCart
the existing techniques which are used to prove termination of classic rewrite systems. This is described in detail for dependency pairs. 1
Confluence of Curried TermRewriting Systems
 Journal of Symbolic Computation
, 1995
"... Reduction Systems Definition 2.2. An Abstract Reduction System (short: ARS) consists of a set A and a sequence ! i of binary relations on A, labelled by some set I. We often drop the label if I is a singleton. We write A j= P if the ARS A = (A; ! i ; : : : ); i 2 I has the property P . Further we ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Reduction Systems Definition 2.2. An Abstract Reduction System (short: ARS) consists of a set A and a sequence ! i of binary relations on A, labelled by some set I. We often drop the label if I is a singleton. We write A j= P if the ARS A = (A; ! i ; : : : ); i 2 I has the property P . Further we write A j= P Q iff A j= P and A j= Q. An ARS A = (A; !) has the diamond property , A j= \Sigma, iff /;! ` !;/. It has the ChurchRosser property (is confluent), A j= CR, iff (A; !!) j= \Sigma. Given an ARS A = (A; !), we write CR(t) as shorthand for (fu j t !! ug; !) j= CR. 4 Stefan Kahrs Under most circumstances, confluence is a useful property of ARSs, mainly because: if (A; !) j= CR, and if two elements x; y 2 A are equivalent w.r.t. the smallest equivalence containing !, then there is a z 2 A such that x!! z //y. Roughly: the ARS decides the equivalence. An ARS A = (A; ! a ; ! b ) commutes directly , A j= CD, iff / a ; ! b ` ! b ; / a . To prove confluence of an ARS, it is sometimes...
Software unit test coverage and adequacy
 ACM Computing Surveys
, 1997
"... Objective measurement of test quality is one of the key issues in software testing. It has been a major research focus for the last two decades. Many test criteria have been proposed and studied for this purpose. Various kinds of rationales have been presented in support of one criterion or another. ..."
Abstract

Cited by 351 (8 self)
 Add to MetaCart
Objective measurement of test quality is one of the key issues in software testing. It has been a major research focus for the last two decades. Many test criteria have been proposed and studied for this purpose. Various kinds of rationales have been presented in support of one criterion or another. We survey the research work in
Logic in Computer Science: Modelling and Reasoning about Systems
, 1999
"... ion. ACM Transactions on Programming Languages and Systems, 16(5):15121542, September 1994. Bibliography 401 [Che80] B. F. Chellas. Modal Logic  an Introduction. Cambridge University Press, 1980. [Dam96] D. R. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesi ..."
Abstract

Cited by 345 (11 self)
 Add to MetaCart
ion. ACM Transactions on Programming Languages and Systems, 16(5):15121542, September 1994. Bibliography 401 [Che80] B. F. Chellas. Modal Logic  an Introduction. Cambridge University Press, 1980. [Dam96] D. R. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Institute for Programming research and Algorithmics. Eindhoven University of Technology, July 1996. [Dij76] E. W. Dijkstra. A Discipline of Programming. Prentice Hall, 1976. [DP96] R. Davies and F. Pfenning. A Modal Analysis of Staged Computation. In 23rd Annual ACM Symposium on Principles of Programming Languages. ACM Press, January 1996. [EN94] R. Elmasri and S. B. Navathe. Fundamentals of Database Systems. Benjamin/Cummings, 1994. [FHMV95] Ronald Fagin, Joseph Y. Halpern, Yoram Moses, and Moshe Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, 1995. [Fit93] M. Fitting. Basic modal logic. In D. Gabbay, C. Hogger, and J. Robinson, editors, Handbook of Logic in Artificial In...
TermRewriting Implementation of Equational Logic Programming
 In Lescanne
, 1987
"... In 1975 I started a small project to explore the consequences of implementing equational programs with no semantic compromises. Latest results include a compiler that executes exactly the logical consequences of an equational program, with runtime speed comparable to compiled Franz LISP. This paper ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In 1975 I started a small project to explore the consequences of implementing equational programs with no semantic compromises. Latest results include a compiler that executes exactly the logical consequences of an equational program, with runtime speed comparable to compiled Franz LISP. This paper describes the accomplishments of the project very briefly, concentrating on shortcomings and directions for future work. 1 Introduction The most common approach to providing semantics for programming languages is to regard a program as the definition of a collection of functions. In some cases great ingenuity is required to construct the unique function associated with each symbol in a program. Inputs and outputs are regarded as values in the domains of the defined functions, and the input/output behavior of the implementation of a program is expected to be exactly the function associated with some designated symbol in the program. I prefer, This work was supported by NSF grant DCR8601...
Simulating TermRewriting in LPF and in Display Logic
, 1997
"... . We show how the convenience and power of termrewriting can sometimes be obtained in logical systems which do not explicitly have this capability. We consider the Logic of Partial Functions, and show how an undefined term can often be rewritten to a defined term. Although LPF and Display Logic are ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. We show how the convenience and power of termrewriting can sometimes be obtained in logical systems which do not explicitly have this capability. We consider the Logic of Partial Functions, and show how an undefined term can often be rewritten to a defined term. Although LPF and Display Logic
TermRewriting Implementation of Equational Logic Programming
 In Lescanne
, 1987
"... In 1975 I started a small project to explore the consequences of implementing equational programs with no semantic compromises. Latest results include a compiler that executes exactly the logical consequences of an equational program, with runtime speed comparable to compiled Franz LISP. This paper ..."
Abstract
 Add to MetaCart
In 1975 I started a small project to explore the consequences of implementing equational programs with no semantic compromises. Latest results include a compiler that executes exactly the logical consequences of an equational program, with runtime speed comparable to compiled Franz LISP. This paper describes the accomplishments of the project very briefly, concentrating on shortcomings and directions for future work. 1 Introduction The most common approach to providing semantics for programming languages is to regard a program as the definition of a collection of functions. In some cases great ingenuity is required to construct the unique function associated with each symbol in a program. Inputs and outputs are regarded as values in the domains of the defined functions, and the input/output behavior of the implementation of a program is expected to be exactly the function associated with some designated symbol in the program. I prefer, This work was supported by NSF grant DCR8601...
Combining Algebraic Computing and TermRewriting for Geometry Theorem Proving
, 1998
"... This note reports some of our investigations on combining algebraic computing and termrewriting techniques for automated geometry theorem proving. A general approach is proposed that requires both Clifford algebraic reduction and termrewriting. Preliminary experiments for some concrete cases ha ..."
Abstract
 Add to MetaCart
This note reports some of our investigations on combining algebraic computing and termrewriting techniques for automated geometry theorem proving. A general approach is proposed that requires both Clifford algebraic reduction and termrewriting. Preliminary experiments for some concrete cases
Precise slicing in imperative programs via termrewriting and abstract interpretation
"... Abstract. We propose a new approach for producing precise constrained slices of programs in a language such as C. We build upon a previous approach for this problem, which is based on termrewriting, which primarily targets loopfree fragments and is fully precise in this setting. We incorporate abs ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
abstract interpretation into termrewriting, using a given arbitrary abstract lattice, resulting in a novel technique for slicing loops whose precision is linked to the power of the given abstract lattice. We address pointers in a firstclass manner, including when they are used within loops to traverse
Results 1  10
of
1,313