Term rewriting and application : 18th international conference, RTA 2007, Paris, France, June 26-28, 2007 : proceedings / Franz Baader (ed.).

By: (18th : International Conference on Rewriting Techniques and Applications (18th : 2007 : Paris, France)
Contributor(s): Baader, Franz
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 4533.Publisher: Berlin ; New York : Springer, ©2007Description: 1 online resource (xii, 418 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540734499; 354073449X; 3540734473; 9783540734475; 1281352039; 9781281352033Other title: RTA 2007Subject(s): Rewriting systems (Computer science) -- Congresses | Computer programming -- Congresses | Algorithms -- Congresses | Informatique | Algorithms | Computer programming | Rewriting systems (Computer science) | wiskunde | mathematics | computerwetenschappen | computer sciences | kunstmatige intelligentie | artificial intelligence | logica | logic | programmeertalen | programming languages | algebra | Information and Communication Technology (General) | Informatie- en communicatietechnologie (algemeen)Genre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Term rewriting and application.DDC classification: 511.3 LOC classification: QA267 | .I555 2007ebOnline resources: Click here to access online
Contents:
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.
In: Springer e-booksSummary: Annotation This book constitutes the refereed proceedings of the 18th International Conference on Rewriting Techniques and Applications, RTA 2007, held in Paris, France in June 2007 in conjunction with TLCA 2007, the 8th International Conference on Typed Lambda Calculi and Applications as part of RDP 2007, the 4th International Conference on Rewriting, Deduction, and Programming. The 24 revised full papers and 3 systems description papers were carefully reviewed and selected from 69 initial submissions and are presented together with 3 invited talks. The papers cover current research on all aspects of rewriting featuring applications, foundational issues, frameworks, implementations, as well as semantics.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and index.

Annotation This book constitutes the refereed proceedings of the 18th International Conference on Rewriting Techniques and Applications, RTA 2007, held in Paris, France in June 2007 in conjunction with TLCA 2007, the 8th International Conference on Typed Lambda Calculi and Applications as part of RDP 2007, the 4th International Conference on Rewriting, Deduction, and Programming. The 24 revised full papers and 3 systems description papers were carefully reviewed and selected from 69 initial submissions and are presented together with 3 invited talks. The papers cover current research on all aspects of rewriting featuring applications, foundational issues, frameworks, implementations, as well as semantics.

Print version record.

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.

University staff and students only. Requires University Computer Account login off-campus.

There are no comments for this item.

to post a comment.

Powered by Koha