A logical theory of concurrent objects
OOPSLA/ECOOP '90 Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications
Sequentiality in orthogonal term rewriting systems
Journal of Symbolic Computation
Parallel computation over hyperbolic groups
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Adapting a debugger for optimised programs
ACM SIGPLAN Notices
Semantic representations and query languages for or-sets
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deductive and inductive synthesis of equational programs
Journal of Symbolic Computation - Special issue on automatic programming
A logical semantics for object-oriented databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Equational inference, canonical proofs, and proof orderings
Journal of the ACM (JACM)
On the adequacy of graph rewriting for simulating term rewriting
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A fine-grained parallel completion procedure
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
IEEE Transactions on Software Engineering - Special issue on software architecture
Equivalence checking of datapaths based on canonical arithmetic expressions
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Normalizing incomplete databases
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Termination for direct sums of left-linear complete term rewriting systems
Journal of the ACM (JACM)
Chasing constrained tuple-generating dependencies
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A graph-constructive approach to solving systems of geometric constraints
ACM Transactions on Graphics (TOG)
The linear-array problem in communication complexity resolved
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Specialization of lazy functional logic programs
PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Regular path queries with constraints
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A unified computation model for functional and logic programming
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Call by need computations to root-stable form
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Toward a complete transformational toolkit for compilers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Controlling generalization and polyvariance in partial deduction of normal logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Equations as a uniform framework for partial evaluation and abstract interpretation
ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
Partial evaluation of functional logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Within ARM's reach: compilation of left-linear rewrite systems via minimal rewrite systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimizing term rewriting using discrimination nets with specialization
Proceedings of the 1999 ACM symposium on Applied computing
Specialization of inductively sequential functional logic programs
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Using production grammars in software testing
Proceedings of the 2nd conference on Domain-specific languages
Journal of the ACM (JACM)
Deriving backtracking monad transformers
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Simplifying termination proofs for rewrite systems by preprocessing
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Solving coverability problems of petri nets by partial deduction
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Graph rewrite systems for program optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constraints in computational logics
Functional and constraint logic programming
Constraints in computational logics
Solving the Word Problem for Two Classes of Non-associative Rings by Rewriting
Journal of Symbolic Computation
On the longest perpetual reductions in orthogonal expression reduction systems
Theoretical Computer Science
A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser
Information and Computation
Theoretical Computer Science - Special issue on theories of types and proofs
ViP: a visual programming language for plan execution systems
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Compiling language definitions: the ASF+SDF compiler
ACM Transactions on Programming Languages and Systems (TOPLAS)
The undecidability of the first-order theories of one step rewriting in linear canonical systems
Information and Computation
Efficient concise deterministic pattern-matching automata for ambiguous patterns
ACM SIGPLAN Notices
A unified language processing methodology
Theoretical Computer Science
A model and a first analysis of distributed-search contraction-based strategies
Annals of Mathematics and Artificial Intelligence
A taxonomy of parallel strategies for deduction
Annals of Mathematics and Artificial Intelligence
Planning Proofs of Equations in CCS
Automated Software Engineering
Journal of Automated Reasoning
Completion for Multiple Reduction Orderings
Journal of Automated Reasoning
Ordered Semantic Hyper-Linking
Journal of Automated Reasoning
Proving Consistency Assertions for Automotive Product Data Management
Journal of Automated Reasoning
Single Elementary Associative-Commutative Matching
Journal of Automated Reasoning
An Operational Approach to the Semantics of Classes: Application to Type Checking
Programming and Computing Software
Algorithms and reductions for rewriting problems. II
Information Processing Letters
Relative undecidability in term rewriting: I. the termination Hierarchy
Information and Computation
Relative undecidability in term rewriting: II. the confluence hierarchy
Information and Computation
Context-sensitive rewriting strategies
Information and Computation
Abduction in logic programming: a new definition and an abductive procedure based on rewriting
Artificial Intelligence
A component-based Petri net model for specifying and validating cooperative information systems
Data & Knowledge Engineering
Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
Cancellative abelian monoids and related structures in refutational theorem proving (Part I)
Journal of Symbolic Computation
Using Term Rewriting to Verify Software
IEEE Transactions on Software Engineering
ELAN from a rewriting logic point of view
Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Reflection in conditional rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
KJ3: a tool assisting formal validation of knowledge-based systems
International Journal of Human-Computer Studies
Incorporating decision procedures in implicit induction
Journal of Symbolic Computation - Integrated reasoning and algebra systems
Normalization, approximation, and semantics for combinator systems
Theoretical Computer Science
Fatal steps of Knuth-Bendix completion
Nordic Journal of Computing
A Partial Evaluation Framework for Curry Programs
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Regular Sets of Descendants for Constructor-Based Rewrite Systems
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
A Monotonic Higher-Order Semantic Path Ordering
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Type-Directed Partial Evaluation
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
Combining Parallel and Distributed Search in Automated Equational Deduction
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Complete Strategies for Term Graph Narrowing
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
Improving Functional Logic Programs by Difference-Lists
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
Term Rewriting in a Logic of Special Relations
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Solving the Inheritance Anomaly in Concurrent Object-Oriented Programming
ECOOP '93 Proceedings of the 7th European Conference on Object-Oriented Programming
Towards an Object Petri Nets Model for Specifying and Validating Distributed Information Systems
CAiSE '99 Proceedings of the 11th International Conference on Advanced Information Systems Engineering
Selected papers from the Eight International Workshop on Foundations of Models and Languages for Data and Objects, Transactions and Database Dynamics
A Complete Selection Function for Lazy Conditional Narrowing
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
On the Correctness of the Factoring Transformation
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
On the Completeness of Arbitrary Selection Strategies for Paramodulation
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Confluence of Untyped Lambda Calculus via Simple Types
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Analysis of Distributed-Search Contraction-Based Strategies
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Reliable Agent Computation: An Algebraic Approach
PRIMA 2001 Proceedings of the 4th Pacific Rim International Workshop on Multi-Agents, Intelligent Agents: Specification, Modeling, and Applications
Polymorphic Intersection Type Assignment for Rewrite Systems with Abstractions and beta-Rule
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
Unavoidable Configurations of Parameterized Rings of Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
On Word Rewriting Systems Having a Rational Derivation
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
On the Modularity of Deciding Call-by-Need
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
On Lexicographic Termination Ordering with Space Bound Certifications
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Improving Space, Time, and Termination in Rewriting-Based Programming
Proceedings of the 14th International conference on Industrial and engineering applications of artificial intelligence and expert systems: engineering of intelligent systems
Optimal Adaptive Pattern Matching
IEA/AIE '02 Proceedings of the 15th international conference on Industrial and engineering applications of artificial intelligence and expert systems: developments in applied artificial intelligence
Generalization in Hierarchies of Online Program Specialization Systems
LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
Improving Homeomorphic Embedding for Online Termination
LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
Automated Strategies for Specializing Constraint Logic Programs
LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
An Automatic Composition Algorithm for Functional Logic Programs
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Guaranteed Optimization: Proving Nullspace Properties of Compilers
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Test Sets for the Universal and Existential Closure of Regular Tree Languages
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Context-Sensitive AC-Rewriting
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Normalization via Rewrite Closures
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
On the Connections between Rewriting and Formal Language Theory
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Transforming Context-Sensitive Rewrite Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
A Rewrite System Associated with Quadratic Pisot Units
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Decidability for Left-Linaer Growing Term Rewriting Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Matching with Free Function Symbols - A Simple Extension of Matching?
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Termination Proofs by Context-Dependent Interpretations
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Confluence and Termination of Simply Typed Term Rewriting Systems
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
From Higher-Order to First-Order Rewriting
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
The Unification Problem for Confluent Right-Ground Term Rewriting Systems
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Recursive Derivational Length Bounds for Confluent Term Rewrite Systems
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Conditions for Efficiency Improvement by Tree Transducer Composition
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Closure Induction in a Z-Like Language
ZB '00 Proceedings of the First International Conference of B and Z Users on Formal Specification and Development in Z and B
Structured Formal Verification of a Fragment of the IBM S/390 Clock Chip
FM-Trends 98 Proceedings of the International Workshop on Current Trends in Applied Formal Method: Applied Formal Methods
Approximating the Behaviour of Graph Transformation Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
From Informal Requirements to COOP: A Concurrent Automata Approach
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Clifford Term Rewriting for Geometric Reasoning in 3D
ADG '98 Proceedings of the Second International Workshop on Automated Deduction in Geometry
Axiomatization of Finite Algebras
KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
Knowledge Discovery from Semistructured Texts
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Applying Rewriting Techniques to the Verification of Erlang Processes
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Actual Arithmetic and Feasibility
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Uniform Derivation of Decision Procedures by Superposition
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Bijections between Partitions by Two-Directional Rewriting Techniques
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Decidability of Bounded Higher-Order Unification
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Axiomatization of the Coherence Property for Categories of Symmetries
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Cooperation of Formal Methods in an Engineering Based Software Development Process
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
On the Transition Graphs of Turing Machines
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
The Psi Calculus: An Algebraic Agent Language
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
A New Rewrite Method for Convergence of Self-Stabilizing Systems
Proceedings of the 13th International Symposium on Distributed Computing
Information and Computation
On the transition graphs of Turing machines
Theoretical Computer Science
Abstracting cryptographic protocols with tree automata
Science of Computer Programming - Special issue on static analysis (SAS'99)
Handbook of automated reasoning
Completing Partial Combinatory Algebras with Unique Head-Normal Forms
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Simultaneous Rigid E-Unification and Related Algorithmic Problems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Decidability Problems for the Prenex Fragment of Intuitionistic Logic
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Decision Problems for Semi-Thue Systems with a Few Rules
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Solving linear equations over polynomial semirings
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Basic Paramodulation and Decidable Theories
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Paramodulation with Built-In Abelian Groups
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Analysing the implicit complexity of programs
Information and Computation - Special issue: ICC '99
An upper bound on the derivational complexity of Knuth--Bendix orderings
Information and Computation - Special issue: ICC '99
The order type of the collection of finite series-parallel posets
Discrete Mathematics
Homeomorphic embedding for online termination of symbolic methods
The essence of computation
A rewriting approach to satisfiability procedures
Information and Computation - RTA 2001
The unification problem for confluent right-ground term rewriting systems
Information and Computation - RTA 2001
The description logic handbook
Conditional narrowing without conditions
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Statically assuring secrecy for dynamic concurrent processes
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Term rewriting with variable binding: an initial algebra approach
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Computer algebra handbook
Interaction nets with McCarthy's amb: properties and applications
Nordic Journal of Computing
Proof theory of higher-order equations: conservativity, normal forms and term rewriting
Journal of Computer and System Sciences
Journal of Automated Reasoning
Journal of Automated Reasoning
Ground reducibility is EXPTIME-complete
Information and Computation
Right-linear half-monadic term rewrite systems
Theoretical Computer Science
Type assignment and termination of interaction nets
Mathematical Structures in Computer Science
Uniform confluence in concurrent computation
Journal of Functional Programming
Termination of rewriting in the Calculus of Constructions
Journal of Functional Programming
Higher-order narrowing with definitional trees
Journal of Functional Programming
Modularity of strong normalization in the algebraic-λ-cube
Journal of Functional Programming
Leftmost outside-in narrowing calculi
Journal of Functional Programming
Superposition with completely built-in Abelian groups
Journal of Symbolic Computation
Infinite Strings Generated by Insertions
Programming and Computing Software
Classes of term rewrite systems with polynomial confluence problems
ACM Transactions on Computational Logic (TOCL)
Efficient transformation-based parsing
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Composition of functions with accumulating parameters
Journal of Functional Programming
Chain programs for writing deterministic metainterpreters
Theory and Practice of Logic Programming
A general framework for lazy functional logic programming with algebraic polymorphic types
Theory and Practice of Logic Programming
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Formalization and abstract implementation of rewriting with nested rules
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
On confluence and residuals in Cauchy convergent transfinite rewriting
Information Processing Letters
Logic-based XPath optimization
Proceedings of the 2004 ACM symposium on Document engineering
THEORETICAL PEARL Church numerals, twice!
Journal of Functional Programming
Pattern matching as cut elimination
Theoretical Computer Science
Sound generalizations in mathematical induction
Theoretical Computer Science
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
Specialization of functional logic programs based on needed narrowing
Theory and Practice of Logic Programming
Tree automata with one memory set constraints and cryptographic protocols
Theoretical Computer Science - Automata, languages and programming
Decision problems for semi-Thue systems with a few rules
Theoretical Computer Science - Insightful theory
Nominal rewriting with name generation: abstraction vs. locality
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
E-generalization using grammars
Artificial Intelligence
Efficient pattern matching for non-strongly sequential term rewriting systems
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
Decidable first-order transition logics for PA-processes
Information and Computation
A structural approach to reversible computation
Theoretical Computer Science
Closure properties of linear context-free tree languages with an application to optimality theory
Theoretical Computer Science - Algebraic methods in language processing
Rewriting term-graphs with priority
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
On modularity in infinitary term rewriting
Information and Computation
Learnability of term rewrite systems from positive examples
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Ensuring termination by typability
Information and Computation
Deriving the type flaw attacks in the Otway-Rees protocol by rewriting
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Addressed term rewriting systems: application to a typed object calculus
Mathematical Structures in Computer Science
Logic program specialisation through partial deduction: Control issues
Theory and Practice of Logic Programming
LARS: A learning algorithm for rewriting systems
Machine Learning
System F with type equality coercions
TLDI '07 Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation
Normalisation for higher-order calculi with explicit substitutions
Theoretical Computer Science - Foundations of software science and computation structures
Efficient theory combination via boolean search
Information and Computation - Special issue: Combining logical systems
Query rewriting with symmetric constraints
AI Communications
The Ground Tree Transducer Game with Identical Tree Automata
Fundamenta Informaticae
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
Proving termination of context-sensitive rewriting by transformation
Information and Computation
Deciding knowledge in security protocols under equational theories
Theoretical Computer Science - Automated reasoning for security protocol analysis
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Recycling computed answers in rewrite systems for abduction
ACM Transactions on Computational Logic (TOCL)
A Rewriting Framework for Rule-Based Programming Dynamic Applications
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Intruder deduction for the equational theory of Abelian groups with distributive encryption
Information and Computation
A new generic scheme for functional logic programming with constraints
Higher-Order and Symbolic Computation
Structures for Abstract Rewriting
Journal of Automated Reasoning
Design patterns for library optimization
Scientific Programming - POOSC '01 Workshop
A Component-Based Systems Development Approach
Journal of Integrated Design & Process Science
Fundamental study: Tree algebras and varieties of tree languages
Theoretical Computer Science
Information and Computation
Distillation: extracting the essence of programs
Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Lazy Context Cloning for Non-Deterministic Graph Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Inductive Synthesis of Functional Programs: An Explanation Based Generalization Approach
The Journal of Machine Learning Research
Using production grammars in software testing
DSL'99 Proceedings of the 2nd conference on Conference on Domain-Specific Languages - Volume 2
An Account of Implementing Applicative Term Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Monitoring conversational web services
2nd international workshop on Service oriented software engineering: in conjunction with the 6th ESEC/FSE joint meeting
Distilling Programs for Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
Hierarchical combination of intruder theories
Information and Computation
Symbolic protocol analysis for monoidal equational theories
Information and Computation
Algebraic Stuttering Simulations
Electronic Notes in Theoretical Computer Science (ENTCS)
Developments from enquiries into the learnability of the pattern languages from positive data
Theoretical Computer Science
A framework for the verification of infinite-state graph transformation systems
Information and Computation
Call pattern analysis for functional logic programs
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Theoretical Computer Science
A Note on Rewriting Proofs and Fibonacci Numbers
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
On the Normalization and Unique Normalization Properties of Term Rewrite Systems
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Automatic Decidability and Combinability Revisited
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Combining Algorithms for Deciding Knowledge in Security Protocols
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Towards an Automatic Analysis of Web Service Security
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Certification of Automated Termination Proofs
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
The Temporal Logic of Rewriting: A Gentle Introduction
Concurrency, Graphs and Models
Modular Termination of Basic Narrowing
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Finer Is Better: Abstraction Refinement for Rewriting Approximations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Canonical Inference for Implicational Systems
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Automated Induction with Constrained Tree Automata
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Certifying a Termination Criterion Based on Graphs, without Graphs
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
FLIC: Application to Caching of a Dynamic Dependency Analysis for a 3D Oriented CRS
Electronic Notes in Theoretical Computer Science (ENTCS)
SMELS: Satisfiability Modulo Equality with Lazy Superposition
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Spatial Organization of the Chemical Paradigm and the Specification of Autonomic Systems
Software-Intensive Systems and New Computing Paradigms
Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
Logic-Based Program Synthesis and Transformation
Simultaneous checking of completeness and ground confluence for algebraic specifications
ACM Transactions on Computational Logic (TOCL)
Secrecy of cryptographic protocols under equational theory
Knowledge-Based Systems
Closure of Tree Automata Languages under Innermost Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Action Control by Term Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Type-based homeomorphic embedding for online termination
Information Processing Letters
Variant Narrowing and Equational Unification
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal to Practical Security
Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Diagrammatic Confluence and Completion
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
TAGED Approximations for Temporal Properties Model-Checking
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Analytical features: a knowledge-based approach to audio feature generation
EURASIP Journal on Audio, Speech, and Music Processing
Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Automatic case analysis in proof by induction
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Equational reasoning using AC constraints
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Unique normal forms and confluence of rewrite systems: persistence
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Termination of narrowing revisited
Theoretical Computer Science
On the equivalence between answer sets and models of completion for nested logic programs
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Recycling computed answers in rewrite systems for abduction
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Ordering-based strategies for horn clauses
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Abduction in logic programming: a new definition and an abductive procedure based on rewriting
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
E-generalization using grammars
Artificial Intelligence
Rule-based programming for integrative biological modeling
Natural Computing: an international journal
Improved Matrix Interpretation
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Formalizing and Analyzing the Needham-Schroeder Symmetric-Key Protocol by Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
A3PAT, an approach for certified automated termination proofs
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Poitín: Distilling Theorems From Conjectures
Electronic Notes in Theoretical Computer Science (ENTCS)
An Abstract Way to Define Rewriting Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Semantics of Programming Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Decidable first-order transition logics for PA-processes
Information and Computation
Remarks on Thatte's transformation of term rewriting systems
Information and Computation
On modularity in infinitary term rewriting
Information and Computation
Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures
Theoretical Computer Science
Decidability of bounded higher-order unification
Journal of Symbolic Computation
A survey of strategies in rule-based program transformation systems
Journal of Symbolic Computation
Evaluation strategies for functional logic programming
Journal of Symbolic Computation
Programming with narrowing: A tutorial
Journal of Symbolic Computation
A normalisation result for higher-order calculi with explicit substitutions
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
More efficient left-to-right pattern matching in non-sequential equational programs
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Termination of simply typed term rewriting by translation and labelling
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Rewriting modulo in deduction modulo
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Tree automata with memory, visibility and structural constraints
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
On the implementation of construction functions for non-free concrete data types
ESOP'07 Proceedings of the 16th European conference on Programming
Inductive types in the calculus of algebraic constructions
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Efficient first order functional program interpreter with time bound certifications
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Compiling and verifying security protocols
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Using an abstract representation to specialize functional logic programs
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Dynamic event-based access control as term rewriting
Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
Experience management: foundations, development methodology, and internet-based applications
Experience management: foundations, development methodology, and internet-based applications
Multi-paradigm declarative languages
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Verifying cryptographic protocols with subterms constraints
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Non strict confluent rewrite systems for data-structures with pointers
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Innermost-reachability and innermost-joinability are decidable for shallow term rewrite systems
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Normal proofs in intruder theories
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
A probabilistic applied pi-calculus
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Theorem proving modulo based on Boolean equational procedures
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
A taxonomy of theorem-proving strategies
Artificial intelligence today
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Rewrite-based verification of XML updates
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
On the confluence of lambda-calculus with conditional rewriting
Theoretical Computer Science
A compact fixpoint semantics for term rewriting systems
Theoretical Computer Science
Inductive synthesis of equational programs
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Detecting redundant production rules
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Theory-specific automated reasoning
A 25-year perspective on logic programming
CGE: a sequential learning algorithm for mealy automata
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
The linear temporal logic of rewriting Maude model checker
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Infinite families of finite string rewriting systems and their confluence
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Design guidelines for the development of quality-driven model transformations
MODELS'10 Proceedings of the 13th international conference on Model driven engineering languages and systems: Part II
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
A constraint satisfaction framework for executing perceptions and actions in diagrammatic reasoning
Journal of Artificial Intelligence Research
Expression equivalence checking using interval analysis
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Quasi-interpretations a way to control resources
Theoretical Computer Science
Canonized rewriting and ground AC completion modulo shostak theories
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
A formal library of set relations and its application to synchronous languages
Theoretical Computer Science
Course of value distinguishes the intentionality of programming languages
Proceedings of the Second Symposium on Information and Communication Technology
Fast sort computations for order-sorted matching and unification
Formal modeling
Term rewriting for access control
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Higher-order termination: from kruskal to computability
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Automatic combinability of rewriting-based satisfiability procedures
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
On the confluence of λ-calculus with conditional rewriting
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Specification and analysis of distributed object-based stochastic hybrid systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Gröbner bases: theory refinement in the mizar system
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Nelson-Oppen, shostak and the extended canonizer: a family picture with a newborn
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Declarative programming with function patterns
LOPSTR'05 Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation
Completion attacks and weak keys of oleshchuk’s public key cryptosystem
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Overlapping rules and logic variables in functional logic programs
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Tree automata with equality constraints modulo equational theories
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Complete pattern matching: recursivity versus multi-threading
VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science
Functorial semantics of rewrite theories
Formal Methods in Software and Systems Modeling
Complexity invariance of real interpretations
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
The finite variant property: how to get rid of some algebraic properties
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Intruder deduction for AC-like equational theories with homomorphisms
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Decidability of type-checking in the calculus of algebraic constructions with size annotations
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Confluence of shallow right-linear rewrite systems
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
On superposition-based satisfiability procedures and their combination
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Solving partial order constraints for LPO termination
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
On the correctness of bubbling
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Hierarchical combination of intruder theories
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Higher-order orderings for normal rewriting
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
The confluence problem for flat TRSs
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Higher-Order rewriting: framework, confluence and termination
Processes, Terms and Cycles
Axiomatic rewriting theory i: a diagrammatic standardization theorem
Processes, Terms and Cycles
A decision procedure for monotone functions over bounded and complete lattices
TARSKI'02-05 Proceedings of the 2006 international conference on Theory and Applications of Relational Structures as Knowledge Instruments - Volume 2
Extracting the essence of distillation
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
Verification and analysis of organisational change
AAMAS'05 Proceedings of the 2005 international conference on Agents, Norms and Institutions for Regulated Multi-Agent Systems
Decidability and Combination Results for Two Notions of Knowledge in Security Protocols
Journal of Automated Reasoning
Checking the consistency of UML class diagrams using larch prover
ROOM'00 Proceedings of the 2000 international conference on Rigorous Object-Oriented Methods
Rewriting approximations for properties verification over CCS specifications
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Lazy narrowing with simplification
Computer Languages
POST'12 Proceedings of the First international conference on Principles of Security and Trust
On Explicit Substitution with Names
Journal of Automated Reasoning
Proving the correctness of unfold/fold program transformations using bisimulation
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
From linear temporal logic properties to rewrite propositions
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
A Rewriting Framework for Rule-Based Programming Dynamic Applications
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
The Ground Tree Transducer Game with Identical Tree Automata
Fundamenta Informaticae
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
Thue Specifications and Their Monadic Second-order Properties
Fundamenta Informaticae
Automated Deduction Techniques for Studying Rough Algebras
Fundamenta Informaticae
Formalising Abilities and Opportunities of Agents
Fundamenta Informaticae
The Ground Tree Transducer Game
Fundamenta Informaticae
Rule-Based Constraint Programming
Fundamenta Informaticae
The ζ-Semantics: A Comprehensive Semantics for Functional Programs
Fundamenta Informaticae
UNIFICATION MODULO ACI + 1 + 0
Fundamenta Informaticae
RANK 2 INTERSECTION TYPE ASSIGNMENT IN TERM REWRITING SYSTEMS
Fundamenta Informaticae
EQUATIONAL TERM GRAPH REWRITING
Fundamenta Informaticae
Rewriting Computation and Proof
Narrowing, abstraction and constraints for proving properties of reduction relations
Rewriting Computation and Proof
Computability closure: ten years later
Rewriting Computation and Proof
Deducibility constraints, equational theory and electronic money
Rewriting Computation and Proof
Applying a theorem prover to the verification of optimistic replication algorithms
Rewriting Computation and Proof
Modeling permutations in CoQ for COCCINELLE
Rewriting Computation and Proof
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
From diagrammatic confluence to modularity
Theoretical Computer Science
A rule-based framework for building superposition-based decision procedures
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
An incremental learning algorithm for extended mealy automata
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Paramodulation with Non-Monotonic Orderings and Simplification
Journal of Automated Reasoning
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems
Fundamenta Informaticae
Simplification Orderings: History Of Results
Fundamenta Informaticae
Contextual Rewriting In Automated Reasoning
Fundamenta Informaticae
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
Learnability of term rewrite systems from positive examples
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
SMELS: Satisfiability Modulo Equality with Lazy Superposition
Journal of Automated Reasoning
Semantic Types and Approximation for Featherweight Java
Theoretical Computer Science
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting
Fundamenta Informaticae
| Hi-index | 0.02 |