3470 search results - page 506 / 694 » Head-Elementary-Set-Free Logic Programs |
137
click to vote
EMSOFT
2009
Springer
16 years 14 days 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...
172
click to vote
LPNMR
2009
Springer
16 years 13 days 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...
143
click to vote
GPCE
2009
Springer
15 years 10 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...
151
click to vote
SIGSOFT
2007
ACM
16 years 6 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
172
click to vote
KBSE
2007
IEEE
16 years 5 days ago
2007
IEEE
Achieving high structural coverage such as branch coverage in objectoriented programs is an important and yet challenging goal due to two main challenges. First, some branches inv...