Sciweavers

5810 search results - page 817 / 1162
» An Approach to Programming Based on Concepts
Sort
View
SIGSOFT
2007
ACM
16 years 7 months ago
Determining detailed structural correspondence for generalization tasks
Generalization tasks are important for continual improvement to the design of an evolving code base, eliminating redundancy where it has accumulated. An important step in generali...
Jörg Denzinger, Joseph J. C. Chang, Robert J....
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
16 years 7 months ago
Skippy: a new snapshot indexing method for time travel in the storage manager
The storage manager of a general-purpose database system can retain consistent disk page level snapshots and run application programs "back-in-time" against long-lived p...
Ross Shaull, Liuba Shrira, Hao Xu
WWW
2010
ACM
16 years 1 months ago
Fine-grained privilege separation for web applications
We present a programming model for building web applications with security properties that can be confidently verified during a security review. In our model, applications are d...
Akshay Krishnamurthy, Adrian Mettler, David Wagner
ICPPW
2009
IEEE
16 years 1 months ago
Just-in-Time Renaming and Lazy Write-Back on the Cell/B.E.
— Cell Superscalar (CellSs) provides a simple, flexible and easy programming approach for the Cell Broadband Engine (Cell/B.E.) that automatically exploits the inherent concurre...
Pieter Bellens, Josep M. Pérez, Rosa M. Bad...
IFM
2009
Springer
124views Formal Methods» more  IFM 2009»
16 years 1 months ago
Dynamic Path Reduction for Software Model Checking
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
Zijiang Yang, Bashar Al-Rawi, Karem Sakallah, Xiao...