193 search results - page 22 / 39 » Partial Solutions with Unique Completion |
JFP
2000
13 years 7 months ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
PKC
2009
Springer
14 years 8 months ago
2009
Springer
We explore the security of blind signatures under aborts where the user or the signer may stop the interactive signature issue protocol prematurely. Several works on blind signatur...
ICCAD
2005
IEEE
14 years 4 months ago
2005
IEEE
Networks-on-Chip (NoCs) represent a promising solution to complex on-chip communication problems. The NoC communication architectures considered so far are based on either complete...
BIRTHDAY
2005
Springer
14 years 1 months ago
2005
Springer
This paper proposes a Compiled Labelled Deductive System, called ACCLDS, for reasoning about role-based access control in distributed systems, which builds upon Massacci’s tablea...
JGAA
2000
13 years 7 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...