Sciweavers

1322 search results - page 32 / 265
» Unsound Theorem Proving
Sort
View
AML
2007
77views more  AML 2007»
13 years 7 months ago
Complex analysis in subsystems of second order arithmetic
Abstract. This research is motivated by the program of Reverse Mathematics. We investigate basic part of complex analysis within some weak subsystems of second order arithmetic, in...
Keita Yokoyama
FMCAD
2008
Springer
13 years 9 months ago
Scheduling Optimisations for SPIN to Minimise Buffer Requirements in Synchronous Data Flow
Synchronous Data flow (SDF) graphs have a simple and elegant semantics (essentially linear algebra) which makes SDF graphs eminently suitable as a vehicle for studying scheduling o...
Pieter H. Hartel, Theo C. Ruys, Marc C. W. Geilen
CORR
2010
Springer
77views Education» more  CORR 2010»
13 years 7 months ago
Sound Bisimulations for Higher-Order Distributed Process Calculus
Abstract. While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we develop a bis...
Adrien Piérard, Eijiro Sumii
CSL
2001
Springer
14 years 1 days ago
An Existential Locality Theorem
We prove an existential version of Gaifman’s locality theorem and show how it can be applied algorithmically to evaluate existential first-order sentences in finite structures....
Martin Grohe, Stefan Wöhrle
DM
2000
91views more  DM 2000»
13 years 7 months ago
Three distance theorem and grid graph
We will prove a d-dimensional version of the Geelen and Simpson theorem. c 2000 Elsevier Science B.V. All rights reserved.
Nicolas Chevallier