Sciweavers

8512 search results - page 1457 / 1703
» Computing Theory With Relevance
Sort
View
ECCC
2008
122views more  ECCC 2008»
15 years 6 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira
ENTCS
2008
138views more  ENTCS 2008»
15 years 6 months ago
Compositionality of Statically Scheduled IP
Timing Closure in presence of long global wire interconnects is one of the main current issues in System-onChip design. One proposed solution to the Timing Closure problem is Late...
Julien Boucaron, Jean-Vivien Millo
ENTCS
2008
75views more  ENTCS 2008»
15 years 6 months ago
On the Refinement of Atomic Actions
Inspired by the properties of the refinement development of the Mondex Electronic Purse, we view an atomic action as a family of transitions with a common before-state, and differ...
Richard Banach, Gerhard Schellhorn
ENTCS
2008
91views more  ENTCS 2008»
15 years 6 months ago
A Name Abstraction Functor for Named Sets
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...
Vincenzo Ciancia, Ugo Montanari
ENTCS
2008
120views more  ENTCS 2008»
15 years 6 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke
« Prev « First page 1457 / 1703 Last » Next »