Much of psychology focuses on universal principles of thought and action. Although an extremely productive pursuit, this approach, by describing only the "average person," risks describing no one in particular. This article discusses an alternate approach that complements interests in universal principles with analyses of the unique psychological meaning that individuals find in their experienc...

1. Introduction The morphosyntactic diversity of human languages raises problems for many commonly held theoretical assumptions. Syntactic theories typically arise out of the study of a restricted set of issues in a specific group of languages, and then after the fundamental principles of the theory and its analytic constructs have been worked out on the basis of these data, an attempt is usual...

From a cultural psychology perspective, Gauvain (1998) found evidence of folk psychological variations in adulthood to be of great import, whereas Wellman (1998), from a theory of mind perspective, argued that it has little bearing on the issues that drive the theory of mind enterprise. Here I discuss several reasons why this adult evidence is relevant. One prima facie reason is that the compar...

Predicting the onset of hydrate nucleation in oil pipelines is one of the most challenging aspects in the flow assurance modelling work being performed at the Center for Hydrate Research. Nucleation is initiated by a random fluctuation which is able to overcome the energy barrier for the phase transition, once such a fluctuation occurs, further growth is energetically favourable. Historically t...

Many verification techniques nowadays successfully rely on SMT solvers as back-ends to automatically discharge proof obligations. These solvers generally rely on various instantiation techniques to handle quantifiers. We here show that the major instantiation techniques in SMT solving can be cast in a unifying framework for handling quantified formulas with equality and uninterpreted functions....

Satisfiability Modulo Theories (SMT) is the problem of deciding satisfiability of a logical formula, expressed in a combination of first-order theories. We present the architecture and selected features of Boolector, which is an efficient SMT solver for the quantifier-free theories of bit-vectors and arrays. It uses term rewriting, bit-blasting to handle bit-vectors, and lemmas on demand for ar...

In this paper we present a review of SAT-based approaches for building scalable and efficient decision procedures for quantifier-free first-order logic formulas in one or more decidable theories, known as Satisfiability Modulo Theories (SMT) problems. As applied to different system verification problems, SMT problems comprise of different theories including fragments of elementary theory of num...

This paper introduces a constraint language H for finite partial maps (a.k.a. heaps) that incorporates the notion of separation from Separation Logic. We use H to build an extension of Hoare Logic for reasoning over heap manipulating programs using (constraint-based) symbolic execution. We present a sound and complete algorithm for solving quantifier-free (QF) H-formulae based on heap element p...

Interpolating provers have a variety of applications in verification, including invariant generation and abstraction refinement. Here, we extended these methods to produce universally quantified interpolants and invariants, allowing the verification of programs manipulating arrays and heap data structures. We show how a paramodulation-based saturation prover, such as SPASS, can be modified in a...

Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas based on heuristics, which is not refutationally complete even for pure first-order logic. We present several decidable fragments of first order logic modulo theories. We show how to construct models for satisfiable ...