Sciweavers

503 search results - page 10 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
ICFEM
2009
Springer
15 years 4 months ago
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
Samik Basu, Arka P. Ghosh, Ru He
ICML
2008
IEEE
15 years 10 months ago
On the quantitative analysis of deep belief networks
Deep Belief Networks (DBN's) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allow...
Ruslan Salakhutdinov, Iain Murray
103
Voted
ICLP
2004
Springer
15 years 3 months ago
Applying CLP to Predict Extra-Functional Properties of Component-Based Models
A component is the basic re-usable unit of composition to build composite systems by connecting to others through their provided and required ports. Checking the functional complia...
Olivier Defour, Jean-Marc Jézéquel, ...
ACL2
2006
ACM
15 years 3 months ago
A SAT-based procedure for verifying finite state machines in ACL2
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
Warren A. Hunt Jr., Erik Reeber
82
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
Window Flow Control: Macroscopic Properties from Microscopic Factors
—This paper studies window flow control focusing on bridging the gap between microscopic factors such as burstiness in sub-RTT timescales, and observable macroscopic properties ...
Ao Tang, Lachlan L. H. Andrew, Krister Jacobsson, ...