3481 search results - page 455 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
115
click to vote
EMSOFT
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we propose a formal analysis approach to estimate the expected (average) data cache access time of an application across all possible program inputs. Towards this g...
151
click to vote
LPNMR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at s...
123
click to vote
GPCE
2009
Springer
15 years 9 months ago
2009
Springer
This paper describes a language and framework that allow coordinated transformations driven by invariants to be specified declaratively, as invariant rules, and applied automatic...
159
click to vote
ICFP
2010
ACM
15 years 4 months ago
2010
ACM
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
140
click to vote
CCE
2004
15 years 4 months ago
2004
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncer...