Empirically Efficient Verification for a Class of Infinite-State Systems-Reference-Cited by-同舟云学术

Empirically Efficient Verification for a Class of Infinite-State Systems

Published:2005 Issue: Volume: Page:77-92
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Bingham Jesse,Hu Alan J.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-31980-1_6.pdf

Reference30 articles.

1. Abdulla, P., Jonsson, B.: Verifying programs with unreliable channels. In: Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science, pp. 160–170 (1993)

2. Abdulla, P.A., Cerans, K., Jonsson, B., Yih-Kuen, T.: General decidability theorems for infinite-state systems. In: 10th Annual IEEE Symp. on Logic in Computer Science (LICS 1996), pp. 313–321 (1996)

3. Lecture Notes in Computer Science;A. Annichini,2001

4. Bingham, J.: A new approach to upward closed set backward reachability analysis. In: 6th International Workshop on Verification of Infinite-State Systems, INFINITY (2004)

5. Lecture Notes in Computer Science;J. Bingham,2005

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

1. Parameterized verification of monotone information systems;Formal Aspects of Computing;2018-08

2. Parameterized verification through view abstraction;International Journal on Software Tools for Technology Transfer;2015-11-23

3. Lost in Abstraction: Monotonicity in Multi-threaded Programs;CONCUR 2014 – Concurrency Theory;2014

4. All for the Price of Few;Lecture Notes in Computer Science;2013

5. Automated Multiparameterised Verification by Cut-Offs;Formal Methods and Software Engineering;2010