Results 1 - 10 of 727

Safe Kernel Extensions Without Run-Time Checking

by George C. Necula, Peter Lee - Proc. of OSDI'96
"... Abstract This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel first defines a safety policy and makes it public. Then, using this policy, an application can provide binaries i ..."
Abstract - Cited by 429 (20 self) - Add to MetaCart
Abstract This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel first defines a safety policy and makes it public. Then, using this policy, an application can provide binaries

Improving the Fisher kernel for large-scale image classification.

by Florent Perronnin , Jorge Sánchez , Thomas Mensink - In ECCV, , 2010
"... Abstract. The Fisher kernel (FK) is a generic framework which combines the benefits of generative and discriminative approaches. In the context of image classification the FK was shown to extend the popular bag-of-visual-words (BOV) by going beyond count statistics. However, in practice, this enric ..."
Abstract - Cited by 362 (20 self) - Add to MetaCart
Abstract. The Fisher kernel (FK) is a generic framework which combines the benefits of generative and discriminative approaches. In the context of image classification the FK was shown to extend the popular bag-of-visual-words (BOV) by going beyond count statistics. However, in practice

seL4: Formal Verification of an OS Kernel

by Gerwin Klein, Kevin Elphinstone, Gernot Heiser, June Andronick, David Cock, Philip Derrin, Dhammika Elkaduwe, Kai Engelhardt, Rafal Kolanski, Michael Norrish, Thomas Sewell, Harvey Tuch, Simon Winwood - ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES , 2009
"... Complete formal verification is the only known way to guarantee that a system is free of programming errors. We present our experience in performing the formal, machine-checked verification of the seL4 microkernel from an abstract specification down to its C implementation. We assume correctness of ..."
Abstract - Cited by 297 (47 self) - Add to MetaCart
of compiler, assembly code, and hardware, and we used a unique design approach that fuses formal and operating systems techniques. To our knowledge, this is the first formal proof of functional correctness of a complete, general-purpose operating-system kernel. Functional correctness means here

µ-Kernels Must And Can Be Small

by Jochen Liedtke - In 5th International Workshop on Object Orientation in Operating Systems (IWOOOS , 1996
"... For a general acceptance, -kernels must be fast and not burden applications. For fulfilling these conditions, cache architectures require -kernels to be small. The L4 -kernel shows that smallness can be achieved. 1. -kernels must be small This is not obvious. Most first-generation -kernels were la ..."
Abstract - Cited by 14 (0 self) - Add to MetaCart
For a general acceptance, -kernels must be fast and not burden applications. For fulfilling these conditions, cache architectures require -kernels to be small. The L4 -kernel shows that smallness can be achieved. 1. -kernels must be small This is not obvious. Most first-generation -kernels were

The performance of µ-kernel-based systems

by Hermann Härtig, Michael Hohmuth, Jochen Liedtke, Sebastian Schönberg, Jean Wolter - In 16 th ACM Symposium on Operating Systems Principles , 1997
"... First-generation µ-kernels have a reputation for being too slow and lacking sufficient flexibility. To determine whether L4, a lean second-generation µ-kernel, has overcome these limitations, we have repeated several earlier experiments and conducted some novel ones. Moreover, we ported the Linux op ..."
Abstract - Cited by 148 (17 self) - Add to MetaCart
First-generation µ-kernels have a reputation for being too slow and lacking sufficient flexibility. To determine whether L4, a lean second-generation µ-kernel, has overcome these limitations, we have repeated several earlier experiments and conducted some novel ones. Moreover, we ported the Linux

Deformable kernels for early vision

by Pietro Perona , 1991
"... Early vision algorithms often have a first stage of linear-filtering that 'extracts' from the image information at multiple scales of resolution and multiple orientations. A common difficulty in the design and implementation of such schemes is that one feels compelled to discretize coarsel ..."
Abstract - Cited by 145 (10 self) - Add to MetaCart
that demonstrate the applicability of the technique to generating multi-orientation multi-scale 2D edge-detection kernels. The implementation issues are also discussed.

Optimizing Matrix Multiply using PHiPAC: a Portable, High-Performance, ANSI C Coding Methodology

by Jeff Bilmes, Krste Asanovic , Chee-Whye Chin , Jim Demmel , 1996
"... Modern microprocessors can achieve high performance on linear algebra kernels but this currently requires extensive machine-specific hand tuning. We have developed a methodology whereby near-peak performance on a wide range of systems can be achieved automatically for such routines. First, by analyz ..."
Abstract - Cited by 268 (24 self) - Add to MetaCart
Modern microprocessors can achieve high performance on linear algebra kernels but this currently requires extensive machine-specific hand tuning. We have developed a methodology whereby near-peak performance on a wide range of systems can be achieved automatically for such routines. First

Kernel Density Estimation and Intrinsic Alignment for Knowledge-driven Segmentation: Teaching Level Sets to Walk

by Daniel Cremers, Stanley J. Osher, Stefano Soatto - International Journal of Computer Vision , 2004
"... We address the problem of image segmentation with statistical shape priors in the context of the level set framework. Our paper makes two contributions: Firstly, we propose to generate invariance of the shape prior to certain transformations by intrinsic registration of the evolving level set fun ..."
Abstract - Cited by 116 (16 self) - Add to MetaCart
We address the problem of image segmentation with statistical shape priors in the context of the level set framework. Our paper makes two contributions: Firstly, we propose to generate invariance of the shape prior to certain transformations by intrinsic registration of the evolving level set

Defeating returnoriented rootkits with return-less kernels

by Jinku Li, Zhi Wang, Xuxian Jiang, Mike Grace, Sina Bahram - in Proceedings of the 5th European conference on Computer systems
"... Targeting the operating system (OS) kernels, kernel rootkits pose a formidable threat to computer systems and their users. Recent efforts have made significant progress in blocking them from injecting malicious code into the OS kernel for execution. Unfortunately, they cannot block the emerging so-c ..."
Abstract - Cited by 53 (5 self) - Add to MetaCart
, to avoid introducing them in the first place. We have developed a LLVM-based prototype and used it to generate a return-less FreeBSD kernel. Our evalu-ation results indicate that the proposed approach is generic, effective, and can be implemented on commodity hardware with a low performance overhead.

The design of a COTS real-time distributed security kernel

by Miguel Correia, Paulo Veríssimo, Nuno Ferreira Neves - In Proceedings of the Fourth European Dependable Computing Conference , 2002
"... Abstract. This paper describes the design of a security kernel called TTCB, which has innovative features. Firstly, it is a distributed subsystem with its own secure network. Secondly, the TTCB is real-time, that is, a synchronous subsystem capable of timely behavior. These two characteristics toget ..."
Abstract - Cited by 63 (33 self) - Add to MetaCart
Abstract. This paper describes the design of a security kernel called TTCB, which has innovative features. Firstly, it is a distributed subsystem with its own secure network. Secondly, the TTCB is real-time, that is, a synchronous subsystem capable of timely behavior. These two characteristics
Results 1 - 10 of 727