Thesis (M.A.)--Memorial University of Newfoundland. / Typescript. Bibliography: leaves 44-45. Also available online.

Thesis (Ph. D.)--Ohio State University, 2007. / Includes vita and abstract. Includes bibliographical references (leaves 123-124). Also available online via OhioLINK's ETD Center http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1194991095

Thesis (M.Ed.)--University of Hong Kong, 1994. / Includes bibliographical references (leaves 112-120). Also available in print.

Thesi supervisor: Cesare Tinelli. Includes bibliographic references (p. 214-220).

Source: Masters Abstracts International, Volume: 47-03, page: 1686. Advisers: Jack J. Lee; Yunxin Fu. Includes bibliographical references.

Thesis (Ph. D.)--University of Washington, 2006. / Vita. Includes bibliographical references (p. 129-140).

First published in the Bulletin of the American Mathematical Society in Vol.74, 1968, published by the American Mathematical Society

Made available in DSpace on 2014-06-12T15:53:07Z (GMT). No. of bitstreams: 2 arquivo4927_1.pdf: 1466209 bytes, checksum: 2dd8cd7b46b828a5aa1d2a3f50a6ebef (MD5) license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5) Previous issue date: 2001 / Conselho Nacional de Desenvolvimento Científico e Tecnológico / Cabral Mota, Alexandre; Cezar Alves Sampaio, Augusto. Model checking CSPZ: Techniques to overcome state explosion. 2001. Tese (Doutorado). Programa de Pós-Graduação em Ciência da Computação, Universidade Federal de Pernambuco, Recife, 2001.

Our work focuses on bringing the first-order reasoning closer to practicalapplications, particularly in software and hardware verification. The aim is to develop techniques that make first-order reasoners more scalablefor large problems and suitable for the applications. In pursuit of this goal the work focuses in three main directions. First, wedevelop an algorithm for an efficient pre-selection of axioms. This algorithmis already being widely used by the community and enables off-the-shelf theoremprovers to work with problems having millions of axioms that would otherwisebe overwhelming for them. Secondly, we focus on the saturation algorithm itself, and develop anew calculus for separate handling of propositional predicates. We also do anextensive research on various ways of clause splitting within the saturationalgorithm. The third main block of our work is focused on the use of saturation basedfirst-order theorem provers for software verification, particularly forgenerating invariants and computing interpolants. We base our work on theoretical results of Kovacs and Voronkov published in2009 on the CADE and FASE conferences. We develop a practical implementationwhich embraces all the extensions of the basic resolution and superposition calculus that are contained in the theorem prover Vampire. We have also developed a unique proof transforming algorithm which optimizes the computed interpolantswith respect to a user specified cost function.

In this paper limit theorems for the conditional distributions of linear test statistics are proved. The assertions are conditioned by the sigma-field of permutation symmetric sets. Limit theorems are proved both for the conditional distributions under the hypothesis of randomness and under general contiguous alternatives with independent but not identically distributed observations. The proofs are based on results on limit theorems for exchangeable random variables by Strasser and Weber. The limit theorems under contiguous alternatives are consequences of an LAN-result for likelihood ratios of symmetrized product measures. The results of the paper have implications for statistical applications. By example it is shown that minimum variance partitions which are defined by observed data (e.g. by LVQ) lead to asymptotically optimal adaptive tests for the k-sample problem. As another application it is shown that conditional k-sample tests which are based on data-driven partitions lead to simple confidence sets which can be used for the simultaneous analysis of linear contrasts. (author's abstract) / Series: Report Series SFB "Adaptive Information Systems and Modelling in Economics and Management Science"