Predicate Abstraction of Rewrite Theories-Reference-Cited by-同舟云学术

Predicate Abstraction of Rewrite Theories

Published:2014 Issue: Volume: Page:61-76
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bae Kyungmin,Meseguer José

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-08918-8_5

Reference25 articles.

1. Lecture Notes in Computer Science;P.A. Abdulla,2010

2. Lecture Notes in Computer Science;J. Avenhaus,1994

3. Baader, F., Snyder, W.: Unification theory. In: Handbook of Automated Reasoning, pp. 445–532. Elsevier and MIT Press (2001)

4. Bae, K., Escobar, S., Meseguer, J.: Abstract logical model checking of infinite-state systems using narrowing. In: RTA. LIPIcs, vol. 21, pp. 81–96 (2013)

5. Ball, T., Majumdar, R., Millstein, T., Rajamani, S.K.: Automatic predicate abstraction of C programs. ACM SIGPLAN Notices 36(5), 203–213 (2001)

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

1. Narrowing and heuristic search for symbolic reachability analysis of concurrent object-oriented systems;Science of Computer Programming;2024-07

2. Verifying Invariants by Deductive Model Checking;Lecture Notes in Computer Science;2024

3. Optimization Techniques for Model Checking Leads-to Properties in a Stratified Way;ACM Transactions on Software Engineering and Methodology;2023-09-30

4. Compositional Verification in Rewriting Logic;Theory and Practice of Logic Programming;2023-08-31

5. Towards Scalable Model Checking of Reflective Systems via Labeled Transition Systems;IEEE Transactions on Software Engineering;2023-03-01