We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Separation Algebras serve as models of Separation Logics; Share Accounting allows reasoning about concurrent-read/exclusive-write resources in Separation Logic. In designing a Conc...
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
There exist several implementations of the functional logic language Curry: a transformation to Prolog and implementations of machines for C and Java. We show that there are many ...
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...