Sciweavers

115 search results - page 14 / 23
» Verifying Probabilistic Procedural Programs
Sort
View
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
14 years 24 days ago
A stochastic programming approach to scheduling in TAC SCM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
Michael Benisch, Amy R. Greenwald, Victor Narodits...
TACAS
2007
Springer
105views Algorithms» more  TACAS 2007»
14 years 1 months ago
Hoare Logic for Realistically Modelled Machine Code
This paper presents a mechanised Hoare-style programming logic framework for assembly level programs. The framework has been designed to fit on top of operational semantics of rea...
Magnus O. Myreen, Michael J. C. Gordon
CN
2002
96views more  CN 2002»
13 years 7 months ago
A transparent deployment method of RSVP-aware applications on UNIX
This paper proposes a method, called RLR (RSVP (Resource reSerVation Protocol) library redirection), which can transform legacy Internet applications into RSVP-aware applications ...
Yu-Ben Miao, Wen-Shyang Hwang, Ce-Kuen Shieh
ENTCS
2010
165views more  ENTCS 2010»
13 years 7 months ago
Correct Execution of Reconfiguration for Stateful Components
In component-based software engineering, reconfiguration describes structural changes to the architecture of a component system. For stateful components, not only structural but a...
Moritz Hammer, Alexander Knapp
CIE
2009
Springer
14 years 1 months ago
Computable Exchangeable Sequences Have Computable de Finetti Measures
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 ...
Cameron E. Freer, Daniel M. Roy