182 search results - page 27 / 37 » A Theory of Strict P-completeness |
CHI
2006
ACM
14 years 8 months ago
2006
ACM
This paper explores the relationship between display of feedback (public vs. private) by a computer system and the basis for evaluation (present vs. absent) of that feedback. We e...
POPL
2006
ACM
14 years 8 months ago
2006
ACM
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
POPL
2006
ACM
14 years 8 months ago
2006
ACM
Virtual classes are class-valued attributes of objects. Like virtual methods, virtual classes are defined in an object's class and may be redefined within subclasses. They re...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
LCTRTS
2010
Springer
14 years 2 months ago
2010
Springer
This paper extends the methodology of analytic real-time analysis of distributed embedded systems towards merging and extracting sub-streams based on event type information. For e...