Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Transformational program development in a particular problem domain
Science of Computer Programming
Deriving sequential and parallel programs from pure LISP specifications by program transformation
The IFIP TC2/WG 2.1 Working Conference on Program specification and transformation
The synthesizer generator: a system for constructing language-based editors
The synthesizer generator: a system for constructing language-based editors
Design, implementation and evaluation of the FNC-2 attribute grammar system
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Functional programming with bananas, lenses, envelopes and barbed wire
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Sharlit—a tool for building optimizers
PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
More efficient bottom-up multi-pattern matching in trees
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Engineering a simple, efficient code-generator generator
ACM Letters on Programming Languages and Systems (LOPLAS)
Towards increased productivity of algorithm implementation
SIGSOFT '93 Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering
Relational program derivation and context-free language recognition
A classical mind
Science of Computer Programming
Future directions in program transformations
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
From regular expressions to DFA's using compressed NFA's
Theoretical Computer Science
An approach for exploring code improving transformations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modern compiler implementation in Java
Modern compiler implementation in Java
Advanced compiler design and implementation
Advanced compiler design and implementation
Building program optimizers with rewriting strategies
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Fast Algorithms for Solving Path Problems
Journal of the ACM (JACM)
Finite Differencing of Computable Expressions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving correctness of compiler optimizations by temporal logic
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Data Flow Analysis as Model Checking
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
DFA&OPT-METAFrame: A Tool Kit for Program Analysis and Optimazation
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Proceedings of the 2nd CCHSC Workshop on Compiler Compilers and High Speed Compilation
How to Uniformly Specify Program Analysis and Transformation with Graph Rewrite Systems
CC '96 Proceedings of the 6th International Conference on Compiler Construction
Viewing A Program Transformation System At Work
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
UnQL: a query language and algebra for semistructured data based on structural recursion
The VLDB Journal — The International Journal on Very Large Data Bases
KHEPERA: a system for rapid implementation of domain specific languages
DSL'97 Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997
Transforming the .NET intermediate language using path logic programming
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Proceedings of the 2nd international conference on Aspect-oriented software development
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
From datalog rules to efficient programs with time and space guarantees
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Iterative-free program analysis
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Incremental execution of transformation specifications
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parametric regular path queries
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
JunGL: a scripting language for refactoring
Proceedings of the 28th international conference on Software engineering
Scripting refactorings with JunGL
Companion to the 21st ACM SIGPLAN symposium on Object-oriented programming systems, languages, and applications
Write it recursively: a generic framework for optimal path queries
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
DeFacto: Language-Parametric Fact Extraction from Source Code
Software Language Engineering
Extending SPARQL with regular expression patterns (for querying RDF)
Web Semantics: Science, Services and Agents on the World Wide Web
From datalog rules to efficient programs with time and space guarantees
ACM Transactions on Programming Languages and Systems (TOPLAS)
The semantics of "semantic patches" in Coccinelle: program transformation for the working programmer
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
CTL as an intermediate language
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Graph queries through datalog optimizations
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
Parameterized regular expressions and their languages
Theoretical Computer Science
| Hi-index | 0.00 |
Given are a directed edge-labelled graph G with a distinguished node n0, and a regular expression P which may contain variables. We wish to compute all substitutions φ (of symbols for variables), together with all nodes n such that all paths n0 → n are in φ(P). We derive an algorithm for this problem using relational algebra, and show how it may be implemented in Prolog. The motivation for the problem derives from a declarative framework for specifying compiler optimisations.