Sciweavers

835 search results - page 88 / 167
» Geometric Logic in Computer Science
Sort
View
CADE
1992
Springer
14 years 2 months ago
IMPS: System Description
network of theories. Results are typically proved in compact, abstract theories, and then transported as needed to more concrete theories, or indeed to Supported by the MITRE-Spon...
William M. Farmer, Joshua D. Guttman, F. Javier Th...
TCS
2002
13 years 9 months ago
Martin's game: a lower bound for the number of sets
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...
M. Ageev
STOC
2012
ACM
251views Algorithms» more  STOC 2012»
12 years 12 days ago
Minimax option pricing meets black-scholes in the limit
Option contracts are a type of financial derivative that allow investors to hedge risk and speculate on the variation of an asset’s future market price. In short, an option has...
Jacob Abernethy, Rafael M. Frongillo, Andre Wibiso...
FCSC
2010
170views more  FCSC 2010»
13 years 7 months ago
Formal verification of concurrent programs with read-write locks
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...
Ming Fu, Yu Zhang, Yong Li
ICALP
2009
Springer
14 years 10 months ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin