1792 search results - page 347 / 359 » What Are We Arguing About |
SIGSOFT
2003
ACM
14 years 8 months ago
2003
ACM
State machine based formalisms such as labelled transition systems (LTS) are generally assumed to be complete descriptions m behaviour at some level of abstraction: if a labelled ...
CCS
2009
ACM
14 years 8 months ago
2009
ACM
Botnets dominate today's attack landscape. In this work we investigate ways to analyze collections of malicious probing traffic in order to understand the significance of lar...
CHI
2004
ACM
14 years 8 months ago
2004
ACM
In this paper, we describe Common Sense Investing (CSI), an interactive investment tool that uses a knowledge base of common sense statements in conjunction with domain knowledge ...
PLPV
2010
ACM
14 years 4 months ago
2010
ACM
Singleton types are often considered a poor man’s substitute for dependent types. But their generalization in the form of GADTs has found quite a following. The main advantage o...
PEPM
2009
ACM
14 years 4 months ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...