2137 search results - page 114 / 428 » Proving Abstract Non-interference |
ICANNGA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...
181
click to vote
IFL
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
100
click to vote
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
106
click to vote
LPAR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...
LPAR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The use of formal methods provides confidence in the correctness of developments. Yet one may argue about the actual level of confidence obtained when the method itself...