Sciweavers

FSTTCS
2010
Springer
13 years 9 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To
FSTTCS
2010
Springer
13 years 10 months ago
Global Model Checking of Ordered Multi-Pushdown Systems
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations s...
Mohamed Faouzi Atig
JANCL
2006
74views more  JANCL 2006»
14 years 13 days ago
Linear-time temporal logics with Presburger constraints: an overview
We present an overview of linear-time temporal logics with Presburger constraints whose models are sequences of tuples of integers. Such formal specification languages are welldesi...
Stéphane Demri
ACTA
2010
109views more  ACTA 2010»
14 years 18 days ago
On regular temporal logics with past
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
Christian Dax, Felix Klaedtke, Martin Lange