4617 search results - page 813 / 924 » Automation of Diagrammatic Reasoning |
152
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
196
click to vote
LICS
2009
IEEE
16 years 1 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...
160
click to vote
LICS
2009
IEEE
16 years 1 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...
190
click to vote
LICS
2009
IEEE
16 years 1 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...
205
click to vote
LICS
2009
IEEE
16 years 1 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...