Model Checking TLR* Guarantee Formulas on Infinite Systems-Reference-Cited by-同舟云学术

Model Checking TLR* Guarantee Formulas on Infinite Systems

Published:2014 Issue: Volume: Page:129-150
ISSN:0302-9743
Container-title:Specification, Algebra, and Software
language:
Short-container-title:

Author:

Martín Óscar,Verdejo Alberto,Martí-Oliet Narciso

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-54624-2_7

Reference23 articles.

1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS, pp. 313–321. IEEE Computer Society Press (1996)

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

3. Lecture Notes in Computer Science;K. Bae,2010

4. Lecture Notes in Computer Science;K. Bae,2011

5. Lecture Notes in Computer Science;K. Bae,2012

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

1. Strategies, model checking and branching-time properties in Maude;Journal of Logical and Algebraic Methods in Programming;2021-11

2. Compositional Specification in Rewriting Logic;Theory and Practice of Logic Programming;2019-10-09

3. A formal model of data access for multicore architectures with multilevel caches;Science of Computer Programming;2019-06

4. A Formal Model of Parallel Execution on Multicore Architectures with Multilevel Caches;Formal Aspects of Component Software;2017

5. Egalitarian State-Transition Systems;Rewriting Logic and Its Applications;2016