Proceedings of the 23rd International Conference on Rewriting Techniques and Applications
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Ashish Tiwari
Proceedings of the 23rd International Conference on Rewriting Techniques and Applications
RTA, 2012.

Full names Links ISxN
	address       = "Nagoya, Japan",
	editor        = "Ashish Tiwari",
	ee            = "",
	isbn          = "978-3-939897-38-5",
	publisher     = "{Schloss Dagstuhl — Leibniz-Zentrum für Informatik}",
	series        = "{Leibniz International Proceedings in Informatics}",
	title         = "{Proceedings of the 23rd International Conference on Rewriting Techniques and Applications}",
	volume        = 15,
	year          = 2012,

Contents (25 items)

RTA-2012-Anai #algebra #geometry
Computational Real Algebraic Geometry in Practice (HA), p. 1.
RTA-2012-Kirchner #calculus #logic
Rho-Calculi for Computation and Logic (CK), pp. 2–4.
Dictionary-Based Tree Compression (SM), p. 5.
RTA-2012-Accattoli #theorem
An Abstract Factorization Theorem for Explicit Substitutions (BA), pp. 6–21.
RTA-2012-AccattoliL #cost analysis #on the #reduction
On the Invariance of the Unitary Cost Model for Head Reduction (BA, UDL), pp. 22–37.
RTA-2012-Al-HassaniMCS #problem #term rewriting
A Term Rewriting System for Kuratowski’s Closure-Complement Problem (OAH, QaM, CSC, VS), pp. 38–52.
RTA-2012-AndersenS #term rewriting
Term Rewriting Systems as Topological Dynamical Systems (SBA, JGS), pp. 53–68.
RTA-2012-Bahr #graph grammar
Infinitary Term Graph Rewriting is Simple, Sound and Complete (PB), pp. 69–84.
RTA-2012-Balabonski #axiom
Axiomatic Sharing-via-Labelling (TB), pp. 85–100.
RTA-2012-BertrandDKSS #decidability #graph transformation #on the #reachability
On the Decidability Status of Reachability and Coverability in Graph Transformation Systems (NB, GD, BK, AS, JS), pp. 101–116.
RTA-2012-BonelliKLR #calculus #normalisation
Normalisation for Dynamic Pattern Calculi (EB, DK, CL, AR), pp. 117–132.
RTA-2012-CousineauH #proving #semantics
A Semantic Proof that Reducibility Candidates entail Cut Elimination (DC, OH), pp. 133–148.
RTA-2012-CreusGG #unification
One-context Unification with STG-Compressed Terms is in NP (CC, AG, GG), pp. 149–164.
RTA-2012-Felgenhauer #confluence #polynomial #term rewriting
Deciding Confluence of Ground Term Rewrite Systems in Cubic Time (BF), pp. 165–175.
RTA-2012-FuhsK #higher-order #polynomial
Polynomial Interpretations for Higher-Order Rewriting (CF, CK), pp. 176–192.
RTA-2012-GmeinerGS #on the #term rewriting
On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems (KG, BG, FS), pp. 193–208.
Reinterpreting Compression in Infinitary Rewriting (JK), pp. 209–224.
RTA-2012-Lisitsa #automaton #finite #modelling #safety #verification
Finite Models vs Tree Automata in Safety Verification (AL), pp. 225–239.
Triangulation in Rewriting (VvO, HZ), pp. 240–255.
RTA-2012-SattlerB #equation #polymorphism
Turing-Completeness of Polymorphic Stream Equation Systems (CS, FB), pp. 256–271.
Matching of Compressed Patterns with Character-Variables (MSS), pp. 272–287.
RTA-2012-SeveriV #combinator #logic #set
Meaningless Sets in Infinitary Combinatory Logic (PS, FJdV), pp. 288–304.
RTA-2012-KanovichKNSTP #framework #process
A Rewriting Framework for Activities Subject to Regulations (MIK, TBK, VN, AS, CLT, RP), pp. 305–322.
RTA-2012-Terui #complexity #evaluation #semantics #λ-calculus
Semantic Evaluation, Intersection Types and Complexity of Simply Typed λ Calculus (KT), pp. 323–338.
RTA-2012-ThiemannAN #formal method #multi #on the #order #termination
On the Formalization of Termination Techniques based on Multiset Orderings (RT, GA, JN), pp. 339–354.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.