COCO
2004
Springer
14 years 1 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
COCO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
ASIAN
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We aim to provide information hiding support in concurrent object-oriented programming languages. We study the issue both at the object level and class level, in the cont...
ASIAN
2006
Springer
14 years 1 months ago
2006
Springer
Abstract Non-interference is typically used as a baseline security policy to formalize confidentiality of secret information manipulated by a program. In contrast to static checkin...
ASIAN
2006
Springer
14 years 1 months ago
2006
Springer
ASIAN
2006
Springer
14 years 1 months ago
2006
Springer
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
ASIAN
2006
Springer
14 years 1 months ago
2006
Springer
ASIAN
2006
Springer
14 years 1 months ago
2006
Springer
ASIAN
2006
Springer
14 years 1 months ago
2006
Springer
A component-based realtime system is a simple model for the server-client relation with time constraints. This paper presents an efficient algorithm, called a blackbox testing algo...
ASIAN
2006
Springer
14 years 1 months ago
2006
Springer
