Results 1 - 10 of 468

DBridge: A program rewrite tool for set-oriented query execution (demo

by Mahendra Chavan, Ravindra Guravannavar, Karthik Ramach, S. Sudarshan - In ICDE , 2011
"... Abstract—We present DBridge, a novel static analysis and program transformation tool to optimize database access. Traditionally, rewrite of queries and programs are done independently, by the database query optimzier and the language compiler respectively, leaving out many optimization opportunities ..."
Abstract - Cited by 5 (5 self) - Add to MetaCart
Abstract—We present DBridge, a novel static analysis and program transformation tool to optimize database access. Traditionally, rewrite of queries and programs are done independently, by the database query optimzier and the language compiler respectively, leaving out many optimization

Eraser: a dynamic data race detector for multithreaded programs

by Stefan Savage, Michael Burrows, Greg Nelson, Patrick Sobalvarro, Thomas Anderson - ACM Transaction of Computer System , 1997
"... Multi-threaded programming is difficult and error prone. It is easy to make a mistake in synchronization that produces a data race, yet it can be extremely hard to locate this mistake during debugging. This paper describes a new tool, called Eraser, for dynamically detecting data races in lock-based ..."
Abstract - Cited by 688 (2 self) - Add to MetaCart
Multi-threaded programming is difficult and error prone. It is easy to make a mistake in synchronization that produces a data race, yet it can be extremely hard to locate this mistake during debugging. This paper describes a new tool, called Eraser, for dynamically detecting data races in lock

Extensible Syntax with Lexical Scoping

by Luca Cardelli, Florian Matthes, Martín Abadi , 1994
"... A frequent dilemma in programming language design is the choice between a language with a rich set of notations and a small, simple core language. We address this dilemma by proposing extensible grammars, a syntax-definition formalism for incremental language extensions and restrictions. The transla ..."
Abstract - Cited by 48 (0 self) - Add to MetaCart
. The translation of programs written in rich object languages into a small core language is defined via syntax-directed patterns. In contrast to macroexpansion and program-rewriting tools, our extensible grammars respect scoping rules. Therefore, we can introduce binding constructs while avoiding problems

Extensible grammars for language specialization

by Luca Cardelli, Florian Matthes, Martin Abadi - IN PROCEEDINGS OF THE FOURTH INTERNATIONAL WORKSHOP ON DATABASE PROGRAMMING LANGUAGES , 1993
"... A frequent dilemma in the design of a database programming language is the choice between a language with a rich set of tailored notations for schema definitions, query expressions, etc., and a small, simple core language. We address this dilemma by proposing extensible grammars, a syntax-definition ..."
Abstract - Cited by 13 (2 self) - Add to MetaCart
-definition formalism for incremental language extensions and restrictions based on an initial core language. The translation of programs written in rich object languages into a small core language is defined via syntax-directed patterns. In contrast to macro-expansion and program-rewriting tools, our extensible

Monitoring Programs using Rewriting

by Klaus Havelund Kestrel, Klaus Havelund, Kestrel Technology, Grigore Rosu - In Proceedings, International Conference on Automated Software Engineering (ASE’01 , 2001
"... We present a rewriting algorithm for efficiently testing future time Linear Temporal Logic (LTL) formulae on finite execution traces. The standard models of LTL are infinite traces, reflecting the behavior of reactive and concurrent systems which conceptually may be continuously alive. In most past ..."
Abstract - Add to MetaCart
these experiments. The work constitutes part of the Java PathExplorer (JPAX) project, the purpose of which is to develop a flexible tool for monitoring Java program executions.

Optimix - A Tool For Rewriting And Optimizing Programs

by Uwe Aßmann - Handbook of Graph Grammars and Computing by Graph Transformation. Volume 2: Applications, Languages and Tools , 1998
"... This paper explains the advantages of the Optimix specification language for compiler writers and demonstrates that Optimix can be applied to three major problem classes of program rewriting: graph reachability problems, context-sensitive pattern match problems, and mark/transform problems ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
This paper explains the advantages of the Optimix specification language for compiler writers and demonstrates that Optimix can be applied to three major problem classes of program rewriting: graph reachability problems, context-sensitive pattern match problems, and mark/transform problems

Visual Programming with Graph Rewriting Systems

by A. Schürr, A. Winter, A. Zündorf - In 11th IEEE Symp. on Visual Languages , 1995
"... The multi-paradigm language PROGRES is the first rule-oriented visual language which has a well-defined type concept and supports programming with graph rewriting systems. To some extent, it has the flavor of a visual database programming language with powerful pattern matching and replacing facilit ..."
Abstract - Cited by 21 (4 self) - Add to MetaCart
The multi-paradigm language PROGRES is the first rule-oriented visual language which has a well-defined type concept and supports programming with graph rewriting systems. To some extent, it has the flavor of a visual database programming language with powerful pattern matching and replacing

Combining Rewrite Tools for Equational Logic Programming

by Sébastien Limet, Frédéric Saubion , 1996
"... Introducing equality into standard Horn clauses leads to a programming paradigm known as Equational Logic Programming. We propose here a scheme for the evaluation of such equational logic programs combining two powerful operational techniques: directed narrowing for the equational part and linear co ..."
Abstract - Add to MetaCart
Introducing equality into standard Horn clauses leads to a programming paradigm known as Equational Logic Programming. We propose here a scheme for the evaluation of such equational logic programs combining two powerful operational techniques: directed narrowing for the equational part and linear

PROVING TERMINATION WITH MULTISET ORDERINGS

by Nachum Dershowitz , Zohar Manna
"... A common tool for proving the termination of programs is the well-founded set, a set ordered in such a way as to admit no infinite descending sequences. The basic approach is to find a termination function that maps the values of the program variables into some well-founded set, such that the value ..."
Abstract - Cited by 223 (12 self) - Add to MetaCart
A common tool for proving the termination of programs is the well-founded set, a set ordered in such a way as to admit no infinite descending sequences. The basic approach is to find a termination function that maps the values of the program variables into some well-founded set, such that the value

Rapid Programming with Graph Rewrite Rules

by Andy Schürr , 1994
"... Graphs play an important role within many areas of computer science and rule-based languages are more and more used to describe complex transformation or inference processes. Nevertheless, their combination in the form of graph rewriting systems were more or less unknown among computer scientists fo ..."
Abstract - Cited by 7 (2 self) - Add to MetaCart
and programming language and combines the advantages of attributed (graph) grammars with rule-oriented as well as imperative programming. An integrated set of tools supports editing, analyzing, and debugging of applications as well as translation into procedural programming languages (C, Modula-2).
Results 1 - 10 of 468