4573 search results - page 798 / 915 » Automated Reasoning |
143
click to vote
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
mantics Is Fully Abstract∗ Sumit Nain and Moshe Y. Vardi Rice University, Department of Computer Science Houston, TX 77005-1892, USA The discussion in the computer-science liter...
106
Voted
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
—We exhibit a deterministic concurrent reachability game PURGATORYn with n non-terminal positions and a binary choice for both players in every position so that any positional st...
132
click to vote
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
135
click to vote
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted be...
108
click to vote
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...