نتایج جستجو برای: تحلیل pushdown

تعداد نتایج: 238311  

Journal: :J. Applied Logic 2008
Stefan Göller Dirk Nowotka

Recently visibly pushdown automata have been extended to so called k-phase multistack visibly pushdown automata (k-MVPAs). On the occasion of introducing kMVPAs, it has been asked whether the extension of Propositional Dynamic Logic with k-MVPAs still leads to a decidable logic. This question is answered negatively here.

Journal: :CoRR 2014
Gilles Dowek Ying Jiang

We give a new proof of the decidability of reachability in alternating pushdown systems, showing that it is a simple consequence of a cut-elimination theorem for some natural-deduction style inference systems. Then, we show how this result can be used to extend an alternating pushdown system into a complete system where for every configuration A, either A or ¬A is provable.

2010
Mohamed Faouzi Atig

Verification of concurrent programs modelled as multi-stack machines is an active research area. Recently decidability/complexity results have been established for powerful models such as bounded-phase visibly pushdown automata (BVMPA) [16] and ordered multi-pushdown automata (OMPA) [1]. However, the proofs of these results are quite complex and are based on different techniques and concepts fo...

Journal: :ACM Transactions on Computational Logic 2017

Journal: :Journal of Computer and System Sciences 1978

Journal: :Information and Computation 2001

Journal: :Journal of Computer and System Sciences 1999

Journal: :Journal of Computer and System Sciences 1988

Journal: :ACM Transactions on Computational Logic 2015

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید