Push-Down Automata with Gap-Order Constraints-Reference-Cited by-同舟云学术

Push-Down Automata with Gap-Order Constraints

Published:2013 Issue: Volume: Page:199-216
ISSN:0302-9743
Container-title:Fundamentals of Software Engineering
language:
Short-container-title:

Author:

Abdulla Parosh Aziz,Atig Mohamed Faouzi,Delzanno Giorgio,Podelski Andreas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-40213-5_13

Reference35 articles.

1. Abdulla, P.A., Atig, M.F., Stenman, J.: Dense-timed pushdown automata. In: LICS. IEEE Computer Society (2012)

2. Abdulla, P.A., Atig, M.F., Stenman, J.: The minimal Cost reachability problem in priced timed pushdown systems. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 58–69. Springer, Heidelberg (2012)

3. Abdulla, P.A., Delzanno, G.: On the coverability problem for constrained multiset rewriting. In: Proc. AVIS 2006, 5th Int. Workshop on on Automated Verification of Infinite-State Systems (2006)

4. Abdulla, P.A.: Well (and Better) Quasi-Ordered Transition Systems. The Bulletin of Symbolic Logic 16(4), 457–515 (2010)

5. Abdulla, P.A., Atig, M.F., Cederberg, J.: Timed lossy channel systems. In: Proc. FSTTCS 2005, 32nd Conf. on Foundations of Software Technology and, Theoretical Computer Science (2012)

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

1. LTL Model Checking for Register Pushdown Systems;IEICE Transactions on Information and Systems;2021-12-01

2. Reachability in Database-driven Systems with Numerical Attributes under Recency Bounding;Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '19;2019

3. Data Communicating Processes with Unreliable Channels;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05

4. Data Communicating Processes with Unreliable Channels;2016

5. It is pointless to point in bounded heaps;Science of Computer Programming;2015-11