275 search results - page 50 / 55 » Non-Termination Inference of Logic Programs |
IWMM
2007
Springer
15 years 3 months ago
2007
Springer
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
ICLP
1999
Springer
15 years 1 months ago
1999
Springer
This paper presents a programming language that includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (funct...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Event-driven automation of reactive functionalities for complex event processing is an urgent need in today's distributed service-oriented architectures and Web-based event-d...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
We propose a method of classifying XML documents and extracting XML schema from XML by inductive inference based on constraint logic programming. The goal of this work is to type ...
172
click to vote
POPL
2005
ACM
15 years 10 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...