15951 search results - page 2929 / 3191 » Lawful software engineering |
136
click to vote
FSEN
2007
Springer
15 years 10 months ago
2007
Springer
We define a type system for COWS, a formalism for specifying and combining services, while modelling their dynamic behaviour. Our types permit to express policies constraining dat...
145
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
145
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The abstraction of cryptographic operations by term algebras, called DolevYao models or symbolic cryptography, is essential in almost all tool-supported methods for provi...
128
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
149
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...