2830 search results - page 345 / 566 » No Science without Semantics |
127
Voted
SOSP
2003
ACM
16 years 25 days ago
2003
ACM
Many interesting large-scale systems are distributed systems of multiple communicating components. Such systems can be very hard to debug, especially when they exhibit poor perfor...
142
click to vote
PLDI
2003
ACM
15 years 9 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
155
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
A major source of information (often the most crucial and informative part) in scholarly articles from scientific journals, proceedings and books are the figures that directly pro...
129
Voted
CSCW
2010
ACM
16 years 24 days ago
2010
ACM
It would be useful if software engineers/instructors could be aware that remote team members/students are having difficulty with their programming tasks. We have developed an appr...
123
Voted
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...