LEADER 04250nam  22007575  450 
001 996465337003316
005 20230221020934.0
010   $a3-540-73449-X
024 7 $a10.1007/978-3-540-73449-9
035   $a(CKB)1000000000491020
035   $a(SSID)ssj0000320333
035   $a(PQKBManifestationID)11235212
035   $a(PQKBTitleCode)TC0000320333
035   $a(PQKBWorkID)10348129
035   $a(PQKB)11212809
035   $a(DE-He213)978-3-540-73449-9
035   $a(MiAaPQ)EBC3063275
035   $a(MiAaPQ)EBC6694654
035   $a(Au-PeEL)EBL6694654
035   $a(PPN)123163471
035   $a(EXLCZ)991000000000491020
100   $a20100301d2007      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aTerm Rewriting and Applications$b[electronic resource] $e18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings /$fedited by Franz Baader
205   $a1st ed. 2007.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007.
215   $a1 online resource (XII, 422 p.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4533
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-73447-3 
320   $aIncludes bibliographical references and index.
327   $aFormal Verification of an Optimizing Compiler -- Challenges in Satisfiability Modulo Theories -- On a Logical Foundation for Explicit Substitutions -- Intruders with Caps -- Tom: Piggybacking Rewriting on Java -- Rewriting Approximations for Fast Prototyping of Static Analyzers -- Determining Unify-Stable Presentations -- Confluence of Pattern-Based Calculi -- A Simple Proof That Super-Consistency Implies Cut Elimination -- Bottom-Up Rewriting Is Inverse Recognizability Preserving -- Adjunction for Garbage Collection with Application to Graph Rewriting -- Non Strict Confluent Rewrite Systems for Data-Structures with Pointers -- Symbolic Model Checking of Infinite-State Systems Using Narrowing -- Delayed Substitutions -- Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems -- Termination of Rewriting with Right-Flat Rules -- Abstract Critical Pairs and Confluence of Arbitrary Binary Relations -- On the Completeness of Context-Sensitive Order-Sorted Specifications -- KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis -- Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi -- Proving Termination of Rewrite Systems Using Bounds -- Sequence Unification Through Currying -- The Termination Competition -- Random Descent -- Correctness of Copy in Calculi with Letrec -- A Characterization of Medial as Rewriting Rule -- The Maximum Length of Mu-Reduction in Lambda Mu-Calculus -- On Linear Combinations of ?-Terms -- Satisfying KBO Constraints -- Termination by Quasi-periodic Interpretations.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4533
606   $aCompilers (Computer programs)
606   $aMachine theory
606   $aComputer science
606   $aArtificial intelligence
606   $aComputer science?Mathematics
606   $aCompilers and Interpreters
606   $aFormal Languages and Automata Theory
606   $aComputer Science Logic and Foundations of Programming
606   $aArtificial Intelligence
606   $aSymbolic and Algebraic Manipulation
615  0$aCompilers (Computer programs).
615  0$aMachine theory.
615  0$aComputer science.
615  0$aArtificial intelligence.
615  0$aComputer science?Mathematics.
615 14$aCompilers and Interpreters.
615 24$aFormal Languages and Automata Theory.
615 24$aComputer Science Logic and Foundations of Programming.
615 24$aArtificial Intelligence.
615 24$aSymbolic and Algebraic Manipulation.
676   $a006.3
702   $aBaader$b Franz
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996465337003316
996   $aTerm Rewriting and Applications$9772114
997   $aUNISA