Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
The extensional theory of arrays is one of the most important ones for applications of SAT Modulo Theories (SMT) to hardware and software verification. Here we present a new T-solv...
Miquel Bofill, Robert Nieuwenhuis, Albert Oliveras...
In this paper we present a formalization of Abadi’s and Cardelli’s theory of objects in the interactive theorem prover Isabelle/HOL. Our motivation is to build a mechanized HOL...
ract State Machines Be Useful in Language Theory? Yuri Gurevich a Margus Veanes a Charles Wallace b aMicrosoft Research, Redmond, Washington, USA bMichigan Tech, Houghton, Michigan...
The focus of this paper is on student learning theory. Use is made of an "analytic discovery tool" called Quantitative CyberQuest (QCQ) to help conceptualize the many go...