Sciweavers

1814 search results - page 298 / 363
» Extended First-Order Logic
Sort
View
LFCS
2007
Springer
15 years 4 months ago
Cut Elimination in Deduction Modulo by Abstract Completion
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
Guillaume Burel, Claude Kirchner
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
15 years 3 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 2 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
TACAS
1998
Springer
81views Algorithms» more  TACAS 1998»
15 years 2 months ago
Formal Design and Analysis of a Gear Controller
In this paper, we report on an application of the validation and veri cation tool kit Uppaal in the design and analysis of a prototype gear controller, carried out in a joint proje...
Magnus Lindahl, Paul Pettersson, Wang Yi
LPKR
1997
Springer
15 years 2 months ago
Generalizing Updates: From Models to Programs
Abstract. Recently the field of theory update has seen some improvement, in what concerns model updating, by allowing updates to be specified by so-called revision programs. The ...
João Alexandre Leite, Luís Moniz Per...