590 search results - page 80 / 118 » Non-Failure Analysis for Logic Programs |
IFIP
2005
Springer
14 years 2 months ago
2005
Springer
We present a method for trust scenarios with more than one trustee, where sets of trustees are ordered in a relation of relative trustworthiness. We show how a priority structure i...
AAECC
1999
Springer
13 years 8 months ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
ENTCS
2008
13 years 8 months ago
2008
Logic meta-programming in Prolog is a powerful way to express program analysis and transformation. However, its use can be difficult and error-prone because it requires programmer...
SIGSOFT
2009
ACM
14 years 9 months ago
2009
ACM
Parallel changes are becoming increasingly prevalent in the development of large scale software system. To further study the relationship between parallel changes and faults, we h...
PLDI
2010
ACM
14 years 1 months ago
2010
ACM
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...