Sciweavers

17 search results - page 2 / 4
» Reasoning about comprehensions with first-order SMT solvers
Sort
View
CAV
2009
Springer
163views Hardware» more  CAV 2009»
14 years 5 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
FORTE
2008
13 years 6 months ago
An SMT Approach to Bounded Reachability Analysis of Model Programs
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
Margus Veanes, Nikolaj Bjørner, Alexander R...
ARTMED
2006
85views more  ARTMED 2006»
13 years 5 months ago
Using ontologies linked with geometric models to reason about penetrating injuries
Medical assessment of penetrating injuries is a difficult and knowledge-intensive task. Physical examination and computed tomographic (CT) imaging data must be combined with detai...
Daniel L. Rubin, Olivier Dameron, Yasser Bashir, D...
APAL
2010
88views more  APAL 2010»
13 years 5 months ago
Nonstandard arithmetic and recursive comprehension
First order reasoning about hyperintegers can prove things about sets of integers. In the author's paper Nonstandard Arithmetic and Reverse Mathematics, Bulletin of Symbolic L...
H. Jerome Keisler
CADE
2010
Springer
13 years 6 months ago
MUNCH - Automated Reasoner for Sets and Multisets
This system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logic that supports expressions about sets, multi...
Ruzica Piskac, Viktor Kuncak