Sciweavers

1226 search results - page 160 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
15 years 9 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma
SIGSOFT
2006
ACM
15 years 9 months ago
Interpolation for data structures
Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to contr...
Deepak Kapur, Rupak Majumdar, Calogero G. Zarba
ASPLOS
1992
ACM
15 years 7 months ago
Application-Controlled Physical Memory using External Page-Cache Management
Next generation computer systems will have gigabytes of physical memory and processors in the 200 MIPS range or higher. While this trend suggests that memory management for most p...
Kieran Harty, David R. Cheriton
ICSE
2004
IEEE-ACM
16 years 3 months ago
Design of Large-Scale Polylingual Systems
Abstract. Building systems from existing applications written in two or more languages is common practice. Such systems are polylingual. Polylingual systems are relatively easy to ...
Mark Grechanik, Don S. Batory, Dewayne E. Perry
COOPIS
2003
IEEE
15 years 8 months ago
Re-factoring Middleware Systems: A Case Study
Abstract. Aspect oriented programming brings us new design perspectives since it permits the superimpositions of multiple abstraction models on top of one another. It is a very pow...
Charles Zhang, Hans-Arno Jacobsen