120 research outputs found
07401 Abstracts Collection -- Deduction and Decision Procedures
From 01.10. to 05.10.2007, the Dagstuhl Seminar 07401 ``Deduction and Decision Procedures\u27\u27 was held in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar
as well as abstracts of seminar results and ideas
are put together in this paper
Coefficient Synthesis for Threshold Automata
Threshold automata are a formalism for modeling fault-tolerant distributed
algorithms. The main feature of threshold automata is the notion of a threshold
guard, which allows us to compare the number of received messages with the
total number of different types of processes. In this paper, we consider the
coefficient synthesis problem for threshold automata, in which we are given a
sketch of a threshold automaton (with the constants in the threshold guards
left unspecified) and a specification and we want to synthesize a set of
constants which when plugged into the sketch, gives a threshold automaton
satisfying the specification. Our main result is that this problem is
undecidable, even when the specification is a coverability specification and
the underlying sketch is acyclic
Instantiation Schemes for Nested Theories
Article 11 - 33 pagesInternational audienceThis article investigates under which conditions instantiation-based proof procedures can be combined in a nested way, in order to mechanically construct new instantiation procedures for richer theories. Interesting applications in the field of verification are emphasized, particularly for handling extensions of the theory of arrays
Analytic cell decomposition and analytic motivic integration
The main results of this paper are a Cell Decomposition Theorem for Henselian
valued fields with analytic structure in an analytic Denef-Pas language, and
its application to analytic motivic integrals and analytic integrals over
\FF_q((t)) of big enough characteristic. To accomplish this, we introduce a
general framework for Henselian valued fields with analytic structure, and
we investigate the structure of analytic functions in one variable, defined on
annuli over . We also prove that, after parameterization, definable analytic
functions are given by terms. The results in this paper pave the way for a
theory of \emph{analytic} motivic integration and \emph{analytic} motivic
constructible functions in the line of R. Cluckers and F. Loeser
[\emph{Fonctions constructible et int\'egration motivic I}, Comptes rendus de
l'Acad\'emie des Sciences, {\bf 339} (2004) 411 - 416]
09411 Abstracts Collection -- Interaction versus Automation: The two Faces of Deduction
From 04.10. to 09.10.2009, the Dagstuhl Seminar 09411
``Interaction versus Automation: The two Faces of Deduction\u27\u27 was held
in Schloss Dagstuhl~--~Leibniz Center for Informatics.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
- …