Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata
in which every symbol in the stack has a link to a stack situated somewhere below it. In …

The design and implementation of decision procedures for checking path feasibility in string-manipulating
programs is an important problem, with such applications as symbolic …

Regular expressions are a classical concept in formal language theory. Regular expressions
in programming languages (RegEx) such as JavaScript, feature non-standard semantics of …

RFID technology has been around for quite a long time, however, due to issues like cost has
not achieved mass-market appeal. This paper examines the differences and advantages of …

The theory of strings with concatenation has been widely argued as the basis of constraint
solving for verifying string-manipulating programs. However, this theory is far from adequate …

Separation logic is a spatial logic for reasoning locally about heap structures. A decidable
fragment of its assertion language was presented in [1], based on a bounded model property. …

Pushdown systems (PDS) naturally model sequential recursive programs. Numeric data
types also often arise in real-world programs. We study the extension of PDS with unbounded …

We show the diagonal problem for higher-order pushdown automata (HOPDA), and hence
the simultaneous unboundedness problem, is decidable. From recent work by Zetzsche this …

In this paper, we propose a decision procedure for a class of string-manipulating programs
which includes not only a wide range of string operations such as concatenation, replaceAll, …

Tool for the Management of Concurrent Conceptual Engineering Design Page 1 111 Tool for
the Management of Concurrent Conceptual Engineering Design Matthew J. Hague and A …