The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

URL (DBLP): http://dblp.uni-trier.de/db/conf/rta

Publication years (Num. hits)
1985 (24) 1987 (24) 1989 (48) 1991 (41) 1993 (40) 1995 (42) 1996 (38) 1997 (29) 1998 (26) 1999 (31) 2000 (21) 2001 (28) 2002 (30) 2003 (36) 2004 (22) 2005 (37) 2006 (31) 2007 (31) 2008 (31) 2009 (28) 2010 (31) 2011 (33) 2012 (27) 2013 (26) 2015 (27)
Publication types (Num. hits)
inproceedings(757) proceedings(25)
Venues (Conferences, Journals, ...)
RTA(782)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 69 occurrences of 44 keywords

Results
Found 782 publication records. Showing 782 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Horatiu Cirstea, Sergueï Lenglet, Pierre-Etienne Moreau A faithful encoding of programmable strategies into term rewriting systems. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Johannes Waldmann Matrix Interpretations on Polyhedral Domains. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Franz Baader, Stefan Borgwardt, Barbara Morawska Dismatching and Local Disunification in EL. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Thomas Genet, Yann Salmon Reachability Analysis of Innermost Rewriting. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Lars Hellström Network Rewriting II: Bi- and Hopf Algebras. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ilias S. Kotsireas, Temur Kutsia, Dimitris E. Simos Constructing Orthogonal Designs in Powers of Two: Gröbner Bases Meet Equational Unification. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder Inferring Lower Bounds for Runtime Complexity. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1David Sabel, Hans Zantema Transforming Cycle Rewriting into String Rewriting. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Florence Clerc, Samuel Mimram Presenting a Category Modulo a Rewriting System. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1 Front Matter, Table of Contents, Preface, Conference Organization. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Martin Avanzini, Christian Sternagel, René Thiemann Certification of Complexity Proofs using CeTA. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nao Hirokawa, Aart Middeldorp, Georg Moser Leftmost Outermost Revisited. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Vlad A. Vergu, Pierre Neron, Eelco Visser DynSem: A DSL for Dynamic Semantics Specification. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Cynthia Kop, Aart Middeldorp, Thomas Sternagel Conditional Complexity. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Anupam Das 0002, Lutz Straßburger No complete linear term rewriting system for propositional logic. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Takaki Suzuki, Kentaro Kikuchi, Takahito Aoto 0001, Yoshihito Toyama Confluence of Orthogonal Nominal Rewriting Systems Revisited. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jörg Endrullis, Hans Zantema Proving non-termination by finite automata. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Grigore Rosu Matching Logic - Extended Abstract (Invited Talk). Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva 0001 A Coinductive Framework for Infinitary Rewriting and Equational Reasoning. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Carolyn L. Talcott Executable Formal Models in Rewriting Logic (Invited Talk). Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Maribel Fernández (eds.) 26th International Conference on Rewriting Techniques and Applications, RTA 2015, June 29 to July 1, 2015, Warsaw, Poland Search on Bibsonomy RTA The full citation details ... 2015 DBLP  BibTeX  RDF
1Julian Nagele, Bertram Felgenhauer, Aart Middeldorp Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Julian Nagele, Harald Zankl Certified Rule Labeling. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret Nominal Anti-Unification. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Lukasz Czajka 0001 Confluence of nearly orthogonal infinitary term rewriting systems. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Markus Lepper, Baltasar Trancón y Widemann A Simple and Efficient Step Towards Type-Correct XSLT Transformations. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Hélène Kirchner Port Graphs, Rules and Strategies for Dynamic Data Analytics - Extended Abstract (Invited Talk). Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Alexander Baumgartner, Temur Kutsia, Jordi Levy, Mateu Villaret A Variant of Higher-Order Anti-Unification. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Beniamino Accattoli Linear Logic and Strong Normalization. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Yves Guiraud, Philippe Malbos, Samuel Mimram A Homotopical Completion Procedure with Applications to Coherence of Monoids. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Bertram Felgenhauer, Vincent van Oostrom Proof Orders for Decreasing Diagrams. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Clemens Grabmayer, Jan Rochel Expressibility in the Lambda Calculus with Mu. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Anupam Das 0002 Rewriting with Linear Inferences in Propositional Logic. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Manfred Schmidt-Schauß, Elena Machkasova, David Sabel Extending Abramsky's Lazy Lambda Calculus: (Non)-Conservativity of Embeddings. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Elena Tushkanova, Christophe Ringeissen, Alain Giorgetti, Olga Kouchnarenko Automatic Decidability: A Schematic Calculus for Theories with Counting Operators. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Gert Smolka, Tobias Tebbi Unification Modulo Nonnested Recursion Schemes via Anchored Semi-Unification. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ken-etsu Fujita, Aleksy Schubert Decidable structures between Church-style and Curry-style. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Dimitrios Vytiniotis, Simon L. Peyton Jones Evidence Normalization in System FC (Invited Talk). Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Manfred Schmidt-Schauß, Conrad Rau, David Sabel Algorithms for Extended Alpha-Equivalence and Complexity. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Christophe Calvès Unifying Nominal Unification. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Femke van Raamsdonk (eds.) 24th International Conference on Rewriting Techniques and Applications, RTA 2013, June 24-26, 2013, Eindhoven, The Netherlands Search on Bibsonomy RTA The full citation details ... 2013 DBLP  BibTeX  RDF
1Mitsuhiro Okada Husserl and Hilbert on Completeness and Husserl's Term Rewrite-based Theory of Multiplicity (Invited Talk). Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Yohan Boichut, Jacques Chabin, Pierre Réty Over-approximating Descendants by Synchronized Tree Languages. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Harald Zankl Confluence by Decreasing Diagrams - Formalized. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Alexander Bau, Markus Lohrey, Eric Nöth, Johannes Waldmann Compression of Rewriting Systems for Termination Analysis. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Martin Avanzini, Georg Moser Tyrolean Complexity Tool: Features and Usage. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Kyungmin Bae, Santiago Escobar, José Meseguer Abstract Logical Model Checking of Infinite-State Systems Using Narrowing. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1 Frontmatter, Table of Contents, Preface, Conference Organization. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Sarah Winkler, Harald Zankl, Aart Middeldorp Beyond Peano Arithmetic - Automatically Proving Termination of the Goodstein Sequence. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jarkko Kari Pattern Generation by Cellular Automata (Invited Talk). Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Sarah Winkler, Aart Middeldorp Normalized Completion Revisited. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Christian Sternagel, René Thiemann Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Martin Avanzini, Georg Moser A Combination Framework for Complexity. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Osama Al-Hassani, Quratul-ain Mahesar, Claudio Sacerdoti Coen, Volker Sorge A Term Rewriting System for Kuratowski's Closure-Complement Problem. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sebastian Maneth Dictionary-Based Tree Compression (Invited Talk). Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Bertram Felgenhauer Deciding Confluence of Ground Term Rewrite Systems in Cubic Time. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott, Ranko Perovic A Rewriting Framework for Activities Subject to Regulations. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Claude Kirchner Rho-Calculi for Computation and Logic (Invited Talk). Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Patrick Bahr Infinitary Term Graph Rewriting is Simple, Sound and Complete. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jeroen Ketema Reinterpreting Compression in Infinitary Rewriting. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Kazushige Terui Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Soren Bjerg Andersen, Jakob Grue Simonsen Term Rewriting Systems as Topological Dynamical Systems. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Paula Severi, Fer-Jan de Vries Meaningless Sets in Infinitary Combinatory Logic. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ashish Tiwari RTA 2012 Proceedings Frontmatter. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Beniamino Accattoli, Ugo Dal Lago On the Invariance of the Unitary Cost Model for Head Reduction. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Manfred Schmidt-Schauß Matching of Compressed Patterns with Character-Variables. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos Normalisation for Dynamic Pattern Calculi. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Denis Cousineau 0002, Olivier Hermant A Semantic Proof that Reducibility Candidates entail Cut Elimination. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Alexei Lisitsa Finite Models vs Tree Automata in Safety Verification. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Vincent van Oostrom, Hans Zantema Triangulation in Rewriting. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Karl Gmeiner, Bernhard Gramlich, Felix Schernhammer On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hirokazu Anai Computational Real Algebraic Geometry in Practice (Invited Talk). Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nathalie Bertrand 0001, Giorgio Delzanno, Barbara König 0001, Arnaud Sangnier, Jan Stückrath On the Decidability Status of Reachability and Coverability in Graph Transformation Systems. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ashish Tiwari (eds.) 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , RTA 2012, May 28 - June 2, 2012, Nagoya, Japan Search on Bibsonomy RTA The full citation details ... 2012 DBLP  BibTeX  RDF
1Carsten Fuhs, Cynthia Kop Polynomial Interpretations for Higher-Order Rewriting. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Carles Creus, Adrià Gascón, Guillem Godoy One-context Unification with STG-Compressed Terms is in NP. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1René Thiemann, Guillaume Allais, Julian Nagele On the Formalization of Termination Techniques based on Multiset Orderings. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Christian Sattler, Florent Balestrieri Turing-Completeness of Polymorphic Stream Equation Systems. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Beniamino Accattoli An Abstract Factorization Theorem for Explicit Substitutions. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Thibaut Balabonski Axiomatic Sharing-via-Labelling. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Aaron Stump, Garrin Kimmell, Roba El Haj Omar Type Preservation as a Confluence Problem. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Takahito Aoto 0001, Toshiyuki Yamada, Yuki Chiba Natural Inductive Theorems for Higher-Order Rewriting. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Manfred Schmidt-Schauß Frontmatter, Table of Contents, Preface, Conference Organization. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Manfred Schmidt-Schauß (eds.) Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, RTA 2011, May 30 - June 1, 2011, Novi Sad, Serbia Search on Bibsonomy RTA The full citation details ... 2011 DBLP  BibTeX  RDF
1Friedrich Neurauter, Aart Middeldorp Revisiting Matrix Interpretations for Proving Termination of Term Rewriting. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Temur Kutsia, Jordi Levy, Mateu Villaret Anti-Unification for Unranked Terms and Hedges. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Martin Avanzini, Naohi Eguchi, Georg Moser A Path Order for Rewrite Systems that Compute Exponential Time Functions. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Marc Brockschmidt, Carsten Otto, Jürgen Giesl Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ashish Tiwari Rewriting in Practice. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Naoki Nishida 0001, Germán Vidal Program Inversion for Tail Recursive Functions. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jonathan Kochems, C.-H. Luke Ong Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Francisco Durán, Steven Eker, Santiago Escobar, José Meseguer, Carolyn L. Talcott Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Adrià Gascón, Sebastian Maneth, Lander Ramos First-Order Unification on Compressed Terms. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Stephan Falke 0001, Deepak Kapur, Carsten Sinz Termination Analysis of C Programs Using Compiler Intermediate Languages. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Paula Severi, Fer-Jan de Vries Weakening the Axiom of Overlap in Infinitary Lambda Calculus. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Naoki Nishida 0001, Masahiko Sakai, Toshiki Sakabe Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Stephanie Weirich Combining Proofs and Programs. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Irène Durand, Marc Sylvestre Left-linear Bounded TRSs are Inverse Recognizability Preserving. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Georg Moser, Andreas Schnabl Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christian Sternagel, René Thiemann Modular and Certified Semantic Labeling and Unlabeling. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 782 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license