Combining Theorem Proving and Narrowing for Rewriting-Logic Specifications-Reference-Cited by-同舟云学术

Combining Theorem Proving and Narrowing for Rewriting-Logic Specifications

Published:2010 Issue: Volume: Page:135-150
ISSN:0302-9743
Container-title:Tests and Proofs
language:
Short-container-title:

Author:

Rusu Vlad

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-13977-2_12.pdf

Reference22 articles.

1. Martí-Oliet, N., Meseguer, J.: Rewriting logic: roadmap and bibliography. TCS 285(2), 121–154 (2002)

2. Meseguer, J., Rosu, G.: The rewriting logic semantics project. TCS 373(3), 213–237 (2007)

3. Meseguer, J., Thati, P.: Symbolic reachability analysis using narrowing and its application to the verification of cryptographic protocols. Higher-Order and Symbolic Computation 20(1-2), 123–160 (2007)

4. Eker, S., Knapp, M., Laderoute, K., Lincoln, P., Meseguer, J., Sönmez, M.K.: Pathway logic: Symbolic analysis of biological signaling. In: Pacific Symposium on Biocomputing, pp. 400–412 (2002)

5. Lecture Notes in Computer Science,2007

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Variant-based Equational Unification under Constructor Symbols;Electronic Proceedings in Theoretical Computer Science;2020-09-19

2. Most General Variant Unifiers;Electronic Proceedings in Theoretical Computer Science;2019-09-19

3. Associative Unification and Symbolic Reasoning Modulo Associativity in Maude;Rewriting Logic and Its Applications;2018

4. Built-in Variant Generation and Unification, and Their Applications in Maude 2.7;Automated Reasoning;2016

5. Verifying Reachability-Logic Properties on Rewriting-Logic Specifications;Lecture Notes in Computer Science;2015