Abstracting and Counting Synchronizing Processes-Reference-Cited by-同舟云学术

Abstracting and Counting Synchronizing Processes

Published:2015 Issue: Volume: Page:227-244
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Ganjei Zeinab,Rezine Ahmed,Eles Petru,Peng Zebo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-46081-8_13

Reference15 articles.

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

2. Lecture Notes in Computer Science;P.A. Abdulla,1999

3. Abdulla, P.A., Čerāns, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: Proc. LICS 1996, 11th IEEE Int. Symp. on Logic in Computer Science, pp. 313–321 (1996)

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

5. Bansal, K., Koskinen, E., Wies, T., Zufferey, D.: Structural counter abstraction. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 62–77. Springer, Heidelberg (2013)

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

1. Thread-modular counter abstraction: automated safety and termination proofs of parameterized software by reduction to sequential program verification;Formal Methods in System Design;2023-10-06

2. Cardinalities and universal quantifiers for verifying parameterized systems;ACM SIGPLAN Notices;2016-08

3. Cardinalities and universal quantifiers for verifying parameterized systems;Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation;2016-06-02

4. Counting dynamically synchronizing processes;International Journal on Software Tools for Technology Transfer;2016-01-21

5. Lazy Constrained Monotonic Abstraction;Lecture Notes in Computer Science;2015-12-25