Sentence-normalized conditional narrowing modulo in rewriting logic and Maude
From MaRDI portal
Publication:1655486
DOI10.1007/S10817-017-9417-5zbMATH Open1398.68267OpenAlexW2295833488WikidataQ123905811 ScholiaQ123905811MaRDI QIDQ1655486FDOQ1655486
Authors: Narciso Martí-Oliet, Miguel Palomino, Isabel Pita, Luis Antonio Aguirre 
Publication date: 9 August 2018
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-017-9417-5
Recommendations
- Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude
- Conditional narrowing modulo in rewriting logic and Maude
- Reachability in conditional term rewriting systems
- Narrowing and rewriting logic: from foundations to applications
- A constructor-based reachability logic for rewrite theories
Cites Work
- Maude: specification and programming in rewriting logic
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- A needed narrowing strategy
- Title not available (Why is that?)
- Operational termination of conditional term rewriting systems
- Twenty years of rewriting logic
- Proving operational termination of membership equational programs
- Semantic foundations for generalized rewrite theories
- Rewriting modulo SMT and open system analysis
- MTT: The Maude Termination Tool (System Description)
- Title not available (Why is that?)
- Operational termination of membership equational programs: the order-sorted way
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- 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
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Rewriting logic: Roadmap and bibliography
- Narrowing based inductive proof search
- Completeness results for basic narrowing
- Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations
- Reachability in conditional term rewriting systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conditional narrowing modulo a set of equations
- Completion of rewrite systems with membership constraints. I: Deduction rules
- Completion of rewrite systems with membership constraints. II: Constraint solving
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- Folding variant narrowing and optimal variant termination
- Strict coherence of conditional rewriting modulo axioms
- Conditional narrowing modulo in rewriting logic and Maude
- Infinite-state model checking of LTLR formulas using narrowing
- Model checking LTLR formulas under localized fairness
- Title not available (Why is that?)
Cited In (4)
Uses Software
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 Q1655486)
