47 search results - page 10 / 10 » Proof nets sequentialisation in multiplicative linear logic |
ICFP
2007
ACM
14 years 10 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
IJCAI
2007
14 years 5 days ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...