Partial evaluation of functional logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specialization of inductively sequential functional logic programs
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Operational semantics of rewriting with the on-demand evaluation strategy
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
Lazy rewriting on eager machinery
ACM Transactions on Programming Languages and Systems (TOPLAS)
Simplifying termination proofs for rewrite systems by preprocessing
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
High-level specification and efficient implementation of pipelined circuits
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Constraints and constraint solving: an introduction
Constraints in computational logics
Constraints in computational logics
Functional and constraint logic programming
Constraints in computational logics
On the longest perpetual reductions in orthogonal expression reduction systems
Theoretical Computer Science
Journal of Symbolic Computation
The regular viewpoint on PA-processes
Theoretical Computer Science
From rewrite rules to bisimulation congruences
Theoretical Computer Science
Simple termination of context-sensitive rewriting
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Modular termination of context-sensitive rewriting
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Efficient path conditions in dependence graphs
Proceedings of the 24th International Conference on Software Engineering
State space generation for the HAVi leader election protocol
Science of Computer Programming
The narrowing-driven approach to functional logic program specialization
New Generation Computing - Partial evaluation and program transformation
Annals of Mathematics and Artificial Intelligence
Formal Proofs About Rewriting Using ACL2
Annals of Mathematics and Artificial Intelligence
Ordered Semantic Hyper-Linking
Journal of Automated Reasoning
Synthesis of operation-centric hardware descriptions
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
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
Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
Bottom-up and top-down tree series transformations
Journal of Automata, Languages and Combinatorics
ELAN from a rewriting logic point of view
Theoretical Computer Science - Rewriting logic and its applications
Equational rules for rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Unions of non-disjoint theories and combinations of satisfiability procedures
Theoretical Computer Science
On the symbolic reduction of processes with cryptographic functions
Theoretical Computer Science
On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Reachability Analysis of Term Rewriting Systems with Timbuk
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Termination of Rewriting With Strategy Annotations
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Complexity of Linear Standard Theories
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Improving On-Demand Strategy Annotations
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Theorem Proving with Sequence Variables and Flexible Arity Symbols
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A Generalization of Equational Proof Theory?
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques
Proof Normalization of Structured Algebraic Specifications Is Convergent
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Complete Strategies for Term Graph Narrowing
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Automatic Optimization of Multi-paradigm Declarative Programs
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Tool-Assisted Specification and Verification of the JavaCard Platform
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
Removing Redundant Arguments of Functions
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
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
Descendants and Head Normalization of Higher-Order Rewrite Systems
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Dynamic-Cut with Definitional Trees
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Knuth-Bendix Constraint Solving Is NP-Complete
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Equivariant Syntax and Semantics
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
On the Modularity of Deciding Call-by-Need
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Proving Termination of Constraint Solver Programs
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
A Modular Approach to Proving Confluence
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Measuring the Effectiveness of Partial Evaluation in Functional Logic Languages
LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
UPV-CURRY: An Incremental CURRY Interpreter
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Transforming Context-Sensitive Rewrite Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Normalisation in Weakly Orthogonal Rewriting
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
Transfinite Rewriting Semantics for Term Rewriting Systems
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
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
Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order
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
Recursive Derivational Length Bounds for Confluent Term Rewrite Systems
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Probabilistic Rewrite Strategies. Applications to ELAN
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
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
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Equational Termination by Semantic Labelling
Proceedings of the 14th Annual Conference of the EACSL 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
Reducing Search Space in Solving Higher-Order Equations
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Formalizing Rewriting in the ACL2 Theorem Prover
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
On a Generalised Logicality Theorem
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
YACAS: A Do-It-Yourself Symbolic Algebra Environment
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Approximating Dependency Graphs Using Tree Automata Techniques
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Decidability and Complexity of Finitely Closable Linear Equational Theories
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Vampire 1.1 (System Description)
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Decidable Classes of Inductive Theorems
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Uniform Normalisation beyond Orthogonality
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
A framework for studying substitution
Acta Cybernetica
Combining word problems through rewriting in categories with products
Theoretical Computer Science - Category theory and computer science
Termination of on-demand rewriting and termination of OBJ programs
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
An implementation of narrowing strategies
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Combining superposition, sorts and splitting
Handbook of automated reasoning
A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
An upper bound on the derivational complexity of Knuth--Bendix orderings
Information and Computation - Special issue: ICC '99
Term rewriting restricted to ground terms
Theoretical Computer Science
Conditional narrowing without conditions
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
A demand-driven narrowing calculus with overlapping definitional trees
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Computer algebra handbook
Discriminative sum types locate the source of type errors
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
On reductions for the Steiner problem in graphs
Journal of Discrete Algorithms
CDiff: a new reduction technique for constraint-based analysis of security protocols
Proceedings of the 10th ACM conference on Computer and communications security
Journal of Automated Reasoning
Non-linear loop invariant generation using Gröbner bases
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Right-linear half-monadic term rewrite systems
Theoretical Computer Science
Double-pushout graph transformation revisited
Mathematical Structures in Computer Science
Extending partial combinatory algebras
Mathematical Structures in Computer Science
Journal of Functional Programming
Transparent optimisation of rewriting combinators
Journal of Functional Programming
Higher-order narrowing with definitional trees
Journal of Functional Programming
Decidability of bounded second order unification
Information and Computation
Strong and NV-sequentiality of constructor systems
Information Processing Letters
Rules + strategies for transforming lazy functional logic programs
Theoretical Computer Science
Network robustness and graph topology
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Nordic Journal of Computing
Composition of functions with accumulating parameters
Journal of Functional Programming
Type error slicing in implicitly typed higher-order languages
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Cost-Augmented Partial Evaluation of Functional Logic Programs
Higher-Order and Symbolic Computation
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming
Semantics of the reFLect language
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
A lazy narrowing calculus for declarative constraint programming
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
New completeness results for lazy conditional narrowing
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
SBCCI '04 Proceedings of the 17th symposium on Integrated circuits and system design
On confluence and residuals in Cauchy convergent transfinite rewriting
Information Processing Letters
Pattern matching as cut elimination
Theoretical Computer Science
Theoretical Computer Science
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
Constraint Solving for Proof Planning
Journal of Automated Reasoning
Model-Theoretic Methods in Combined Constraint Satisfiability
Journal of Automated Reasoning
On the Complexity of Deduction Modulo Leaf Permutative Equations
Journal of Automated Reasoning
Reachability Analysis over Term Rewriting Systems
Journal of Automated Reasoning
Foundations of semantic web databases
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Knuth--bendix constraint solving is NP-complete
ACM Transactions on Computational Logic (TOCL)
Decidable call-by-need computations in term rewriting
Information and Computation
Relaxing monotonicity for innermost termination
Information Processing Letters
On proving C ε-termination of rewriting by size-change termination
Information Processing Letters
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
Program transformation by templates based on term rewriting
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Formal validation of pattern matching code
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Fast narrowing-driven partial evaluation for inductively sequential programs
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
A language-based approach to functionally correct imperative programming
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Isomorphisms of simple inductive types through extensional rewriting
Mathematical Structures in Computer Science
Generalized algebraic data types and object-oriented programming
OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Modeling, querying and reasoning about OLAP databases: a functional approach
Proceedings of the 8th ACM international workshop on Data warehousing and OLAP
Canonization for disjoint unions of theories
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Automating the dependency pair method
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Rewriting of imperative programs into logical equations
Science of Computer Programming
Typed functional query languages with equational specifications
Proceedings of the 14th ACM international conference on Information and knowledge management
Information and Computation
Improved use of the carry-save representation for the synthesis of complex arithmetic circuits
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Advanced Topics in Term Rewriting by Enno Ohlebusch, Springer Verlag, 2002
Journal of Functional Programming
Hardware synthesis from guarded atomic actions with performance specifications
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
A structural approach to reversible computation
Theoretical Computer Science
Type inference for unique pattern matching
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Design Automation of Electronic Systems (TODAES)
The reachability and related decision problems for monadic and semi-constructor TRSs
Information Processing Letters
Cones and foci: A mechanical framework for protocol verification
Formal Methods in System Design
On modularity in infinitary term rewriting
Information and Computation
Equality of streams is a Π0 over 2-complete problem
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Abstract canonical presentations
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
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
Asynchronous games 2: the true concurrency of innocence
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Resource control for synchronous cooperative threads
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Information and Computation
Journal of Functional Programming
Addressed term rewriting systems: application to a typed object calculus
Mathematical Structures in Computer Science
Two polygraphic presentations of Petri nets
Theoretical Computer Science
Efficient path conditions in dependence graphs for software safety analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
A semantics for web services authentication
Theoretical Computer Science - Theoretical foundations of security analysis and design II
Normalisation for higher-order calculi with explicit substitutions
Theoretical Computer Science - Foundations of software science and computation structures
Theoretical Computer Science - Foundations of software science and computation structures
Information and Computation - Special issue: Combining logical systems
Polymorphic higher-order recursive path orderings
Journal of the ACM (JACM)
Forward node-selecting queries over trees
ACM Transactions on Database Systems (TODS)
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
Elimination Transformations for Associative---Commutative Rewriting Systems
Journal of Automated Reasoning
The complexity of tree automata and XPath on grammar-compressed trees
Theoretical Computer Science - Implementation and application of automata
AI Communications - CASC
Strong Normalisation of Cut-Elimination in Classical Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Proving termination of context-sensitive rewriting by transformation
Information and Computation
Ensuring the quasi-termination of needed narrowing computations
Information Processing Letters
Languages generated by iterated idempotency
Theoretical Computer Science
Applying term rewriting to partial algebra theory
Fundamenta Informaticae
Synthesis of max-plus quasi-interpretations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Removing redundant arguments automatically
Theory and Practice of Logic Programming
Forward slicing of functional logic programs by partial evaluation
Theory and Practice of Logic Programming
Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Tyrolean termination tool: Techniques and features
Information and Computation
On tree automata that certify termination of left-linear term rewriting systems
Information and Computation
Permutative rewriting and unification
Information and Computation
Intruder deduction for the equational theory of Abelian groups with distributive encryption
Information and Computation
Transition predicate abstraction and fair termination
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special issue on POPL 2005
A new generic scheme for functional logic programming with constraints
Higher-Order and Symbolic Computation
Structures for Abstract Rewriting
Journal of Automated Reasoning
Journal of Computer and System Sciences
Yago: a core of semantic knowledge
Proceedings of the 16th international conference on World Wide Web
Fundamental study: Tree algebras and varieties of tree languages
Theoretical Computer Science
Information and Computation
Modeling Pointer Redirection as Cyclic Term-graph Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Lazy Context Cloning for Non-Deterministic Graph Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Static Slicing of Rewrite Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Only the Best Can Make It: Optimal Component Selection
Electronic Notes in Theoretical Computer Science (ENTCS)
General E-unification with Eager Variable Elimination and a Nice Cycle Rule
Journal of Automated Reasoning
Electronic Notes in Theoretical Computer Science (ENTCS)
Rewrite-Based Satisfiability Procedures for Recursive Data Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Transformation for Refining Unraveled Conditional Term Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of abstract reduction systems
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Induction for positive almost sure termination
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Generalizing DPLL and satisfiability for equalities
Information and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Rewriting-Based Access Control Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
Getting Rid of Derivational Redundancy or How to Solve Kuhn's Problem
Minds and Machines
A Graphical User Interface for Formal Proofs in Geometry
Journal of Automated Reasoning
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
Journal of Automated Reasoning
Compiling with continuations, continued
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Constructing invariants for hybrid systems
Formal Methods in System Design
Electronic Notes in Theoretical Computer Science (ENTCS)
A comprehensive combination framework
ACM Transactions on Computational Logic (TOCL)
On the relationships between models in protocol verification
Information and Computation
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
ACM Transactions on Computational Logic (TOCL)
A Resolution-Based Decision Procedure for $\boldsymbol{\mathcal{SHOIQ}}$
Journal of Automated Reasoning
A rule-based approach for RNA pseudoknot prediction
International Journal of Data Mining and Bioinformatics
Deciding expressive description logics in the framework of resolution
Information and Computation
Innermost Termination of Rewrite Systems by Labeling
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of Lazy Rewriting Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
Undecidable Properties on Length-Two String Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Symbolic Computation
Call pattern analysis for functional logic programs
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
A rewriting framework for the composition of access control policies
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Model-driven constraint programming
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Cooperation of constraint domains in the TOY system
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Integro-differential polynomials and operators
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Theory of finite or infinite trees revisited
Theory and Practice of Logic Programming
An insertion operator preserving infinite reduction sequences
Mathematical Structures in Computer Science
Safety of nöcker's strictness analysis
Journal of Functional Programming
A theoretical limit for safety verification techniques with regular fix-point computations
Information Processing Letters
Loop detection in term rewriting using the eliminating unfoldings
Theoretical Computer Science
YAGO: A Large Ontology from Wikipedia and WordNet
Web Semantics: Science, Services and Agents on the World Wide Web
Information Processing Letters
Constraints for Argument Filterings
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Cut Elimination in Deduction Modulo by Abstract Completion
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
A Note on Rewriting Proofs and Fibonacci Numbers
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Predictive Labeling with Dependency Pairs Using SAT
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Dependency Pairs for Rewriting with Non-free Constructors
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Proving Termination by Bounded Increase
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
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
Languages Modulo Normalization
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Proving Termination Using Recursive Path Orders and SAT Solving
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Implementation and Application of Functional Languages
Term-Graph Rewriting Via Explicit Paths
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
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Arctic Termination ...Below Zero
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Tree Automata for Non-linear Arithmetic
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Towards an Efficient Implementation of Tree Automata Completion
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
MetiTarski: An Automatic Prover for the Elementary Functions
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Automated Implicit Computational Complexity Analysis (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Unification and Matching Modulo Leaf-Permutative Equational Presentations
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Automated Complexity Analysis Based on the Dependency Pair Method
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Certifying a Tree Automata Completion Checker
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
Language and Automata Theory and Applications
High-Level Programs and Program Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Analysis and Evaluation of Inductive Programming Systems in a Higher-Order Framework
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
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)
A Rewriting Calculus for Multigraphs with Ports
Electronic Notes in Theoretical Computer Science (ENTCS)
Maude as a Platform for Designing and Implementing Deep Inference Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of rewriting under strategies
ACM Transactions on Computational Logic (TOCL)
WebDSL: A Case Study in Domain-Specific Language Engineering
Generative and Transformational Techniques in Software Engineering II
Handling Left-Quadratic Rules When Completing Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
A Semantic Web Reasoner for Rules, Equations and Constraints
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Improving Context-Sensitive Dependency Pairs
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Complexity, Graphs, and the Dependency Pair Method
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
On the Identification of Goals in Stakeholders' Dialogs
Innovations for Requirement Analysis. From Stakeholders' Needs to Formal Designs
Cadmium: An Implementation of ACD Term Rewriting
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
From Outermost Termination to Innermost Termination
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Generating priority rewrite systems for OSOS process languages
Information and Computation
Symbolic program analysis using term rewriting and generalization
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
A Transformational Approach to Prove Outermost Termination Automatically
Electronic Notes in Theoretical Computer Science (ENTCS)
Completion after Program Inversion of Injective Functions
Electronic Notes in Theoretical Computer Science (ENTCS)
Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Action Control by Term Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Analysis of Rewrite-Based Access Control Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
A hybrid programming scheme combining fuzzy-logic and functional-logic resources
Fuzzy Sets and Systems
Building language towers with ziggurat
Journal of Functional Programming
Using groups for investigating rewrite systems
Mathematical Structures in Computer Science
Journal of Functional Programming
A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
Logic-Based Program Synthesis and Transformation
Welcome to Constraint Handling Rules
Constraint Handling Rules
Monadic Datalog Tree Transducers
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Termination of Priority Rewriting
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Strategy-Based Proof Calculus for Membrane Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
An Improved Recursive Decomposition Ordering for Term Rewriting Systems Revisited
Proceedings of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005
Journal of Automated Reasoning
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Dependency Pairs and Polynomial Path Orders
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Unique Normalization for Shallow TRS
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Proving Confluence of Term Rewriting Systems Automatically
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
The Derivational Complexity Induced by the Dependency Pair Method
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
VMTL---A Modular Termination Laboratory
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Canonical Forms in Interactive Exercise Assistants
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
A skew polynomial approach to integro-differential operators
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Computing with abstract matrix structures
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
TAGED Approximations for Temporal Properties Model-Checking
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Automated deduction for verification
ACM Computing Surveys (CSUR)
A PVS Theory for Term Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Methods for Proving Termination of Rewriting-based Programming Languages by Transformation
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Transforming SAT into Termination of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Losing functions without gaining data: another look at defunctionalisation
Proceedings of the 2nd ACM SIGPLAN symposium on Haskell
Set functions for functional logic programming
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Demand-Driven Normalisation for ACD Term Rewriting
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Automated termination proofs for logic programs by term rewriting
ACM Transactions on Computational Logic (TOCL)
Superposition and Model Evolution Combined
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Termination Analysis by Dependency Pairs and Inductive Theorem Proving
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Certification of Termination Proofs Using CeTA
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Journal of Artificial Intelligence Research
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of narrowing revisited
Theoretical Computer Science
A verified Common Lisp implementation of Buchberger's algorithm in ACL2
Journal of Symbolic Computation
An extension for feature algebra
FOSD '09 Proceedings of the First International Workshop on Feature-Oriented Software Development
Information and Computation
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in cflp
Theory and Practice of Logic Programming
The lambda-context calculus (extended version)
Information and Computation
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
On-demand strategy annotations revisited: An improved on-demand evaluation strategy
Theoretical Computer Science
Congruences Generated by Extended Ground Term Rewrite Systems
Fundamenta Informaticae
Relaxing RDF queries based on user and domain preferences
Journal of Intelligent Information Systems
Automatic Proofs of Termination With Elementary Interpretations
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Analysis of Non-determinism in Verilog Cell Library Simulation Models
FMICS '09 Proceedings of the 14th International Workshop on Formal Methods for Industrial Critical Systems
The Higher-Order, Call-by-Value Applied Pi-Calculus
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Improved Matrix Interpretation
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Deductive Runtime Certification
Electronic Notes in Theoretical Computer Science (ENTCS)
Formalizing and Analyzing the Needham-Schroeder Symmetric-Key Protocol by Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Constraint Functional Logic Programming Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
An Isomorph-Free SEM-Like Enumeration of Models
Electronic Notes in Theoretical Computer Science (ENTCS)
Logical Semantics for the Rewriting Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Diagram Chase in Relational System Development
Electronic Notes in Theoretical Computer Science (ENTCS)
An Abstract Way to Define Rewriting Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
From Chemical Rules to Term Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Rewriting-Based Navigation of Web Sites: Looking for Models and Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Distributed event-based access control
International Journal of Information and Computer Security
Information and Computation
Decidable call-by-need computations in term rewriting
Information and Computation
Canonization for disjoint unions of theories
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Automating the dependency pair method
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
On modularity in infinitary term rewriting
Information and Computation
Relaxing monotonicity for innermost termination
Information Processing Letters
On proving C E-termination of rewriting by size-change termination
Information Processing Letters
The reachability and related decision problems for monadic and semi-constructor TRSs
Information Processing Letters
Confluence and related properties of fuzzy relations
FUZZ-IEEE'09 Proceedings of the 18th international conference on Fuzzy Systems
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
Journal of Automated Reasoning
Implementing a fair monodic temporal logic prover
AI Communications - Practical Aspects of Automated Reasoning
Reduction relations for monoid semirings
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
Anti-patterns for rule-based languages
Journal of Symbolic Computation
Equational approximations for tree automata completion
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
Counting and equality constraints for multitree automata
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
Innermost termination of context-sensitive rewriting
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Automatic partial inversion of inductively sequential functions
IFL'06 Proceedings of the 18th international conference on Implementation and application of functional languages
Rewriting logic and probabilities
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Diagrams for meaning preservation
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Expression reduction systems with patterns
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Size-change termination for term rewriting
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Relating derivation lengths with the slow-growing hierarchy directly
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Termination of simply typed term rewriting by translation and labelling
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
A rewriting alternative to Reidemeister-Schreier
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Recognizing boolean closed A-tree languages with membership conditional rewriting mechanism
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Improving offline narrowing-driven partial evaluation using size-change graphs
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Automated termination analysis for logic programs by term rewriting
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Detecting non-termination of term rewriting systems using an unfolding operator
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Abstract diagnosis of functional programs
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
ESOP'07 Proceedings of the 16th European conference on Programming
Max-plus quasi-interpretations
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Automated generation of kinetic chemical mechanisms using rewriting
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Autonomous units and their semantics: the parallel case
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Equational binary decision diagrams
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Correction of functional logic programs
ESOP'03 Proceedings of the 12th European conference on Programming
SAT solving for termination analysis with polynomial interpretations
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
A short survey of automated reasoning
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Dynamic event-based access control as term rewriting
Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
Max/plus tree automata for termination of term rewriting
Acta Cybernetica
Restarting tree automata and linear context-free tree languages
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Building extended canonizers by graph-based deduction
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Multi-paradigm declarative languages
ICLP'07 Proceedings of the 23rd international conference on Logic programming
An extension of the Knuth-Bendix ordering with LPO-like properties
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Rewriting approximations for fast prototyping of static analyzers
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Determining unify-stable presentations
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Proving termination of rewrite systems using bounds
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
A characterization of medial as rewriting rule
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Termination of narrowing in left-linear constructor systems
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Complexity analysis by rewriting
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Strong normalisation of cut-elimination that simulates β-reduction
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Proceedings of the forty-second ACM symposium on Theory of computing
Automating theories in intuitionistic logic
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Context-sensitive dependency pairs
Information and Computation
Confluence and termination of fuzzy relations
Information Sciences: an International Journal
Journal of Computer Security - Digital Identity Management (DIM 2007)
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
Information Processing Letters
A compact fixpoint semantics for term rewriting systems
Theoretical Computer Science
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
The importance of rule restrictions in CCG
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
A Formalization of the Knuth---Bendix(---Huet) Critical Pair Theorem
Journal of Automated Reasoning
An integrated framework for the diagnosis and correction of rule-based programs
Theoretical Computer Science
Verification of the completeness of unification algorithms à la Robinson
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Cdiprover3: a tool for proving derivational complexities of term rewriting systems
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
POP and semantic labeling using SAT
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Signature extensions preserve termination: an alternative proof via dependency pairs
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
From matrix interpretations over the rationals to matrix interpretations over the naturals
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Adapting mathematical domain reasoners
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Resolution with Order and Selection for Hybrid Logics
Journal of Automated Reasoning
A dynamic logic for termgraph rewriting
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Local confluence for rules with nested application conditions
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Characterising space complexity classes via Knuth-Bendix orders
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Lazy abstraction for size-change termination
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Revisiting matrix interpretations for polynomial derivational complexity of term rewriting
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Integrating implicit induction proofs into certified proof environments
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Calculating with lenses: optimising bidirectional transformations
Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
Types for units-of-measure: theory and practice
CEFP'09 Proceedings of the Third summer school conference on Central European functional programming school
On the equality of probabilistic terms
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Satisfiability of non-linear (Ir)rational arithmetic
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Confluent Term Rewriting for Only-knowing Logics
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
Decision procedures for automating termination proofs
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Electronic Notes in Theoretical Computer Science (ENTCS)
Analysing graph transformation systems through constraint handling rules
Theory and Practice of Logic Programming
JavaGI: The Interaction of Type Classes with Interfaces and Inheritance
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
More precise typing of rewrite strategies
Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications
Learning regular tree languages from correction and equivalence queries
Journal of Automata, Languages and Combinatorics
On Rota's problem for linear operators in associative algebras
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Incremental checking of well-founded recursive specifications modulo axioms
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Symbolic analysis of network security policies using rewrite systems
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
An access control language based on term rewriting and description logic
WFLP'10 Proceedings of the 19th international conference on Functional and constraint logic programming
A formal library of set relations and its application to synchronous languages
Theoretical Computer Science
Joint spectral radius theory for automated complexity analysis of rewrite systems
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Rewriting in varieties of idempotent semigroups
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Enforcing architectural contracts in high-level synthesis
Proceedings of the 48th Design Automation Conference
Functional term rewriting systems towards symbolic model-checking
International Journal of Critical Computer-Based Systems
Intuitionistic sequent-style calculus with explicit structural rules
TbiLLC'09 Proceedings of the 8th international tbilisi conference on Logic, language, and computation
Dynamic behavior matching: a complexity analysis and new approximation algorithms
CADE'11 Proceedings of the 23rd international conference on Automated deduction
On transfinite Knuth-Bendix orders
CADE'11 Proceedings of the 23rd international conference on Automated deduction
A dependency pair framework for innermost complexity analysis of term rewrite systems
CADE'11 Proceedings of the 23rd international conference on Automated deduction
CADE'11 Proceedings of the 23rd international conference on Automated deduction
WFLP'11 Proceedings of the 20th international conference on Functional and constraint logic programming
Termination of Isabelle functions via termination of rewriting
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Proving Termination by Dependency Pairs and Inductive Theorem Proving
Journal of Automated Reasoning
A Combined Superposition and Model Evolution Calculus
Journal of Automated Reasoning
Linearity and iterator types for Gödel's System
Higher-Order and Symbolic Computation
Intersection types for the resource control lambda calculi
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Proof Pearl: a Formal Proof of Higman's Lemma in ACL2
Journal of Automated Reasoning
Best Unifiers in Transitive Modal Logics
Studia Logica
Refining the process rewrite systems hierarchy via ground tree rewrite systems
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Characterizing conclusive approximations by logical formulae
RP'11 Proceedings of the 5th international conference on Reachability problems
A domain specific language for interactive enterprise application development
WISM'11 Proceedings of the 2011 international conference on Web information systems and mining - Volume Part II
Scheme-based theorem discovery and concept invention
Expert Systems with Applications: An International Journal
Tree transformations and dependencies
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Congruence closure of compressed terms in polynomial time
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Generalized and formalized uncurrying
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Transformation rules for first-order probabilistic conditional logic yielding parametric uniformity
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
On Source Code Transformations for Steganographic Applications
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03
Term rewriting for access control
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Deciding satisfiability of positive second order joinability formulae
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
SAT solving for argument filterings
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Inductive decidability using implicit induction
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Boolean rings for intersection-based satisfiability
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Recursive path orderings can also be incremental
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Well-typed narrowing with extra variables in functional-logic programming
PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Declarative programming with function patterns
LOPSTR'05 Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation
Symbolic analysis of imperative programming languages
JMLC'06 Proceedings of the 7th joint conference on Modular Programming Languages
Overlapping rules and logic variables in functional logic programs
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Unification Modulo Homomorphic Encryption
Journal of Automated Reasoning
Partizan games in Isabelle/HOLZF
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Goal-directed and relative dependency pairs for proving the termination of narrowing
LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
Proofs of termination of rewrite systems for polytime functions
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Automation of recursive path ordering for infinite labelled rewrite systems
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Decidability and undecidability results for nelson-oppen and rewrite-based decision procedures
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A resolution-based decision procedure for SHOIQ
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A BDD-Representation for the logic of equality and uninterpreted functions
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Determinate STG decomposition of marked graphs
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Proof pearl: a formal proof of Higman's Lemma in ACL2
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Invited contribution: a comprehensive framework for combined decision procedures
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
About the combination of trees and rational numbers in a complete first-order theory
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Proving and disproving termination of higher-order functions
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
The decidability of the first-order theory of knuth-bendix order
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Generalized innermost rewriting
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Orderings for innermost termination
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Unification in a class of permutative theories
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Partial inversion of constructor term rewriting systems
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
Proving positive almost-sure termination
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
On tree automata that certify termination of left-linear term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
E-unification with Constants vs. General E-unification
Journal of Automated Reasoning
Solving first order formulae of pseudo-regular theory
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
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
Generalizing newman's lemma for left-linear rewrite systems
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Feasible trace reconstruction for rewriting approximations
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Checking conservativity of overloaded definitions in higher-order logic
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Dealing with non-orientable equations in rewriting induction
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
RAPT: a program transformation system based on term rewriting
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Slothrop: Knuth-Bendix completion with a modern termination checker
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
Decidability of termination for semi-constructor TRSs, left-linear shallow TRSs and related systems
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Proving positive almost sure termination under strategies
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
Simplifying regular expressions: a quantitative perspective
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Reducing right-hand sides for termination
Processes, Terms and Cycles
Reduction strategies for left-linear term rewriting systems
Processes, Terms and Cycles
Confluence of graph transformation revisited
Processes, Terms and Cycles
Expression reduction systems and extensions: an overview
Processes, Terms and Cycles
Axiomatic rewriting theory i: a diagrammatic standardization theorem
Processes, Terms and Cycles
Complete propagation rules for lexicographic order constraints over arbitrary domains
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Constructing rewrite-based decision procedures for embeddings and termination
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Robust query processing for personalized information access on the semantic web
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
Rule-Based modeling of transcriptional attenuation at the tryptophan operon
Transactions on Computational Systems Biology XII
Survey: weighted extended top-down tree transducers part iii - composition
Algebraic Foundations in Computer Science
Category-Based authorisation models: operational semantics and expressive power
ESSoS'10 Proceedings of the Second international conference on Engineering Secure Software and Systems
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Termination of context-sensitive rewriting with built-in numbers and collection data structures
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Semantic labelling for proving termination of combinatory reduction systems
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Complexity analysis by graph rewriting
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Least upper bounds on the size of church-rosser diagrams in term rewriting and λ-calculus
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Proving injectivity of functions via program inversion in term rewriting
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
An extension of complex role inclusion axioms in the description logic SROIQ
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Automated certification of implicit induction proofs
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Tree automata and XPath on compressed trees
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
A symbolic analysis framework for static analysis of imperative programming languages
Journal of Systems and Software
Sharing in the graph rewriting calculus
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Formal specification and validation of security policies
FPS'11 Proceedings of the 4th Canada-France MITACS conference on Foundations and Practice of Security
Model Evolution with equality - Revised and implemented
Journal of Symbolic Computation
Rewriting approximations for properties verification over CCS specifications
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Confluence of non-left-linear TRSs via relative termination
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
On the domain and dimension hierarchy of matrix interpretations
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Type-directed automatic incrementalization
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs
Journal of Automated Reasoning
On Explicit Substitution with Names
Journal of Automated Reasoning
Automatic verification of epistemic specifications under convergent equational theories
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Unification modulo synchronous distributivity
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
A calculus for generating ground explanations
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Rewriting induction + linear arithmetic = decision procedure
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
New algorithms for unification modulo one-sided distributivity and its variants
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
KBCV: knuth-bendix completion visualizer
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
A short introduction to implicit computational complexity
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
The HOM Problem is EXPTIME-Complete
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Nominal completion for rewrite systems with binders
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Automated termination proofs for Java programs with cyclic data
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
nuTAB-BackSpace: rewriting to normalize non-determinism in post-silicon debug traces
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
A declarative embedding of XQuery in a functional-logic language
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Explicitly heterogeneous metaprogramming with MetaHaskell
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Congruences Generated by Extended Ground Term Rewrite Systems
Fundamenta Informaticae
Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Synthesis of max-plus quasi-interpretations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Applying term rewriting to partial algebra theory
Fundamenta Informaticae
Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs
Proceedings of the 14th symposium on Principles and practice of declarative programming
Linear dependent types in a call-by-value scenario
Proceedings of the 14th symposium on Principles and practice of declarative programming
Strong Normalisation of Cut-Elimination in Classical Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Proceedings of the 11th International Conference on Generative Programming and Component Engineering
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
Strong lexicalization of tree adjoining grammars
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Rewriting Computation and Proof
Narrowing, abstraction and constraints for proving properties of reduction relations
Rewriting Computation and Proof
Reduction strategies and acyclicity
Rewriting Computation and Proof
Integrating linear arithmetic into superposition calculus
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
The theory of calculi with explicit substitutions revisited
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Unbounded proof-length speed-up in deduction modulo
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Modular access control via strategic rewriting
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Modularity in term rewriting revisited
Theoretical Computer Science
Determinization of conditional term rewriting systems
Theoretical Computer Science
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
S-Narrowing for constructor systems
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
On the length of knot transformations via reidemeister moves i and II
RP'12 Proceedings of the 6th international conference on Reachability Problems
Order-Sorted equality enrichments modulo axioms
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
Graph transformation with focus on incident edges
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Rational term rewriting revisited: decidability and confluence
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
A truly concurrent semantics for the K framework based on graph transformations
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Synthesis of sup-interpretations: A survey
Theoretical Computer Science
Complexities of Horn Description Logics
ACM Transactions on Computational Logic (TOCL)
Paramodulation with Non-Monotonic Orderings and Simplification
Journal of Automated Reasoning
ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
Automated analysis of rule-based access control policies
PLPV '13 Proceedings of the 7th workshop on Programming languages meets program verification
Equational abstraction refinement for certified tree regular model checking
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Journal of Automated Reasoning
Differential type operators and Gröbner-Shirshov bases
Journal of Symbolic Computation
Revisiting “forward node-selecting queries over trees”
ACM Transactions on Database Systems (TODS)
Z3-str: a z3-based string solver for web application analysis
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
Journal of the ACM (JACM)
Unifying the Knuth-Bendix, recursive path and polynomial orders
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Extending Type Inference to Variational Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
On software component co-installability
ACM Transactions on Software Engineering and Methodology (TOSEM) - Testing, debugging, and error handling, formal methods, lifecycle concerns, evolution and maintenance
Required behavior of sequence diagrams: Semantics and conformance
ACM Transactions on Software Engineering and Methodology (TOSEM)
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Quantifier instantiation techniques for finite model finding in SMT
CADE'13 Proceedings of the 24th international conference on Automated Deduction
White dots do matter: rewriting reversible logic circuits
RC'13 Proceedings of the 5th international conference on Reversible Computation
A completion algorithm for lattice tree automata
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
ACM Transactions on Computational Logic (TOCL)
Lightweight proof by reflection using a posteriori simulation of effectful computation
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
A universal machine for biform theory graphs
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Type-changing rewriting and semantics-preserving transformation
Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation
Non-Linear Rewrite Closure and Weak Normalization
Journal of Automated Reasoning
Excessively duplicating patterns represent non-regular languages
Information Processing Letters
Implementation of a solution to the conjugacy problem in Thompson's group F
ACM Communications in Computer Algebra
Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints
Journal of Automated Reasoning
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
Termination of the F5 algorithm
Programming and Computing Software
| Hi-index | 0.03 |