| D. Engler, B. Chelf, A. Chou, and S. Hallem, "Checking system rules using system-specific, programmer-written compiler extensions," in Proceedings of the Fourth Symposium on Operating Systems Design and Implementation, San Diego, CA, Oct. 2000. |
....is possible to create a new safe interpreter, which provides access to only a small subset of the programming language, guaranteed to be safe. The OKE s language restriction is related to such efforts, but with a greater arsenal of possible restrictions. Extensible compilers are presented in [ECCH00] Extensions are written in a special purpose extension language that is quite good at expressing coding conventions that must be enforced. For example, using the pattern matching capabilities supplied by the language, it is possible to make the compiler scan each function to check that all ....
....language (see also Section III D) Most runtime checks can easily be added by explicitly introducing the concept of wrapping, the automatic creation of code wrappers around certain constructs. Extensible compilers are still useful, e.g. to check whether code adheres to coding conventions (see [ECCH00] but for our purposes, the usefulness is limited. In our current implementation, although the mechanism is still present, we no longer focus on low level production rules that can be loaded dynamically, concentrating instead on providing the necessary customisability in the language itself. We ....
Dawson Engler, Benjamin Chelf, Andy Chou, and Seth Hallem. Checking system rules using system-specific programmer-written compiler extensions. In OSDI, 2000.
....polymorphic recursion [33] in the future to remedy this. Static Bug Detection. Many authors have noted that static analysis can be a useful tool for detecting bugs. For instance, LCLint [18] uses dataflow analysis to search for common errors in C programs; Engler et al. s Meta level Compilation [17] statically simulates the behavior of a user defined finite state machine and has been successful at finding many new bugs; and the Extended Static Checking system (ESC) 26] uses theorem proving to verify the validity of annotated Java source code. These systems have been very successful at ....
Dawson Engler, Benjamin Chelf, Andy Chou, and Seth Hallem. "Checking System Rules Using SystemSpecific, Programmer-Written Compiler Extensions." In Proceedings of the Fourth Symposium on Operating Systems Design and Implementation, San Diego, CA, October 2000.
No context found.
D. Engler, B. Chelf, A. Chou, and S. Hallem, "Checking system rules using system-specific, programmer-written compiler extensions," in Proceedings of the Fourth Symposium on Operating Systems Design and Implementation, San Diego, CA, Oct. 2000.
No context found.
D. Engler, B. Chelf, A. Chou, and S. Hallem, "Checking system rules using system-specific, programmer-written compiler extensions," in Symposium on Operating Systems Design and Implementation, 2000. [Online]. Available: http://citeseer.nj.nec.com/article/engler00checking.html
No context found.
Engler, D., B. Chelf, A. Chou, and S. Hallem: 2000, `Checking System Rules Using System-Specific, Programmer-Written Compiler Extensions'. In: Symposium on Operating Systems Design and Implementation.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC