1461 search results - page 101 / 293 » Analysis of Constraint Logic Programs |
ESOP
1992
Springer
15 years 2 months ago
1992
Springer
Dynamic typing is a program analysis targeted at removing runtime tagging and untagging operations from programs written in dynamically typed languages. This paper compares dynami...
180
click to vote
POPL
2004
ACM
15 years 10 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
RISE
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
FOSSACS
2010
Springer
15 years 4 months ago
2010
Springer
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...
PPDP
2009
Springer
15 years 4 months ago
2009
Springer
Dividing the heap memory of programs into regions is the starting point of region-based memory management. In our existing work of enabling region-based memory management for Merc...