23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Proceedings{tiwari:LIPIcs.RTA.2012, title = {{LIPIcs, Volume 15, RTA'12, Complete Volume}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2013}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012}, URN = {urn:nbn:de:0030-drops-41090}, doi = {10.4230/LIPIcs.RTA.2012}, annote = {Keywords: Programming Techniques, Software Engineering, Programming Languages, Computation by Abstract Devices, Analysis of Algorithms and Problem Complexity Logics and Meanings of Programs, Mathematical Logic and Formal Languages, Symbolic and Algebraic Manipulation, Artificial Intelligence} }
23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. i-xiii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{tiwari:LIPIcs.RTA.2012.i, author = {Tiwari, Ashish}, title = {{RTA 2012 Proceedings Frontmatter}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {i--xiii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.i}, URN = {urn:nbn:de:0030-drops-35033}, doi = {10.4230/LIPIcs.RTA.2012.i}, annote = {Keywords: Frontmatter, Table of Contents, Conference Organization, External Reviewers, Author Index, RTA 2012, proceedings} }
Hirokazu Anai. Computational Real Algebraic Geometry in Practice (Invited Talk). In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{anai:LIPIcs.RTA.2012.1, author = {Anai, Hirokazu}, title = {{Computational Real Algebraic Geometry in Practice}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {1--1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.1}, URN = {urn:nbn:de:0030-drops-34784}, doi = {10.4230/LIPIcs.RTA.2012.1}, annote = {Keywords: real algebraic geometry, quantifier elimination, cylindrical algebraic decomposition, symbolic optimization} }
Claude Kirchner. Rho-Calculi for Computation and Logic (Invited Talk). In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 2-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{kirchner:LIPIcs.RTA.2012.2, author = {Kirchner, Claude}, title = {{Rho-Calculi for Computation and Logic}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {2--4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.2}, URN = {urn:nbn:de:0030-drops-34796}, doi = {10.4230/LIPIcs.RTA.2012.2}, annote = {Keywords: rewriting calculus, rho-calculus, deduction modulo} }
Sebastian Maneth. Dictionary-Based Tree Compression (Invited Talk). In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, p. 5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{maneth:LIPIcs.RTA.2012.5, author = {Maneth, Sebastian}, title = {{Dictionary-Based Tree Compression}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {5--5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.5}, URN = {urn:nbn:de:0030-drops-34802}, doi = {10.4230/LIPIcs.RTA.2012.5}, annote = {Keywords: Tree grammars, tree automata, straight-line programs} }
Beniamino Accattoli. An Abstract Factorization Theorem for Explicit Substitutions. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 6-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{accattoli:LIPIcs.RTA.2012.6, author = {Accattoli, Beniamino}, title = {{An Abstract Factorization Theorem for Explicit Substitutions}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {6--21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.6}, URN = {urn:nbn:de:0030-drops-34813}, doi = {10.4230/LIPIcs.RTA.2012.6}, annote = {Keywords: lambda-calculus, Standardization, Explicit Substitutions, Abstract rewriting, Diagrammatic reasoning} }
Beniamino Accattoli and Ugo Dal Lago. On the Invariance of the Unitary Cost Model for Head Reduction. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 22-37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{accattoli_et_al:LIPIcs.RTA.2012.22, author = {Accattoli, Beniamino and Dal Lago, Ugo}, title = {{On the Invariance of the Unitary Cost Model for Head Reduction}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {22--37}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.22}, URN = {urn:nbn:de:0030-drops-34820}, doi = {10.4230/LIPIcs.RTA.2012.22}, annote = {Keywords: lambda calculus, cost models, explicit substitutions, implicit computational complexity} }
Osama Al-Hassani, Quratul-ain Mahesar, Claudio Sacerdoti Coen, and Volker Sorge. A Term Rewriting System for Kuratowski's Closure-Complement Problem. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 38-52, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{alhassani_et_al:LIPIcs.RTA.2012.38, author = {Al-Hassani, Osama and Mahesar, Quratul-ain and Sacerdoti Coen, Claudio and Sorge, Volker}, title = {{A Term Rewriting System for Kuratowski's Closure-Complement Problem}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {38--52}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.38}, URN = {urn:nbn:de:0030-drops-34838}, doi = {10.4230/LIPIcs.RTA.2012.38}, annote = {Keywords: Kuratowski's closure-complement problem, Rewriting system} }
Soren Bjerg Andersen and Jakob Grue Simonsen. Term Rewriting Systems as Topological Dynamical Systems. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 53-68, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{andersen_et_al:LIPIcs.RTA.2012.53, author = {Andersen, Soren Bjerg and Simonsen, Jakob Grue}, title = {{Term Rewriting Systems as Topological Dynamical Systems}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {53--68}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.53}, URN = {urn:nbn:de:0030-drops-34841}, doi = {10.4230/LIPIcs.RTA.2012.53}, annote = {Keywords: Term rewriting, dynamical systems, topology, symbolic dynamics} }
Patrick Bahr. Infinitary Term Graph Rewriting is Simple, Sound and Complete. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 69-84, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{bahr:LIPIcs.RTA.2012.69, author = {Bahr, Patrick}, title = {{Infinitary Term Graph Rewriting is Simple, Sound and Complete}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {69--84}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.69}, URN = {urn:nbn:de:0030-drops-34857}, doi = {10.4230/LIPIcs.RTA.2012.69}, annote = {Keywords: term graphs, infinitary rewriting} }
Thibaut Balabonski. Axiomatic Sharing-via-Labelling. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 85-100, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{balabonski:LIPIcs.RTA.2012.85, author = {Balabonski, Thibaut}, title = {{Axiomatic Sharing-via-Labelling}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {85--100}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.85}, URN = {urn:nbn:de:0030-drops-34868}, doi = {10.4230/LIPIcs.RTA.2012.85}, annote = {Keywords: Sharing, Abstract term rewriting, Graphs, Higher order, Non-orthogonality} }
Nathalie Bertrand, Giorgio Delzanno, Barbara König, Arnaud Sangnier, and Jan Stückrath. On the Decidability Status of Reachability and Coverability in Graph Transformation Systems. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 101-116, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{bertrand_et_al:LIPIcs.RTA.2012.101, author = {Bertrand, Nathalie and Delzanno, Giorgio and K\"{o}nig, Barbara and Sangnier, Arnaud and St\"{u}ckrath, Jan}, title = {{On the Decidability Status of Reachability and Coverability in Graph Transformation Systems}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {101--116}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.101}, URN = {urn:nbn:de:0030-drops-34871}, doi = {10.4230/LIPIcs.RTA.2012.101}, annote = {Keywords: decidability, reachability, graph transformation, coverability} }
Eduardo Bonelli, Delia Kesner, Carlos Lombardi, and Alejandro Rios. Normalisation for Dynamic Pattern Calculi. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 117-132, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{bonelli_et_al:LIPIcs.RTA.2012.117, author = {Bonelli, Eduardo and Kesner, Delia and Lombardi, Carlos and Rios, Alejandro}, title = {{Normalisation for Dynamic Pattern Calculi}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {117--132}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.117}, URN = {urn:nbn:de:0030-drops-34889}, doi = {10.4230/LIPIcs.RTA.2012.117}, annote = {Keywords: Pattern calculi, reduction strategies, sequentiality, neededness} }
Denis Cousineau and Olivier Hermant. A Semantic Proof that Reducibility Candidates entail Cut Elimination. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 133-148, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{cousineau_et_al:LIPIcs.RTA.2012.133, author = {Cousineau, Denis and Hermant, Olivier}, title = {{A Semantic Proof that Reducibility Candidates entail Cut Elimination}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {133--148}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.133}, URN = {urn:nbn:de:0030-drops-34899}, doi = {10.4230/LIPIcs.RTA.2012.133}, annote = {Keywords: cut elimination, reducibility candidates, (pre-)Heyting algebras} }
Carles Creus, Adria Gascon, and Guillem Godoy. One-context Unification with STG-Compressed Terms is in NP. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 149-164, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{creus_et_al:LIPIcs.RTA.2012.149, author = {Creus, Carles and Gascon, Adria and Godoy, Guillem}, title = {{One-context Unification with STG-Compressed Terms is in NP}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {149--164}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.149}, URN = {urn:nbn:de:0030-drops-34902}, doi = {10.4230/LIPIcs.RTA.2012.149}, annote = {Keywords: Term Unification, Compression, Grammars} }
Bertram Felgenhauer. Deciding Confluence of Ground Term Rewrite Systems in Cubic Time. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 165-175, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{felgenhauer:LIPIcs.RTA.2012.165, author = {Felgenhauer, Bertram}, title = {{Deciding Confluence of Ground Term Rewrite Systems in Cubic Time}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {165--175}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.165}, URN = {urn:nbn:de:0030-drops-34918}, doi = {10.4230/LIPIcs.RTA.2012.165}, annote = {Keywords: confluence, ground rewrite systems, decidability, polynomial time} }
Carsten Fuhs and Cynthia Kop. Polynomial Interpretations for Higher-Order Rewriting. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 176-192, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{fuhs_et_al:LIPIcs.RTA.2012.176, author = {Fuhs, Carsten and Kop, Cynthia}, title = {{Polynomial Interpretations for Higher-Order Rewriting}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {176--192}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.176}, URN = {urn:nbn:de:0030-drops-34924}, doi = {10.4230/LIPIcs.RTA.2012.176}, annote = {Keywords: higher-order rewriting, termination, polynomial interpretations, weakly monotonic algebras, automation} }
Karl Gmeiner, Bernhard Gramlich, and Felix Schernhammer. On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 193-208, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{gmeiner_et_al:LIPIcs.RTA.2012.193, author = {Gmeiner, Karl and Gramlich, Bernhard and Schernhammer, Felix}, title = {{On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {193--208}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.193}, URN = {urn:nbn:de:0030-drops-34936}, doi = {10.4230/LIPIcs.RTA.2012.193}, annote = {Keywords: Conditional term rewriting system (CTRS), deterministic CTRS, transformation, simulation, soundness} }
Jeroen Ketema. Reinterpreting Compression in Infinitary Rewriting. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 209-224, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{ketema:LIPIcs.RTA.2012.209, author = {Ketema, Jeroen}, title = {{Reinterpreting Compression in Infinitary Rewriting}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {209--224}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.209}, URN = {urn:nbn:de:0030-drops-34948}, doi = {10.4230/LIPIcs.RTA.2012.209}, annote = {Keywords: term rewriting, infinitary rewriting, compression, standardisation} }
Alexei Lisitsa. Finite Models vs Tree Automata in Safety Verification. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 225-239, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{lisitsa:LIPIcs.RTA.2012.225, author = {Lisitsa, Alexei}, title = {{Finite Models vs Tree Automata in Safety Verification}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {225--239}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.225}, URN = {urn:nbn:de:0030-drops-34959}, doi = {10.4230/LIPIcs.RTA.2012.225}, annote = {Keywords: term-rewriting systems, safety verification, first-order logic, finite model finding} }
Vincent van Oostrom and Hans Zantema. Triangulation in Rewriting. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 240-255, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{vanoostrom_et_al:LIPIcs.RTA.2012.240, author = {van Oostrom, Vincent and Zantema, Hans}, title = {{Triangulation in Rewriting}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {240--255}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.240}, URN = {urn:nbn:de:0030-drops-34964}, doi = {10.4230/LIPIcs.RTA.2012.240}, annote = {Keywords: triangulation,codeterminism,completion,(co)confluence,(co)termination} }
Christian Sattler and Florent Balestrieri. Turing-Completeness of Polymorphic Stream Equation Systems. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 256-271, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{sattler_et_al:LIPIcs.RTA.2012.256, author = {Sattler, Christian and Balestrieri, Florent}, title = {{Turing-Completeness of Polymorphic Stream Equation Systems}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {256--271}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.256}, URN = {urn:nbn:de:0030-drops-34970}, doi = {10.4230/LIPIcs.RTA.2012.256}, annote = {Keywords: turing-completeness, polymorphic stream functions} }
Manfred Schmidt-Schauß. Matching of Compressed Patterns with Character-Variables. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 272-287, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{schmidtschau:LIPIcs.RTA.2012.272, author = {Schmidt-Schau{\ss}, Manfred}, title = {{Matching of Compressed Patterns with Character-Variables}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {272--287}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.272}, URN = {urn:nbn:de:0030-drops-34981}, doi = {10.4230/LIPIcs.RTA.2012.272}, annote = {Keywords: matching, grammar-based compression, partial words} }
Paula Severi and Fer-Jan de Vries. Meaningless Sets in Infinitary Combinatory Logic. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 288-304, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{severi_et_al:LIPIcs.RTA.2012.288, author = {Severi, Paula and de Vries, Fer-Jan}, title = {{Meaningless Sets in Infinitary Combinatory Logic}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {288--304}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.288}, URN = {urn:nbn:de:0030-drops-34993}, doi = {10.4230/LIPIcs.RTA.2012.288}, annote = {Keywords: Infinitary Rewriting, Combinatory Logic, Meaningless Sets, Confluence, Normalisation} }
Max Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn Talcott, and Ranko Perovic. A Rewriting Framework for Activities Subject to Regulations. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 305-322, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{kanovich_et_al:LIPIcs.RTA.2012.305, author = {Kanovich, Max and Ban Kirigin, Tajana and Nigam, Vivek and Scedrov, Andre and Talcott, Carolyn and Perovic, Ranko}, title = {{A Rewriting Framework for Activities Subject to Regulations}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {305--322}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.305}, URN = {urn:nbn:de:0030-drops-35000}, doi = {10.4230/LIPIcs.RTA.2012.305}, annote = {Keywords: Multiset Rewrite Systems, Collaborative Systems, Applications of Rewrite Systems, Clinical Investigations, Maude} }
Kazushige Terui. Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 323-338, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{terui:LIPIcs.RTA.2012.323, author = {Terui, Kazushige}, title = {{Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {323--338}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.323}, URN = {urn:nbn:de:0030-drops-35012}, doi = {10.4230/LIPIcs.RTA.2012.323}, annote = {Keywords: simply typed lambda calculus, computational complexity, denotational semantics, intersection types} }
René Thiemann, Guillaume Allais, and Julian Nagele. On the Formalization of Termination Techniques based on Multiset Orderings. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 339-354, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{thiemann_et_al:LIPIcs.RTA.2012.339, author = {Thiemann, Ren\'{e} and Allais, Guillaume and Nagele, Julian}, title = {{On the Formalization of Termination Techniques based on Multiset Orderings}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {339--354}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.339}, URN = {urn:nbn:de:0030-drops-35029}, doi = {10.4230/LIPIcs.RTA.2012.339}, annote = {Keywords: formalization, term rewriting, termination, orderings} }