1461 search results - page 46 / 293 » Analysis of Constraint Logic Programs |
EUROPAR
2000
Springer
15 years 1 months ago
2000
Springer
One of the advantages of logic programming is the fact that it offers many sources of implicit parallelism, such as and-parallelism and or-parallelism. Arguably, or-parallel system...
ICLP
2007
Springer
15 years 1 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
POPL
2011
ACM
14 years 19 days ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
SEFM
2005
IEEE
15 years 3 months ago
2005
IEEE
Memory consumption policies provide a means to control resource usage on constrained devices, and play an important role in ensuring the overall quality of software systems, and i...
CADE
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...