275 search results - page 22 / 55 » Non-Termination Inference of Logic Programs |
POPL
1997
ACM
15 years 1 months ago
1997
ACM
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
CADE
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we propose a method for inferring invariants for loops in Java programs. An example of a simple while loop is used throughout the paper to explain our approach. The m...
LOPSTR
2004
Springer
15 years 3 months ago
2004
Springer
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
SIGSOFT
2010
ACM
14 years 7 months ago
2010
ACM
We present Phantm, a static analyzer that uses a flowsensitive analysis to detect type errors in PHP applications. Phantm can infer types for nested arrays, and can leverage runti...
SEMCO
2007
IEEE
15 years 4 months ago
2007
IEEE
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...