691 search results - page 43 / 139 » Automatically Proving Linearizability |
FMCAD
2007
Springer
14 years 4 months ago
2007
Springer
— Induction has been studied in model checking for proving the validity of safety properties, i.e., showing the absence of counterexamples. To our knowledge, induction has not be...
IJCNN
2006
IEEE
14 years 3 months ago
2006
IEEE
— From the Bayesian Ying-Yang (BYY) harmony learning theory, a harmony function has been developed for finite mixtures with a novel property that its maximization can make model...
LPAR
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
FMCAD
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Termination poses one of the main challenges for mechanically verifying infinite state systems. In this paper, we develop a powerful and extensible framework based on th...
LPAR
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...