Sciweavers

4401 search results - page 589 / 881
» Computing with Default Logic
Sort
View
BIRTHDAY
2010
Springer
15 years 6 months ago
Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...
Moa Johansson, Lucas Dixon, Alan Bundy
BIRTHDAY
2010
Springer
15 years 6 months ago
Change Management for Heterogeneous Development Graphs
Abstract. The error-prone process of formal specification and verification of large systems requires an efficient, evolutionary formal development approach. Development graphs have...
Serge Autexier, Dieter Hutter, Till Mossakowski
ENTCS
2007
107views more  ENTCS 2007»
15 years 6 months ago
Formal Translation of Bytecode into BoogiePL
Many modern program verifiers translate the program to be verified and its specification into a simple intermediate representation and then compute verification conditions on ...
Hermann Lehner, Peter Müller
NECO
2008
116views more  NECO 2008»
15 years 6 months ago
A (Somewhat) New Solution to the Variable Binding Problem
To perform automatic, unconscious inference, the human brain must solve the "binding problem" by correctly grouping properties with objects. Temporal binding models like...
Leon Barrett, Jerome Feldman, Liam Mac Dermed
TCS
1998
15 years 5 months ago
Algebraic Translations, Correctness and Algebraic Compiler Construction
Algebraic translation methods are argued for in many fields of science. Several examples will be considered: from the field of compiler construction, database updates, concurren...
Theo M. V. Janssen