Term Rewriting and Applications [[electronic resource] ] : 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings / / edited by Franz Baader
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Titolo: |
Term Rewriting and Applications [[electronic resource] ] : 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings / / edited by Franz Baader
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Edizione: | 1st ed. 2007. |
| Descrizione fisica: | 1 online resource (XII, 422 p.) |
| Disciplina: | 006.3 |
| Soggetto topico: | Compilers (Computer programs) |
| Machine theory | |
| Computer science | |
| Artificial intelligence | |
| Computer science—Mathematics | |
| Compilers and Interpreters | |
| Formal Languages and Automata Theory | |
| Computer Science Logic and Foundations of Programming | |
| Artificial Intelligence | |
| Symbolic and Algebraic Manipulation | |
| Persona (resp. second.): | BaaderFranz |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di bibliografia: | Includes bibliographical references and index. |
| Nota di contenuto: | Formal 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. |
| Titolo autorizzato: | Term Rewriting and Applications |
| ISBN: | 3-540-73449-X |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996465337003316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |
Serie:
Theoretical Computer Science and General Issues, . 2512-2029 ; ; 4533