Algorithmic Analysis of Programs with Well Quasi-ordered Domains-Reference-Cited by-同舟云学术

Algorithmic Analysis of Programs with Well Quasi-ordered Domains

Author:

Abdulla Parosh Aziz,Čerāns Kārlis,Jonsson Bengt,Tsay Yih-Kuen

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference29 articles.

1. Model-checking for real-time systems;Alur,1990

2. A really temporal logic;Alur,1989

3. Verifying programs with unreliable channels;Abdulla,1993

5. Decidability of simulation and bisimulation between lossy channel systems and finite state systems;Abdulla,1995

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

1. Resilience and Home-Space for WSTS;Lecture Notes in Computer Science;2023-12-30

3. Parameterized Verification under TSO with Data Types;Tools and Algorithms for the Construction and Analysis of Systems;2023

4. Runtime Complexity Bounds Using Squeezers;ACM Transactions on Programming Languages and Systems;2022-07-15

5. What’s Decidable About Causally Consistent Shared Memory?;ACM Transactions on Programming Languages and Systems;2022-04-06