1226 search results - page 123 / 246 » Proofs, Programs and Abstract Complexity |
125
click to vote
CIE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
127
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...
105
Voted
UML
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Proponents of aspect orientation have successfully seeded the impression that aspects—like objects—are so fundamental a notion that they should pervade all phases and...
118
Voted
ATVA
2004
Springer
15 years 9 months ago
2004
Springer
nded Abstract – Oleg Parshin∗ Abdur Rakib† Stephan Thesing∗ Reinhard Wilhelm∗ The precise determination of worst-case execution times (WCETs) for programs is mostly bein...
116
Voted
PERVASIVE
2004
Springer
15 years 8 months ago
2004
Springer
Based on an extensive field study of current firefighting practices, we have developed a system called Siren to support tacit communication between firefighters with multiple level...