1131 search results - page 117 / 227 » Logic Programming, Functional Programming, and Inductive Def... |
106
Voted
SIGSOFT
2002
ACM
16 years 1 months ago
2002
ACM
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
118
click to vote
ICFP
2007
ACM
16 years 17 days 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 ...
195
click to vote
POPL
2004
ACM
16 years 28 days ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
COMPSAC
2002
IEEE
15 years 5 months ago
2002
IEEE
Programs use rules to dictate or constrain specific decisions or actions. These rules have typically been tested, revised, and updated continuously; therefore, they represent a su...
140
click to vote
TLDI
2010
ACM
15 years 24 days ago
2010
ACM
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...