Sciweavers

6978 search results - page 1029 / 1396
» On Proofs in System P
Sort
View
CORR
2011
Springer
149views Education» more  CORR 2011»
15 years 2 months ago
Solving k-Set Agreement with Stable Skeleton Graphs
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
Martin Biely, Peter Robinson, Ulrich Schmid
ENVSOFT
2007
108views more  ENVSOFT 2007»
15 years 7 months ago
Modeling biocomplexity - actors, landscapes and alternative futures
: Increasingly, models (and modelers) are being asked to address the interactions between human influences, ecological processes, and landscape dynamics that impact many diverse as...
John P. Bolte, David W. Hulse, Stanley V. Gregory,...
CADE
2007
Springer
16 years 8 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
ICS
2010
Tsinghua U.
16 years 5 months ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
PLPV
2009
ACM
16 years 4 months ago
Positively dependent types
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
Daniel R. Licata, Robert Harper
« Prev « First page 1029 / 1396 Last » Next »