136 search results - page 10 / 28 » The Satisfiability Problem for Probabilistic Ordered Branchi... |
125
click to vote
RTCSA
2000
IEEE
15 years 7 months ago
2000
IEEE
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
135
click to vote
ICFEM
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
123
click to vote
VMCAI
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we deal with the problem of applying model checking to real programs. We verify a program without constructing the whole transition system using a technique based on...
ICDM
2006
IEEE
15 years 9 months ago
2006
IEEE
An ensemble is a group of learners that work together as a committee to solve a problem. However, the existing ensemble training algorithms sometimes generate unnecessary large en...
119
click to vote
ANOR
2008
15 years 3 months ago
2008
: The growth in demand for semiconductors has been accompanied by intense competition between semiconductor manufacturers to satisfy customer on-time delivery needs. This paper is ...