154 search results - page 13 / 31 » PAC-Learnability of Determinate Logic Programs |
ICFP
2007
ACM
14 years 9 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 ...
CCS
2011
ACM
12 years 9 months ago
2011
ACM
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
GPCE
2004
Springer
14 years 3 months ago
2004
Springer
This paper describes Splice, a system for writing aspects that perform static program analyses to direct program modifications. The power of an inter-procedural data-flow analys...
DLOG
2006
13 years 11 months ago
2006
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
ICFP
2010
ACM
13 years 11 months ago
2010
ACM
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...