Sciweavers

220 search results - page 3 / 44
» Coq Modulo Theory
Sort
View
127
Voted
JAR
2007
123views more  JAR 2007»
15 years 16 days ago
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts
Abstract. We illustrate a methodology for formalizing and reasoning about Abadi and Cardelli’s object-based calculi, in (co)inductive type theory, such as the Calculus of (Co)Ind...
Alberto Ciaffaglione, Luigi Liquori, Marino Micula...
CORR
2008
Springer
75views Education» more  CORR 2008»
15 years 22 days ago
Inductive and Coinductive Components of Corecursive Functions in Coq
In Constructive Type Theory, recursive and corecursive definitions are subject to syntactic restrictions which guarantee termination for recursive functions and productivity for c...
Yves Bertot, Ekaterina Komendantskaya
122
Voted
CAV
2009
Springer
163views Hardware» more  CAV 2009»
16 years 1 months ago
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
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...
Leonardo Mendonça de Moura, Yeting Ge
112
Voted
LPAR
2004
Springer
15 years 6 months ago
Abstract DPLL and Abstract DPLL Modulo Theories
DPLL and DPLL Modulo Theories Robert Nieuwenhuis , Albert Oliveras , and Cesare Tinelli We introduce Abstract DPLL, a general and simple abstract rule-based formulation of the Davi...
Robert Nieuwenhuis, Albert Oliveras, Cesare Tinell...
85
Voted
FMCAD
2008
Springer
15 years 2 months ago
A Write-Based Solver for SAT Modulo the Theory of Arrays
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...