2436 search results - page 99 / 488 » Comonadic Notions of Computation |
112
Voted
TCC
2010
Springer
16 years 23 days ago
2010
Springer
The strongest standard security notion for digital signature schemes is unforgeability under chosen message attacks. In practice, however, this notion can be insufficient due to ...
156
Voted
STACS
2009
Springer
15 years 10 months ago
2009
Springer
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
133
Voted
SAC
2008
ACM
15 years 3 months ago
2008
ACM
The basic theory of supervisory control of discrete-event systems is extended with the notion of templates, which simplifies the modeling of controllers since one can work with co...
109
click to vote
OOPSLA
2010
Springer
15 years 2 months ago
2010
Springer
The act of computer programming is generally considered to be temporally removed from a computer program’s execution. In this paper we discuss the idea of programming as an acti...
207
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
We introduce the notion of a data topology and the problem of topology search over databases. A data topology summarizes the set of all possible relationships that connect a given...