KI-Beratung Beta

  • Produktbild: Term Rewriting and Applications
  • Produktbild: Term Rewriting and Applications
Band 4098

Term Rewriting and Applications 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings

49,99 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

FLoC Plenary Talk.- Formal Verification of Infinite State Systems Using Boolean Methods.- Session 1. Constraints and Optimization.- Solving Partial Order Constraints for LPO Termination.- Computationally Equivalent Elimination of Conditions.- On the Correctness of Bubbling.- Propositional Tree Automata.-...

Beschreibung

FLoC Plenary Talk.- Formal Verification of Infinite State Systems Using Boolean Methods.- Session 1. Constraints and Optimization.- Solving Partial Order Constraints for LPO Termination.- Computationally Equivalent Elimination of Conditions.- On the Correctness of Bubbling.- Propositional Tree Automata.- Session 2. Equational Reasoning.- Generalizing Newman's Lemma for Left-Linear Rewrite Systems.- Unions of Equational Monadic Theories.- Modular Church-Rosser Modulo.- Session 3. System Verification.- Hierarchical Combination of Intruder Theories.- Feasible Trace Reconstruction for Rewriting Approximations.- Invited Talk.- Rewriting Models of Boolean Programs.- Session 4. Lambda Calculus.- Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear ?-Calculus.- A Terminating and Confluent Linear Lambda Calculus.- A Lambda-Calculus with Constructors.- Structural Proof Theory as Rewriting.- Session 5. Theorem Proving.- Checking Conservativity of Overloaded Definitions in Higher-Order Logic.- Certified Higher-Order Recursive Path Ordering.- Dealing with Non-orientable Equations in Rewriting Induction.- Session 6. System Descriptions.- TPA: Termination Proved Automatically.- RAPT: A Program Transformation System Based on Term Rewriting.- The CL-Atse Protocol Analyser.- Slothrop: Knuth-Bendix Completion with a Modern Termination Checker.- Invited Talk.- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages.- Session 7. Termination.- Predictive Labeling.- Termination of String Rewriting with Matrix Interpretations.- Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems.- Proving Positive Almost Sure Termination Under Strategies.- Session 8. Higher-Order Rewriting andUnification.- A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property.- Higher-Order Orderings for Normal Rewriting.- Bounded Second-Order Unification Is NP-Complete.

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

26.07.2006

Abbildungen

XIV, 418 p.

Herausgeber Frank Pfenning

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

26.07.2006

Abbildungen

XIV, 418 p.

Herausgeber Frank Pfenning
Verlag Springer Berlin
Seitenzahl

418

Maße (L/B/H)

23,5/15,5/2,4 cm

Gewicht

657 g

Auflage

2006

Sprache

Englisch

ISBN

978-3-540-36834-2

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

  • Produktbild: Term Rewriting and Applications
  • Produktbild: Term Rewriting and Applications
  • FLoC Plenary Talk.- Formal Verification of Infinite State Systems Using Boolean Methods.- Session 1. Constraints and Optimization.- Solving Partial Order Constraints for LPO Termination.- Computationally Equivalent Elimination of Conditions.- On the Correctness of Bubbling.- Propositional Tree Automata.- Session 2. Equational Reasoning.- Generalizing Newman’s Lemma for Left-Linear Rewrite Systems.- Unions of Equational Monadic Theories.- Modular Church-Rosser Modulo.- Session 3. System Verification.- Hierarchical Combination of Intruder Theories.- Feasible Trace Reconstruction for Rewriting Approximations.- Invited Talk.- Rewriting Models of Boolean Programs.- Session 4. Lambda Calculus.- Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear ?-Calculus.- A Terminating and Confluent Linear Lambda Calculus.- A Lambda-Calculus with Constructors.- Structural Proof Theory as Rewriting.- Session 5. Theorem Proving.- Checking Conservativity of Overloaded Definitions in Higher-Order Logic.- Certified Higher-Order Recursive Path Ordering.- Dealing with Non-orientable Equations in Rewriting Induction.- Session 6. System Descriptions.- TPA: Termination Proved Automatically.- RAPT: A Program Transformation System Based on Term Rewriting.- The CL-Atse Protocol Analyser.- Slothrop: Knuth-Bendix Completion with a Modern Termination Checker.- Invited Talk.- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages.- Session 7. Termination.- Predictive Labeling.- Termination of String Rewriting with Matrix Interpretations.- Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems.- Proving Positive Almost Sure Termination Under Strategies.- Session 8. Higher-Order Rewriting andUnification.- A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property.- Higher-Order Orderings for Normal Rewriting.- Bounded Second-Order Unification Is NP-Complete.