Search results for "RTA"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl	Maximal Termination.	RTA	2008	DBLP DOI BibTeX RDF
1	Naoki Kobayashi 0001, Hitoshi Ohsaki	Tree Automata for Non-linear Arithmetic.	RTA	2008	DBLP DOI BibTeX RDF
1	Yoshiharu Kojima, Masahiko Sakai	Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems.	RTA	2008	DBLP DOI BibTeX RDF
1	Harald Zankl, Aart Middeldorp	Satisfying KBO Constraints.	RTA	2007	DBLP DOI BibTeX RDF
1	Horatiu Cirstea, Germain Faure	Confluence of Pattern-Based Calculi.	RTA	2007	DBLP DOI BibTeX RDF
1	Dominique Duval, Rachid Echahed, Frédéric Prost	Adjunction for Garbage Collection with Application to Graph Rewriting.	RTA	2007	DBLP DOI BibTeX RDF
1	José Espírito Santo	Delayed Substitutions.	RTA	2007	DBLP DOI BibTeX RDF
1	Manfred Schmidt-Schauß	Correctness of Copy in Calculi with Letrec.	RTA	2007	DBLP DOI BibTeX RDF
1	Kentaro Kikuchi	Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi.	RTA	2007	DBLP DOI BibTeX RDF
1	Emilie Balland, Paul Brauner, Radu Kopetz, Pierre-Etienne Moreau, Antoine Reilles	Tom: Piggybacking Rewriting on Java.	RTA	2007	DBLP DOI BibTeX RDF
1	Lutz Straßburger	A Characterization of Medial as Rewriting Rule.	RTA	2007	DBLP DOI BibTeX RDF
1	Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luka Le Roux	Rewriting Approximations for Fast Prototyping of Static Analyzers.	RTA	2007	DBLP DOI BibTeX RDF
1	Mark Hills 0001, Grigore Rosu	KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis.	RTA	2007	DBLP DOI BibTeX RDF	object-oriented languages, term rewriting, formal analysis, rewriting logic, programming language semantics
1	Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio	Challenges in Satisfiability Modulo Theories.	RTA	2007	DBLP DOI BibTeX RDF
1	Guillem Godoy, Eduard Huntingford	Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems.	RTA	2007	DBLP DOI BibTeX RDF
1	Guillem Godoy, Eduard Huntingford, Ashish Tiwari 0001	Termination of Rewriting with Right-Flat Rules.	RTA	2007	DBLP DOI BibTeX RDF
1	Rémy Haemmerlé, François Fages	Abstract Critical Pairs and Confluence of Arbitrary Binary Relations.	RTA	2007	DBLP DOI BibTeX RDF
1	Makoto Tatsuta	The Maximum Length of Mu-Reduction in Lambda Mu-Calculus.	RTA	2007	DBLP DOI BibTeX RDF
1	Vincent van Oostrom	Random Descent.	RTA	2007	DBLP DOI BibTeX RDF
1	Franz Baader (eds.)	Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings	RTA	2007	DBLP DOI BibTeX RDF
1	Rachid Echahed, Nicolas Peltier	Non Strict Confluent Rewrite Systems for Data-Structures with Pointers.	RTA	2007	DBLP DOI BibTeX RDF
1	Martin Korp, Aart Middeldorp	Proving Termination of Rewrite Systems Using Bounds.	RTA	2007	DBLP DOI BibTeX RDF
1	Temur Kutsia, Jordi Levy, Mateu Villaret	Sequence Unification Through Currying.	RTA	2007	DBLP DOI BibTeX RDF
1	Gilles Dowek, Olivier Hermant	A Simple Proof That Super-Consistency Implies Cut Elimination.	RTA	2007	DBLP DOI BibTeX RDF
1	Joe Hendrix, José Meseguer 0001	On the Completeness of Context-Sensitive Order-Sorted Specifications.	RTA	2007	DBLP DOI BibTeX RDF
1	Hans Zantema, Johannes Waldmann	Termination by Quasi-periodic Interpretations.	RTA	2007	DBLP DOI BibTeX RDF
1	Irène Durand, Géraud Sénizergues	Bottom-Up Rewriting Is Inverse Recognizability Preserving.	RTA	2007	DBLP DOI BibTeX RDF
1	Frank Pfenning	On a Logical Foundation for Explicit Substitutions.	RTA	2007	DBLP DOI BibTeX RDF
1	Xavier Leroy	Formal Verification of an Optimizing Compiler.	RTA	2007	DBLP DOI BibTeX RDF
1	Thierry Boy de la Tour, Mnacho Echenim	Determining Unify-Stable Presentations.	RTA	2007	DBLP DOI BibTeX RDF
1	Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch	Intruders with Caps.	RTA	2007	DBLP DOI BibTeX RDF
1	Santiago Escobar 0001, José Meseguer 0001	Symbolic Model Checking of Infinite-State Systems Using Narrowing.	RTA	2007	DBLP DOI BibTeX RDF
1	Claude Marché, Hans Zantema	The Termination Competition.	RTA	2007	DBLP DOI BibTeX RDF
1	Lionel Vaux	On Linear Combinations of lambda -Terms.	RTA	2007	DBLP DOI BibTeX RDF
1	Bernhard Gramlich, Salvador Lucas	Generalizing Newman's Lemma for Left-Linear Rewrite Systems.	RTA	2006	DBLP DOI BibTeX RDF
1	H. J. Sander Bruggink	A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property.	RTA	2006	DBLP DOI BibTeX RDF
1	Sergio Antoy, Daniel W. Brown, Su-Hui Chiang	On the Correctness of Bubbling.	RTA	2006	DBLP DOI BibTeX RDF
1	José Espírito Santo, Maria João Frade, Luís Pinto 0001	Structural Proof Theory as Rewriting.	RTA	2006	DBLP DOI BibTeX RDF
1	Yo Ohta, Masahito Hasegawa	A Terminating and Confluent Linear Lambda Calculus.	RTA	2006	DBLP DOI BibTeX RDF
1	Yannick Chevalier, Michaël Rusinowitch	Hierarchical Combination of Intruder Theories.	RTA	2006	DBLP DOI BibTeX RDF
1	Olivier Bournez, Florent Garnier	Proving Positive Almost Sure Termination Under Strategies.	RTA	2006	DBLP DOI BibTeX RDF
1	Takahito Aoto 0001	Dealing with Non-orientable Equations in Rewriting Induction.	RTA	2006	DBLP DOI BibTeX RDF
1	Michael Codish, Vitaly Lagoon, Peter J. Stuckey	Solving Partial Order Constraints for LPO Termination.	RTA	2006	DBLP DOI BibTeX RDF
1	Adam Koprowski	TPA: Termination Proved Automatically.	RTA	2006	DBLP DOI BibTeX RDF
1	Mathieu Turuani	The CL-Atse Protocol Analyser.	RTA	2006	DBLP DOI BibTeX RDF
1	Randal E. Bryant	Formal Verification of Infinite State Systems Using Boolean Methods.	RTA	2006	DBLP DOI BibTeX RDF
1	Jean-Pierre Jouannaud	Modular Church-Rosser Modulo.	RTA	2006	DBLP DOI BibTeX RDF
1	Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann	Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages.	RTA	2006	DBLP DOI BibTeX RDF
1	Nao Hirokawa, Aart Middeldorp	Predictive Labeling.	RTA	2006	DBLP DOI BibTeX RDF
1	Traian-Florin Serbanuta, Grigore Rosu	Computationally Equivalent Elimination of Conditions.	RTA	2006	DBLP DOI BibTeX RDF
1	Joe Hendrix, Hitoshi Ohsaki, Mahesh Viswanathan 0001	Propositional Tree Automata.	RTA	2006	DBLP DOI BibTeX RDF
1	Yuki Chiba, Takahito Aoto 0001	RAPT: A Program Transformation System Based on Term Rewriting.	RTA	2006	DBLP DOI BibTeX RDF
1	Yi Wang, Masahiko Sakai	Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems.	RTA	2006	DBLP DOI BibTeX RDF
1	Piotr Hoffman	Unions of Equational Monadic Theories.	RTA	2006	DBLP DOI BibTeX RDF
1	Adam Koprowski	Certified Higher-Order Recursive Path Ordering.	RTA	2006	DBLP DOI BibTeX RDF
1	Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret	Bounded Second-Order Unification Is NP-Complete.	RTA	2006	DBLP DOI BibTeX RDF
1	Yohan Boichut, Thomas Genet	Feasible Trace Reconstruction for Rewriting Approximations.	RTA	2006	DBLP DOI BibTeX RDF
1	Dieter Hofbauer, Johannes Waldmann	Termination of String Rewriting with Matrix Interpretations.	RTA	2006	DBLP DOI BibTeX RDF
1	Ahmed Bouajjani, Javier Esparza	Rewriting Models of Boolean Programs.	RTA	2006	DBLP DOI BibTeX RDF
1	Frank Pfenning (eds.)	Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings	RTA	2006	DBLP DOI BibTeX RDF
1	Sylvain Salvati	Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear lambda-Calculus.	RTA	2006	DBLP DOI BibTeX RDF
1	Jean-Pierre Jouannaud, Albert Rubio	Higher-Order Orderings for Normal Rewriting.	RTA	2006	DBLP DOI BibTeX RDF
1	Steven Obua	Checking Conservativity of Overloaded Definitions in Higher-Order Logic.	RTA	2006	DBLP DOI BibTeX RDF
1	Ian Wehrman, Aaron Stump, Edwin M. Westbrook	Slothrop: Knuth-Bendix Completion with a Modern Termination Checker.	RTA	2006	DBLP DOI BibTeX RDF
1	Ariel Arbiser, Alexandre Miquel, Alejandro Ríos 0001	A Lambda-Calculus with Constructors.	RTA	2006	DBLP DOI BibTeX RDF
1	José Meseguer 0001	Localized Fairness: A Rewriting Semantics.	RTA	2005	DBLP DOI BibTeX RDF
1	Gilles Dowek, Benjamin Werner	Arithmetic as a Theory Modulo.	RTA	2005	DBLP DOI BibTeX RDF
1	Jeroen Ketema, Jakob Grue Simonsen	Infinitary Combinatory Reduction Systems.	RTA	2005	DBLP DOI BibTeX RDF
1	Jürgen Giesl (eds.)	Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings	RTA	2005	DBLP DOI BibTeX RDF
1	Yoshihito Toyama	Confluent Term Rewriting Systems.	RTA	2005	DBLP DOI BibTeX RDF
1	Alex K. Simpson	Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics.	RTA	2005	DBLP DOI BibTeX RDF
1	Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen	Quasi-interpretations and Small Space Bounds.	RTA	2005	DBLP DOI BibTeX RDF
1	Santiago Escobar 0001, José Meseguer 0001, Prasanna Thati	Natural Narrowing for General Term Rewriting Systems.	RTA	2005	DBLP DOI BibTeX RDF
1	Mirtha-Lina Fernández, Guillem Godoy, Albert Rubio	Orderings for Innermost Termination.	RTA	2005	DBLP DOI BibTeX RDF
1	Hubert Comon-Lundh, Stéphanie Delaune	The Finite Variant Property: How to Get Rid of Some Algebraic Properties.	RTA	2005	DBLP DOI BibTeX RDF
1	Jean-Pierre Jouannaud	Twenty Years Later.	RTA	2005	DBLP DOI BibTeX RDF
1	Naoki Nishida 0001, Masahiko Sakai, Toshiki Sakabe	Partial Inversion of Constructor Term Rewriting Systems.	RTA	2005	DBLP DOI BibTeX RDF
1	Christopher Lynch, Barbara Morawska 0001	Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories.	RTA	2005	DBLP DOI BibTeX RDF
1	Makoto Hamana	Universal Algebra for Termination of Higher-Order Rewriting.	RTA	2005	DBLP DOI BibTeX RDF
1	James Cheney	Equivariant Unification.	RTA	2005	DBLP DOI BibTeX RDF
1	Michael Gordon Abbott, Neil Ghani, Christoph Lüth	Abstract Modularity.	RTA	2005	DBLP DOI BibTeX RDF
1	Nao Hirokawa, Aart Middeldorp	Tyrolean Termination Tool.	RTA	2005	DBLP DOI BibTeX RDF
1	Wojciech Moczydlowski, Alfons Geser	Termination of Single-Threaded One-Rule Semi-Thue Systems.	RTA	2005	DBLP DOI BibTeX RDF	uniform termination, one-rule, single-rule, single-threaded, well-behaved, termination, string rewriting, semi-Thue system
1	Joe Hendrix, Manuel Clavel, José Meseguer 0001	A Sufficient Completeness Reasoning Tool for Partial Specifications.	RTA	2005	DBLP DOI BibTeX RDF
1	Delia Kesner, Stéphane Lengrand	Extending the Explicit Substitution Paradigm.	RTA	2005	DBLP DOI BibTeX RDF
1	Ryo Yoshinaka	Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete.	RTA	2005	DBLP DOI BibTeX RDF
1	Philip Wadler	Call-by-Value Is Dual to Call-by-Name - Reloaded.	RTA	2005	DBLP DOI BibTeX RDF
1	Nachum Dershowitz	Open. Closed. Open.	RTA	2005	DBLP DOI BibTeX RDF
1	Pascal Lafourcade 0001, Denis Lugiez, Ralf Treinen	Intruder Deduction for AC-Like Equational Theories with Homomorphisms.	RTA	2005	DBLP DOI BibTeX RDF
1	Nachum Dershowitz, E. Castedo Ellerman	Leanest Quasi-orderings.	RTA	2005	DBLP DOI BibTeX RDF
1	Robert Nieuwenhuis, Albert Oliveras	Proof-Producing Congruence Closure.	RTA	2005	DBLP DOI BibTeX RDF
1	Iovka Boneva, Jean-Marc Talbot	Automata and Logics for Unranked and Unordered Trees.	RTA	2005	DBLP DOI BibTeX RDF
1	Ahmed Bouajjani, Tayssir Touili	On Computing Reachability Sets of Process Rewrite Systems.	RTA	2005	DBLP DOI BibTeX RDF
1	Jérôme Rocheteau	lambda-µ-Calculus and Duality: Call-by-Name and Call-by-Value.	RTA	2005	DBLP DOI BibTeX RDF
1	Aaron Stump, Li-Yang Tan	The Algebra of Equality Proofs.	RTA	2005	DBLP DOI BibTeX RDF
1	Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema	On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems.	RTA	2005	DBLP DOI BibTeX RDF
1	Takahito Aoto 0001, Toshiyuki Yamada	Dependency Pairs for Simply Typed Term Rewriting.	RTA	2005	DBLP DOI BibTeX RDF
1	Thierry Boy de la Tour, Mnacho Echenim	Unification in a Class of Permutative Theories.	RTA	2005	DBLP DOI BibTeX RDF
1	Piotr Hoffman	Union of Equational Theories: An Algebraic Approach.	RTA	2005	DBLP DOI BibTeX RDF
1	Amy P. Felty	A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code.	RTA	2005	DBLP DOI BibTeX RDF

Publications at "RTA"( http://dblp.L3S.de/Venues/RTA )