Sciweavers

1445 search results - page 186 / 289
» Uniformly Hard Languages
Sort
View
ICFP
2005
ACM
16 years 4 months ago
A unified category-theoretic formulation of typed binding signatures
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
Miki Tanaka, John Power
EUROSYS
2009
ACM
16 years 1 months ago
Dingo: taming device drivers
Device drivers are notorious for being a major source of failure in operating systems. In analysing a sample of real defects in Linux drivers, we found that a large proportion (39...
Leonid Ryzhyk, Peter Chubb, Ihor Kuz, Gernot Heise...
SAC
2010
ACM
15 years 11 months ago
Implementing software product lines using traits
A software product line (SPL) is a set of software systems with well-defined commonalities and variabilities that are developed by managed reuse of common artifacts. In this pape...
Lorenzo Bettini, Ferruccio Damiani, Ina Schaefer
SAC
2009
ACM
15 years 11 months ago
Points-to analysis for JavaScript
JavaScript is widely used by web developers and the complexity of JavaScript programs has increased over the last year. Therefore, the need for program analysis for JavaScript is ...
Dongseok Jang, Kwang-Moo Choe
SACMAT
2009
ACM
15 years 11 months ago
Ensuring spatio-temporal access control for real-world applications
Traditional access control models, such as Role-Based Access Control (RBAC), do not take into account contextual information, such as location and time, for making access decision...
Manachai Toahchoodee, Indrakshi Ray, Kyriakos Anas...