1024 search results - page 38 / 205 » Compositional Methods for Probabilistic Systems |
SIGSOFT
2003
ACM
16 years 2 months ago
2003
ACM
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
126
click to vote
ECAI
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...
108
click to vote
ICFP
2001
ACM
16 years 1 months ago
2001
ACM
The type systems of most typed functional programming languages are based on the Hindley-Milner type system. A practical problem with these type systems is that it is often hard t...
129
click to vote
CHARME
2001
Springer
15 years 5 months ago
2001
Springer
We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system ba...
WSC
2000
15 years 2 months ago
2000
We propose "low cost response surface methods" (LCRSM) that typically require half the experimental runs of standard response surface methods based on central composite ...