Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude

DOI10.1007/978-3-319-23165-5_2MaRDI QIDQ2945699zbMATH OpenOpenAlexWikidataFDO

Authors Narciso Martí-Oliet, Miguel Palomino, Isabel Pita, Luis Antonio Aguirre

Publication date 14 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-23165-5_2

zbMATH Keywords

reachabilityunificationrewriting logicMaudenarrowingmembership equational logic

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Logic in computer science (03B70)

Recommendations

• Sentence-normalized conditional narrowing modulo in rewriting logic and Maude
• Conditional narrowing modulo in rewriting logic and Maude
• Conditional rewriting logic: Deduction, models and concurrency
• Normal forms and normal theories in conditional rewriting
• Higher order conditional rewriting and narrowing
• scientific article; zbMATH DE number 4090846
• Nested sequent calculi for normal conditional logics
• Modularisation of sequent calculi for normal and non-normal modalities
• Rewrite rule systems for modal propositional logic
• scientific article; zbMATH DE number 4164138

Cites work

• scientific article; zbMATH DE number 4053008 (Why is no real title available?)
• scientific article; zbMATH DE number 1189278 (Why is no real title available?)
• scientific article; zbMATH DE number 1497855 (Why is no real title available?)
• A needed narrowing strategy
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Completeness results for basic narrowing
• Conditional narrowing modulo a set of equations
• Conditional narrowing modulo in rewriting logic and Maude
• Folding variant narrowing and optimal variant termination
• Infinite-state model checking of LTLR formulas using narrowing
• Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
• Model checking LTLR formulas under localized fairness
• On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
• Operational termination of conditional term rewriting systems
• Operational termination of membership equational programs: the order-sorted way
• Proving operational termination of membership equational programs
• Rewriting logic and its applications. 10th international workshop, WRLA 2014, held as a satellite event of ETAPS, Grenoble, France, April 5--6, 2014. Revised selected papers
• Rewriting logic: Roadmap and bibliography
• Semantic foundations for generalized rewrite theories
• Strict coherence of conditional rewriting modulo axioms
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• Twenty years of rewriting logic

Cited in

(3)

• Strategies in conditional narrowing modulo SMT plus axioms
• Sentence-normalized conditional narrowing modulo in rewriting logic and Maude
• Conditional narrowing modulo in rewriting logic and Maude

Describes a project that uses

Uses Software

• Maude-NPA
• Maude

This page was built for publication: Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945699)