A Temporal Logic for Multi-threaded Programs

Torre, Salvatore La; Napoli, Margherita

doi:10.1007/978-3-642-33475-7_16

Cited by 15 publications

(17 citation statements)

References 15 publications

(28 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Among the problems that have been shown decidable using this principle we have: (1) state reachability problem [19], model-checking of LTL [3,16], and generalised LTL [15] for various restrictions of multi-stack PDA [23,12,2,14], and (2) the reachability problem [19,10] for subclasses of distributed automata that communicate through unbounded queues [13,11]. The surprising aspect is that the new proofs are uniform and radically different from the ones previously proposed in the literature which are specifically crafted using different techniques on a case-by-case basis.…”

Section: Introductionmentioning

confidence: 99%

On the Path-Width of Integer Linear Programming

Enea¹,

Habermehl²,

Inverso³

et al. 2014

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution there may be many graphs representing it. However, one of these graphs is of path-width at most 2n, where n is the number of variables in the instance. Since FO is decidable on graphs of bounded path- width, we obtain an alternative decidability result for ILP. The technique we use underlines a common principle to prove decidability which has previously been employed for automata with auxiliary storage. We also show how this new result links to automata theory and program verification.Comment: In Proceedings GandALF 2014, arXiv:1408.556

show abstract

Section: Introductionmentioning

confidence: 99%

On the Path-Width of Integer Linear Programming

Enea¹,

Habermehl²,

Inverso³

et al. 2014

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…In this paper, we generalize the automatabased approach for LTL to a linear-time temporal logic for multi-pushdown systems. A similar approach have been also followed in the recent works [6,26]. Let us explain below the main differences with the present work.…”

Section: Introductionmentioning

confidence: 92%

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

“…Perhaps counterintuitively, our restriction actually increases expressivity: Atig et al show inter-reducibility between reachability in their model and Petri-net coverability, while in our model the more severe restriction allows us to inter-reduce with coverability of reset Petri-nets. The scope-bounded restriction has recently been relaxed for multi-stack pushdown systems by La Torre and Napoli [25]. In their setting, a character that is popped from a particular stack may must have been pushed within k active contexts of that stack.…”

Section: Related Workmentioning

confidence: 99%

Senescent ground tree rewrite systems

Hague

2014

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Nin

View full text Add to dashboard Cite

Ground Tree Rewrite Systems with State are known to have an undecidable control state reachability problem. Taking inspiration from the recent introduction of scope-bounded multi-stack pushdown systems, we define Senescent Ground Tree Rewrite Systems. These are a restriction of ground tree rewrite systems with state such that nodes of the tree may no longer be rewritten after having witnessed an a priori fixed number of control state changes. As well as generalising scope-bounded multi-stack pushdown systems, we show -via reductions to and from reset Petri-nets -that these systems have an Ackermann-complete control state reachability problem. However, reachability of a regular set of trees remains undecidable.

show abstract

A Temporal Logic for Multi-threaded Programs

Cited by 15 publications

References 15 publications

On the Path-Width of Integer Linear Programming

On the Path-Width of Integer Linear Programming

Model-Checking Bounded Multi-Pushdown Systems

Senescent ground tree rewrite systems

Contact Info

Product

Resources

About