7118 search results - page 1170 / 1424 » Electrical and Computer Engineering |
128
Voted
FOSSACS
2010
Springer
15 years 10 months ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
120
click to vote
FOSSACS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. This paper considers the probabilistic may/must testing theory for processes having external, internal, and probabilistic choices. We observe that the underlying testing ...
122
Voted
CCS
2009
ACM
15 years 10 months ago
2009
ACM
We enforce information flow policies in programs that run at multiple locations, with diverse levels of security. We build a compiler from a small imperative language with locali...
141
Voted
CP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
108
Voted
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
There is growing interest in quantitative theories of information flow in a variety of contexts, such as secure information flow, anonymity protocols, and side-channel analysis. ...