{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":28,"n_cols":5,"rows_kept":28,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[9,2,9,3],[10,2,10,3],[22,2,22,3],[23,2,23,3],[26,2,26,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465596003316"]
[null,null,"Titolo",null,"Rewriting Techniques and Applications [[electronic resource] ] : 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009 Proceedings / / edited by Ralf Treinen"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009"]
[null,null,"ISBN",null,"3-642-02348-7"]
[null,null,"Edizione",null,"[1st ed. 2009.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 391 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 5595"]
[null,null,"Classificazione",null,"DAT 554f"]
[{"$nulls":4},"SS 4800"]
[null,null,"Disciplina",null,"005.131"]
[null,null,"Soggetti",null,"Machine theory"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Compilers (Computer programs)"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Mathematical logic"]
[{"$nulls":4},"Formal Languages and Automata Theory"]
[{"$nulls":4},"Computer Science Logic and Foundations of Programming"]
[{"$nulls":4},"Compilers and Interpreters"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Symbolic and Algebraic Manipulation"]
[{"$nulls":4},"Mathematical Logic and Foundations"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"Automatic 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 "]
[{"$nulls":4},"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."]