Sciweavers

551 search results - page 56 / 111
» Natural proofs
Sort
View
IFM
2007
Springer
14 years 2 months ago
Unifying Theories of Objects
We present an approach to modelling Abadi–Cardelli-style object calculi as Unifying Theories of Programming (UTP) designs. Here we provide a core object calculus with an operatio...
Michael Anthony Smith, Jeremy Gibbons
JELIA
1990
Springer
14 years 23 days ago
Semantic Interpretation as Higher-Order Deduction
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
Fernando C. N. Pereira
ISW
2004
Springer
14 years 2 months ago
Low-Level Ideal Signatures and General Integrity Idealization
Abstract. Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protoco...
Michael Backes, Birgit Pfitzmann, Michael Waidner
ICDE
2003
IEEE
97views Database» more  ICDE 2003»
14 years 10 months ago
Spectral LPM: An Optimal Locality-Preserving Mapping using the Spectral (not Fractal) Order
For the past two decades, fractals (e.g., the Hilbert and Peano space-filling curves) have been considered the natural method for providing a locality-preserving mapping. The idea...
Mohamed F. Mokbel, Walid G. Aref, Ananth Grama
STOC
2004
ACM
88views Algorithms» more  STOC 2004»
14 years 9 months ago
Expander flows, geometric embeddings and graph partitioning
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
Sanjeev Arora, Satish Rao, Umesh V. Vazirani