Sciweavers

395 search results - page 34 / 79
» Predicate Abstraction with Minimum Predicates
Sort
View
CIE
2009
Springer
14 years 4 months ago
Decidability of Sub-theories of Polynomials over a Finite Field
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
Alla Sirokofskich
KBSE
2007
IEEE
14 years 4 months ago
The eureka tool for software model checking
We describe EUREKA, a symbolic model checker for Linear Programs with arrays, i.e. programs where variables and array elements range over a numeric domain and expressions involve ...
Alessandro Armando, Massimo Benerecetti, Dario Car...
FATES
2005
Springer
14 years 3 months ago
A Novel Test Coverage Metric for Concurrently-Accessed Software Components
We propose a novel, practical coverage metric called “location pairs” (LP) for concurrently-accessed software components. The LP metric captures well common concurrency errors ...
Serdar Tasiran, Tayfun Elmas, Guven Bolukbasi, M. ...
ICALP
2005
Springer
14 years 3 months ago
About Hoare Logics for Higher-Order Store
Abstract. We present a Hoare logic for a simple imperative whilelanguage with stored commands, ie. stored parameterless procedures. Stores that may contain procedures are called hi...
Bernhard Reus, Thomas Streicher
ILP
2005
Springer
14 years 3 months ago
Generalization Behaviour of Alkemic Decision Trees
Abstract. This paper is concerned with generalization issues for a decision tree learner for structured data called Alkemy. Motivated by error bounds established in statistical lea...
Kee Siong Ng