000 03779nam a22006015i 4500
001 978-3-642-02348-4
003 DE-He213
005 20240730192218.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642023484
_9978-3-642-02348-4
024 7 _a10.1007/978-3-642-02348-4
_2doi
050 4 _aQA267-268.5
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.131
_223
245 1 0 _aRewriting Techniques and Applications
_h[electronic resource] :
_b20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009 Proceedings /
_cedited by Ralf Treinen.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aXII, 391 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5595
505 0 _aAutomatic Termination -- Loops under Strategies -- Proving Termination of Integer Term Rewriting -- Dependency Pairs and Polynomial Path Orders -- Unique Normalization for Shallow TRS -- The Existential Fragment of the One-Step Parallel Rewriting Theory -- Proving Confluence of Term Rewriting Systems Automatically -- A Proof Theoretic Analysis of Intruder Theories -- Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case -- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions -- YAPA: A Generic Tool for Computing Intruder Knowledge -- Well-Definedness of Streams by Termination -- Modularity of Convergence in Infinitary Rewriting -- A Heterogeneous Pushout Approach to Term-Graph Transformation -- An Explicit Framework for Interaction Nets -- Dual Calculus with Inductive and Coinductive Types -- Comparing Böhm-Like Trees -- The Derivational Complexity Induced by the Dependency Pair Method -- Local Termination -- VMTL-A Modular Termination Laboratory -- Tyrolean Termination Tool 2 -- From Outermost to Context-Sensitive Rewriting -- A Fully Abstract Semantics for Constructor Systems -- The -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity) -- Unification in the Description Logic -- Unification with Singleton Tree Grammars -- Unification and Narrowing in Maude 2.4.
650 0 _aMachine theory.
_9149038
650 0 _aComputer science.
_99832
650 0 _aCompilers (Computer programs).
_93350
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aMathematical logic.
_92258
650 1 4 _aFormal Languages and Automata Theory.
_9149039
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aSymbolic and Algebraic Manipulation.
_955589
650 2 4 _aMathematical Logic and Foundations.
_934712
700 1 _aTreinen, Ralf.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9149040
710 2 _aSpringerLink (Online service)
_9149041
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642023477
776 0 8 _iPrinted edition:
_z9783642023491
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5595
_9149042
856 4 0 _uhttps://doi.org/10.1007/978-3-642-02348-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94131
_d94131