3440 search results - page 24 / 688 » Logics For Context-Free Languages |
111
click to vote
ICFP
2012
ACM
13 years 6 days ago
2012
ACM
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
ICLP
2003
Springer
15 years 3 months ago
2003
Springer
Abstract logic programming is about designing logic programming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expres...
COLING
1996
14 years 11 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
173
click to vote
ECOOP
2009
Springer
15 years 10 months ago
2009
Springer
Pointer analyses derived from a Context-Free-Language (CFL) reachability formulation achieve very high precision, but they do not scale well to compute the points-to solution for a...
CCS
2008
ACM
14 years 11 months ago
2008
ACM
The specifications of an application's security configuration are crucial for understanding its security policies, which can be very helpful in security-related contexts such...