Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking

Bollig, Benedikt; Aiswarya, C.; Gastin, Paul; Zeitoun, Marc

doi:10.1007/978-3-642-22993-0_15

Cited by 10 publications

(7 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the setting of infinite runs, [1] describes a 2-Exptime decision procedure for the repeated reachability and LTL model-checking problems for OMPDSs and bounded-phase MPDSs (also see [6]). Recently, [24] and [4] show that LTL model checking for bounded scope systems can be solved in Exptime.…”

Section: Introductionmentioning

confidence: 99%

Adjacent Ordered Multi-Pushdown Systems

Atig

Kumar

Prakash

2014

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

Multi-pushdown systems are formal models of multi-threaded programs. As they are Turing powerful in their full generality, several decidable subclasses, constituting underapproximations of the original system, have been studied in the recent years. Ordered Multi-Pushdown Systems (OMPDSs) impose an order on the stacks and limit pop actions to the lowest non-empty stack. The control state reachability for OMPDSs is 2-Etime-Complete. We propose a restriction on OMPDSs, called Adjacent OMPDSs (AOMPDS), where values may be pushed only on the lowest non-empty stack or one of its two neighbours. We describe Exptime decision procedures for reachability and LTL model-checking and establish matching lower bounds. We demonstrate the utility of this model as an algorithmic tool via optimal reductions from other models.

show abstract

Section: Introductionmentioning

confidence: 99%

Adjacent Ordered Multi-Pushdown Systems

Atig

Kumar

Prakash

2014

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…The model is repeatedly refining, as needed, like in the SLAM tool [7], SATABS [12] etc. For concurrency, a natural way to extend this model would be to consider pushdown automata with multiple stacks, which has seen significant interest in the recent past [2,3,9,15]. This is the main object of study in this paper which we call multi-pushdown systems.…”

Section: Introductionmentioning

confidence: 99%

“…-Multi-CaRet model-checking over multi-pushdown systems with k-phase bounded runs [24] is in 2EXPTIME when k encoded in unary, and it is in 3-EXPTIME if the encoding is binary. Note that this problem can be encoded from developments in [9] but the EXPTIME upper bound from [9] applies when the number of phases is fixed. Otherwise, one gets an 3EXPTIME upper bound if k is encoded in binary.…”

Section: Introductionmentioning

confidence: 99%

Model-Checking Bounded Multi-Pushdown Systems

Bansal

Demri

2013

Computer Science – Theory and Applications

View full text Add to dashboard Cite

In this note, we provide complexity characterizations of model checking multi-pushdown systems. Multi-pushdown systems model recursive concurrent programs in which any sequential process has a finite control. We consider three standard notions for boundedness: context boundedness, phase boundedness and stack ordering. The logical formalism is a linear-time temporal logic extending well-known logic CaRet but dedicated to multi-pushdown systems in which abstract operators (related to calls and returns) such as those for next-time and until are parameterized by stacks. We show that the problem is EXPTIME-complete for context-bounded runs and unary encoding of the number of context switches; we also prove that the problem is 2EXPTIME-complete for phasebounded runs and unary encoding of the number of phase switches. In both cases, the value k is given as an input (whence it is not a constant of the model-checking problem), which makes a substantial difference in the complexity. In certain cases, our results improve previous complexity results.

show abstract

“…A general temporal logic for concurrent programs which subsumes Multi-CaRet is introduced in [6]. However, the decidability results there are obtained by restricting the computations to a bounded number of phases [10], where in each phase pop transitions are all from the same stack.…”

Section: Introductionmentioning

confidence: 99%

“…It is not known a relation between these two last restrictions. We also note that the approach followed here is completely different from [6].…”

Section: Introductionmentioning

confidence: 99%

A Temporal Logic for Multi-threaded Programs

Torre

Napoli

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Temporal logics for nested words are a specification formalism for procedural programs, since they express requirements about matching calls and returns. We extend this formalism to multiply nested words, which are natural models of the computations of concurrent programs. We study both the satisfiability and the model-checking problems, when the multiply nested words are runs of multi-stack pushdown systems (Mpds). In particular, through a tableau-based construction, we define a Büchi Mpds for the models of a given formula. As expected both problems are undecidable, thus we consider some meaningful restrictions on the Mpds, and show decidability for the considered problems.

show abstract

Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking

Cited by 10 publications

References 23 publications

Adjacent Ordered Multi-Pushdown Systems

Adjacent Ordered Multi-Pushdown Systems

Model-Checking Bounded Multi-Pushdown Systems

A Temporal Logic for Multi-threaded Programs

Contact Info

Product

Resources

About