Sciweavers

1960 search results - page 227 / 392
» The Logic of Large Enough
Sort
View
IJFCS
2006
130views more  IJFCS 2006»
13 years 10 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
NDJFL
2000
97views more  NDJFL 2000»
13 years 10 months ago
Neo-Fregean Foundations for Real Analysis: Some Reflections on Frege's Constraint
now of a number of ways of developing Real Analysis on a basis of abstraction principles and second-order logic. One, outlined by Shapiro in his contribution to this volume, mimic...
Crispin Wright
OOPSLA
2010
Springer
13 years 8 months ago
Composable specifications for structured shared-memory communication
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...
Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan G...
INFOCOM
2012
IEEE
12 years 1 months ago
TurfCast: A service for controlling information dissemination in wireless networks
—Recent years have witnessed mass proliferation of mobile devices with rich wireless communication capabilities as well as emerging mobile device based information dissemination ...
Xinfeng Li, Jin Teng, Boying Zhang, Adam C. Champi...
ICDT
2012
ACM
251views Database» more  ICDT 2012»
12 years 1 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich