Generalized Rewrite Theories and Coherence Completion-Reference-Cited by-同舟云学术

Generalized Rewrite Theories and Coherence Completion

Published:2018 Issue: Volume: Page:164-183
ISSN:0302-9743
Container-title:Rewriting Logic and Its Applications
language:
Short-container-title:

Author:

Meseguer José

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-99840-4_10

Reference28 articles.

1. Arusoaie, A., Lucanu, D., Rusu, V.: Symbolic execution based on language transformation. Comput. Lang. Syst. Struct. 44, 48–71 (2015)

2. Bae, K., Escobar, S., Meseguer, J.: Abstract logical model checking of infinite-state systems using narrowing. In: Rewriting Techniques and Applications (RTA 2013). LIPIcs, vol. 21, pp. 81–96. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2013)

3. Bruni, R., Meseguer, J.: Semantic foundations for generalized rewrite theories. Theor. Comput. Sci. 360(1–3), 386–414 (2006)

4. Lecture Notes in Computer Science;M Clavel,2007

5. Lecture Notes in Computer Science;H Comon-Lundh,2005

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

1. Operationally-based program equivalence proofs using LCTRSs;Journal of Logical and Algebraic Methods in Programming;2023-10

2. A Constructor-Based Reachability Logic for Rewrite Theories;Fundamenta Informaticae;2020-03-31

3. Generalized rewrite theories, coherence completion, and symbolic methods;Journal of Logical and Algebraic Methods in Programming;2020-01

4. Programming and symbolic computation in Maude;Journal of Logical and Algebraic Methods in Programming;2020-01

5. Canonical Narrowing with Irreducibility Constraints as a Symbolic Protocol Analysis Method;Foundations of Security, Protocols, and Equational Reasoning;2019