Pushdown automata (PDA) are a good model of recursive programs which also have good algorithmic properties. For example “reachability ” for PDA is decidable, allowing one to automatically check whether a program modelled by the PDA is “safe”—i.e. that it cannot “reach an error state”. But what happens if one wants to model a recursive program featuring more than one thread of execution? A nave idea would be to generalise pushdown automata by allowing them multiple stacks—one for each thread. Unfortunately, as is well known, PDAs with more than one stack are as powerful as Turing machines; this precludes the possibility of them having any interesting decidable properties. One possible approach to this problem is to impose constraints on the ...
Abstract. In this note, we provide complexity characterizations of model checking multi-pushdown sys...
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order sta...
Multi-stack pushdown systems are a well-studied model of concurrent computation using threads with f...
Abstract. Verification of concurrent programs modelled as multi-stack machines is an active research...
Well-structured pushdown systems (WSPDSs) extend pushdown systems with well-quasi-ordered (possibly ...
Abstract. We propose a sound, complete, and automatic method for pairwise reachability analysis of h...
Higher-order recursion schemes (HORS) have recently received much attention as a useful abstraction ...
Visibly Pushdown Automata (VPA) are a special case of pushdown machines where the stack operations a...
Pushdown systems (PDSs) nicely model single-thread recursive programs, and well-structured transitio...
Abstract. Pushdown systems (PDS) naturally model sequential recur-sive programs. Numeric data types ...
Formal methods provide means for rigorously specifying the desired behaviour of a hardware or softwa...
Pushdown systems equip a finite state system with an unbounded stack memory, and are thus infinite s...
Pushdown systems equip a finite state system with an unbounded stack memory, and are thus infinite s...
International audienceWe define and study an automata model of concurrent recursive programs. An aut...
Abstract—We consider the linear-time model checking prob-lem for boolean concurrent programs with re...
Abstract. In this note, we provide complexity characterizations of model checking multi-pushdown sys...
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order sta...
Multi-stack pushdown systems are a well-studied model of concurrent computation using threads with f...
Abstract. Verification of concurrent programs modelled as multi-stack machines is an active research...
Well-structured pushdown systems (WSPDSs) extend pushdown systems with well-quasi-ordered (possibly ...
Abstract. We propose a sound, complete, and automatic method for pairwise reachability analysis of h...
Higher-order recursion schemes (HORS) have recently received much attention as a useful abstraction ...
Visibly Pushdown Automata (VPA) are a special case of pushdown machines where the stack operations a...
Pushdown systems (PDSs) nicely model single-thread recursive programs, and well-structured transitio...
Abstract. Pushdown systems (PDS) naturally model sequential recur-sive programs. Numeric data types ...
Formal methods provide means for rigorously specifying the desired behaviour of a hardware or softwa...
Pushdown systems equip a finite state system with an unbounded stack memory, and are thus infinite s...
Pushdown systems equip a finite state system with an unbounded stack memory, and are thus infinite s...
International audienceWe define and study an automata model of concurrent recursive programs. An aut...
Abstract—We consider the linear-time model checking prob-lem for boolean concurrent programs with re...
Abstract. In this note, we provide complexity characterizations of model checking multi-pushdown sys...
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order sta...
Multi-stack pushdown systems are a well-studied model of concurrent computation using threads with f...