Sciweavers

249 search results - page 49 / 50
» Principals in Programming Languages: A Syntactic Proof Techn...
Sort
View
ICALP
2003
Springer
13 years 11 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
FMOODS
2003
13 years 7 months ago
Inheritance of Temporal Logic Properties
Abstract. Inheritance is one of the key features for the success of objectoriented languages. Inheritance (or specialisation) supports incremental design and re-use of already writ...
Heike Wehrheim
ENTCS
2008
120views more  ENTCS 2008»
13 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
ESORICS
2008
Springer
13 years 8 months ago
Cryptographic Protocol Explication and End-Point Projection
Abstract. Cryptographic protocols are useful for engineering trust in transactions. There are several languages for describing these protocols, but these tend to capture the commun...
Jay A. McCarthy, Shriram Krishnamurthi
ASPLOS
2006
ACM
14 years 7 days ago
Ultra low-cost defect protection for microprocessor pipelines
The sustained push toward smaller and smaller technology sizes has reached a point where device reliability has moved to the forefront of concerns for next-generation designs. Sil...
Smitha Shyam, Kypros Constantinides, Sujay Phadke,...