Results 1  10
of
454
Extensional Theories and Rewriting
"... Abstract. This paper is an attempt to develop a unifying algebraic framework for extensional theories capturing formally the informal concept of extensionality, as well as a generic automated proving technique, called extensional rewriting, that can be instantiated and then used to prove equational ..."
Abstract
 Add to MetaCart
Abstract. This paper is an attempt to develop a unifying algebraic framework for extensional theories capturing formally the informal concept of extensionality, as well as a generic automated proving technique, called extensional rewriting, that can be instantiated and then used to prove equational
Extensional Theories and Rewriting
"... Abstract. This paper is an attempt to develop a unifying algebraic framework for extensional theories capturing formally the informal concept of extensionality, as well as a generic automated proving technique, called extensional rewriting, that can be instantiated and then used to prove equational ..."
Abstract
 Add to MetaCart
Abstract. This paper is an attempt to develop a unifying algebraic framework for extensional theories capturing formally the informal concept of extensionality, as well as a generic automated proving technique, called extensional rewriting, that can be instantiated and then used to prove equational
A Decision Procedure for an Extensional Theory of Arrays
 In 16th IEEE Symposium on Logic in Computer Science
, 2001
"... A decision procedure for a theory of arrays is of interest for applications in formal verification, program analysis, and automated theoremproving. This paper presents a decision procedure for an extensional theory of arrays and proves it correct. 1. ..."
Abstract

Cited by 84 (15 self)
 Add to MetaCart
A decision procedure for a theory of arrays is of interest for applications in formal verification, program analysis, and automated theoremproving. This paper presents a decision procedure for an extensional theory of arrays and proves it correct. 1.
Lemmas on Demand for the Extensional Theory of Arrays
 In Proc. SMT’08. ACM
, 2008
"... The quantifierfree extensional theory of arrays TA plays an important role in hardware and software verification. In this article we present a novel decision procedure that refines formula abstractions with lemmas on demand. We consider the case where TA is combined with a decidable quantifierfree ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
The quantifierfree extensional theory of arrays TA plays an important role in hardware and software verification. In this article we present a novel decision procedure that refines formula abstractions with lemmas on demand. We consider the case where TA is combined with a decidable quantifier
Efficient SMT Solving for BitVectors and the Extensional Theory of Arrays
"... The Satisfiability Modulo Theories (SMT) problem is to decide the satisfiability of a formula expressed in a (decidable) firstorder background theory. In this thesis we address the problem of designing, implementing, testing, and debugging an efficient SMT solver for the quantifierfree extensional ..."
Abstract
 Add to MetaCart
free extensional theory of arrays, combined with bitvectors. This thesis consists of three main parts. After an introduction into the problem and its domain, the first part considers the design of an efficient decision procedure for the quantifierfree extensional theory of arrays. We discuss the decision
Perspectives on Program Analysis
, 1996
"... eing analysed. On the negative side, the semantic correctness of the analysis is seldom established and therefore there is often no formal justification for the program transformations for which the information is used. The semantics based approach [1; 5] is often based on domain theory in the form ..."
Abstract

Cited by 685 (35 self)
 Add to MetaCart
eing analysed. On the negative side, the semantic correctness of the analysis is seldom established and therefore there is often no formal justification for the program transformations for which the information is used. The semantics based approach [1; 5] is often based on domain theory
A perspective on judgment and choice: Mapping bounded rationality
 American psychologist
, 2003
"... Early studies of intuitive judgment and decision making conducted with the late Amos Tversky are reviewed in the context of two related concepts: an analysis of accessibility, the ease with which thoughts come to mind; a distinction between effortless intuition and deliberate reasoning. Intuitive th ..."
Abstract

Cited by 416 (0 self)
 Add to MetaCart
thoughts, like percepts, are highly accessible. Determinants and consequences of accessibility help explain the central results of prospect theory, framing effects, the heuristic process of attribute substitution, and the characteristic biases that result from the substitution of nonextensional
On the axiom of extensionality
, 2010
"... The goal of this note is to extend Gandy’s interpretability result [2] of extensional type theory in intensional type theory for simple type theory, to a dependent type system with one universe. For simple type theory, Gandy observed that any definable term is extensional. As formulated in [2], this ..."
Abstract
 Add to MetaCart
The goal of this note is to extend Gandy’s interpretability result [2] of extensional type theory in intensional type theory for simple type theory, to a dependent type system with one universe. For simple type theory, Gandy observed that any definable term is extensional. As formulated in [2
Theory of Extensional Reasoning Uncertainty
"... The mentalmodels account of naive probabilistic reasoning by P. N. JohnsonLaird, P. Legrenzi, V. Girotto, M. S. Legrenzi, and J. P. Caverni (1999) provides an opportunity to clarify several similarities and differences between it and ecological rationality (frequentist) accounts. First, ambiguitie ..."
Abstract
 Add to MetaCart
, similarities are noted between the subset principle and the principle of natural sampling. Finally, some potentially misleading portrayals of the role of evolutionary factors in psychology are corrected. Mentalmodels theory, rather than better explaining probabilistic reasoning, may be able to use frequency
Extensional Equality in Intensional Type Theory
 In LICS 99
, 1999
"... We present a new approach to introducing an extensional propositional equality in Intensional Type Theory. Our construction is based on the observation that there is a sound, intensional setoid model in Intensional Type theory with a proofirrelevant universe of propositions and rules for  and t ..."
Abstract

Cited by 28 (13 self)
 Add to MetaCart
We present a new approach to introducing an extensional propositional equality in Intensional Type Theory. Our construction is based on the observation that there is a sound, intensional setoid model in Intensional Type theory with a proofirrelevant universe of propositions and rules
Results 1  10
of
454