1445 search results - page 122 / 289 » Uniformly Hard Languages |
194
click to vote
VDB
2000
15 years 5 months ago
2000
Searching and managing large archives of visual data, such as images and video, is made hard by the lack of proper integration between the visual aspects of the problem (image pro...
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...
142
click to vote
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
114
click to vote
SIGSOFT
2007
ACM
16 years 4 months ago
2007
ACM
Despite the automated refactoring support provided by today's IDEs many program transformations that are easy to conceptualize-such as improving the implementation of a desig...
145
click to vote
MODELS
2009
Springer
15 years 10 months ago
2009
Springer
UML state machines are widely used for modeling software behavior. However state-crosscutting behaviors, such as synchronization or execution history dependence, are hard to model...