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...
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 ...
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. ...
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...
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...