590 search results - page 53 / 118 » Non-Failure Analysis for Logic Programs |
POPL
2005
ACM
14 years 9 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
FMOODS
2008
13 years 10 months ago
2008
Abstract. Termination analysis has received considerable attention, traditionally in the context of declarative programming, and recently also for imperative languages. In existing...
PPDP
2010
Springer
13 years 7 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
ISSTA
2009
ACM
14 years 3 months ago
2009
ACM
Exception analysis and points-to analysis are typically done in complete separation. Past algorithms for precise exception analysis (e.g., pairing throw clauses with catch stateme...
SIGSOFT
2002
ACM
14 years 9 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...