Stephen Johnson. Lint, a C program checker. Computer Science Technical Report 65, Bell Laboratories, December 1977.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....attempts to identify program features that would cause a program to behave improperly. The analysis focuses on a particular characteristic that is typically the base cause of faults such as portability problems (i.e. when moving an application from one machine architecture to another (lint) [4]) We, however, are attempting to find portability problems, not between architectures, but between systems that have different reliability guarantees on their file system. Other approaches, such as LcLint [3] and mc [2] use programmer defined rules that specify acceptable behavior to drive the ....

S.C. Johnson. lint, a C Program Checker, Computer Science Technical Report, Number 65, 1978.

....constructive and defines a mapping algorithm. The generated grammars are both LL(1) and LALR(1) Thus, standard parser generators for LL(k) grammars or subsets thereof, such as ell [9,16] and javacc [21] can be employed to generate efficient parsers, as well as tools for LALR(1) grammars like yacc [12], bison [8] and lalr [9,16] Our experiments show them to outperform generic parsers by an order of magnitude. The body of this paper is organized as follows: Section 2 defines notions and cites results basic to our approach. Section 3 demonstrates DTD ambiguities and shows the transformation of ....

S.C. Johnson: Yacc - Yet Another Compiler-Compiler, Computer Science Technical Report 32, Bell Telephone Laboratories, Murray Hill, NJ, July 1975.

....Similar to libsafe, this library targets the set of unsafe functions, and inspects the process stack to detect buffer overflows that write across frame pointers. In contrast to libsafe, this is a custom implementation and replaces the standard C library. Several commonly used tools, such as Lint [13], and those proposed in [10] use compile time analysis to detect common programming errors. Existing compilers have also been augmented to perform bounds checking [15] These projects have demonstrated a limited success in preventing the general buffer overflow problem. Wagner et al. have ....

Stephen C. Johnson. Lint, a C program checker. Bell Laboratories, Murray Hill, New Jersey, USA, December 1977. Computer Science Technical Report 65.

....to complete, deciphering the checker s output, and identifying and suppressing spurious warnings. Figure 0 shows some classes of static checkers along the two dimensions. In the lower left corner of the figure, depicting low coverage at low e#ort, we find checkers like type checkers and lint like [17] checkers. Many programmers use checkers like these, because they perceive the benefit as outweighing the e#ort. The overall coverage may be low, but the kinds of errors caught by these checkers are common and relatively cheap to find. In the upper right corner of the figure, depicting high ....

S. C. Johnson. Lint, a C program checker. Computer Science Technical Report 65, Bell Laboratories, Murray Hill, NJ 07974, 1978.

....are the following: ffl It is able to detect incorrect use of pointers within recursive data structures. ffl It is formally based on a (natural) operational semantics of the language. ffl It offers an interactive assertion based interface to the users. This contrasts for instance with lint [13] which returns warnings concerning the use of uninitialised variables but does not check dereferences of pointers in recursive data structures. To our knowledge, no formal definition of the lint checker has been published either. Of course no static pointer analysis can be complete and we decide ....

S. Johnson, Lint, a C program checker, Computer Science technical report, Bell Laboratories, Murray Hill, NH, July 1978.

....the axiomatisation of languages with explicit pointer manipulation. We sketch related work in each of these areas in turn. ffl There are relatively few papers about the design of program analysers to help in the program development process. Most related contributions [7, 15, 17, 33] and tools [22] can provide information about uninitialised variables but are unable to track illegal accesses in dynamic data structures. Other techniques like [9, 16, 21] perform different kinds of analyses (like aspects, invariant propagation, program slicing) which are complementary to the work described ....

S. Johnson, Lint, a C program checker, Computer Science technical report, Bell Laboratories, Murray Hill, NH, July 1978.

....of what we mean by science. J. Robert Oppenheimer. race conditions in multi threaded programs. The tool is useful because the cost of an error is greatly reduced if it is detected early in the development process. The tool is intended to be like a type checker or like the C tool lint [23]: its warnings are intended to be interpreted by the author of the program being checked. The checker is implemented using the technology of program verification. The program is annotated with specifications; the annotated program is presented to a verification condition generator , which ....

S. C. Johnson. Lint, a C program checker. Computer Science Technical Report 65, Bell Laboratories, Murray Hill, NJ 07974, 1978.

....ffl the axiomatisation of languages with explicit pointer manipulation. We sketch related work in each of these areas in turn. ffl There are relatively few papers about the design of program analysers to help in the program development process. Most related contributions [6, 13, 15, 25] and tools [19] can provide information about uninitialised variables but are unable to track illegal accesses in recursive data structures. Other techniques like [14, 18] perform different kinds of analyses (like aspects, program slicing) which are complementary to the work described here. ffl There is an ....

S. Johnson, Lint, a C program checker, Computer Science technical report, Bell Laboratories, Murray Hill, NH, July 1978.

....to concrete models, and ultimately to the program itself. One of the more abstract models of a program is a set of software metrics that seek to describe quantitative aspects, rather than the requirements or operation of the application. Conventional parser implementation, as represented by yacc[9], is a prime example of some aspects of software engineering in that the code for a parser can be generated automatically from a corresponding speci cation, expressed as a context free grammar. Despite this, parser construction has not bene tted from the application of the full range of software ....

S. C. Johnson. Yacc { yet another compiler compiler. Computer Science Technical Report 32, AT&T Bell Laboratories, Murray Hill, NJ, USA, 1975.

....of a suitable diagnostic statement (such as conflicting declarations for function f in file 1, file 2 ) Possible Solutions This problem has been addressed in various C development environments in many different ways. Lint In the Unix programming environment, a separate program, lint 6 [5] handles the problem of type checking across modules [6, p. 103] by examining the set of compilation units as a whole and among other things verifying declaration and use consistency across them. Lint can pre compile information from a set of compilation units comprising a library into a ....

S. C. Johnson. Lint, a C program checker. Computer Science Technical Report 65, Bell Laboratories, Murray Hill, NJ, USA, December 1977.

....can not deal with global variables and function return types. We propose an extension to the scheme using dummy variables that would enable it to cover type checking all language objects at link time. 2 Representative Examples 2. 1 Classic C In traditional (pre ANSI) C, a separate program, lint [Joh77] handles the problem of type checking across modules [KR78, p. 103] by examining the set of compilation units as a whole and among other things verifying type correctness across them. Lint can precompile crucial information from a set of compilation units into a library which can then be ....

Stephen C. Johnson. Lint, a C program checker. Computer Science Technical Report 65, Bell Laboratories, Murray Hill, NJ, USA, December 1977.

.... the axiomatisation of languages with explicit pointer manipulation. We sketch related work in each of these areas in turn. There are relatively few papers about the design of program analysers to help in the program development process. Most related contributions [5, 12, 15, 23] and tools [19] can provide information about uninitialised variables but are unable to track illegal accesses in recursive data structures. Other techniques like [14, 18] perform different kinds of analyses (like aspects, program slicing) which are complementary to the work described here. There is an ....

S. Johnson, Lint, a C program checker, Computer Science technical report, Bell Laboratories, Murray Hill, NH, July 1978.

....can not deal with global variables and function return types. We propose an extension to the scheme using dummy variables that would enable it to cover type checking all language objects at link time. 2 Representative Examples 2. 1 Classic C In traditional (pre ANSI) C, a separate program, lint [Joh77] handles the problem of type checking across modules [KR78, p. 103] by examining the set of compilation units as a whole and among other things verifying type correctness across them. Lint can precompile crucial information from a set of compilation units into a library which can then be ....

Stephen C. Johnson. Lint, a C program checker. Computer Science Technical Report 65, Bell Laboratories, Murray Hill, NJ, USA, December 1977.

....ffl the axiomatisation of languages with explicit pointer manipulation. We sketch related work in each of these areas in turn. ffl There are relatively few papers about the design of program analysers to help in the program development process. Most related contributions [6, 13, 15, 25] and tools [19] can provide information about uninitialised variables but are unable to track illegal accesses in recursive data structures. Other techniques like [14, 18] perform different kinds of analyses (like aspects, program slicing) which are complementary to the work described here. ffl There is an ....

S. Johnson, Lint, a C program checker, Computer Science technical report, Bell Laboratories, Murray Hill, NH, July 1978.

No context found.

S. C. Johnson & B. W. Kernighan, The Programming Language B. Computer Science Technical Report 8, Bell Labs, 1972.

....using their own notation. For instance, we can use actual program notation (instead of the uniform term syntax) to express program transformations in rewrite rules and we can specify test programs in source notation. A Phobos language speci cation resembles a typical parser de nition in YACC [9], except that semantic actions for productions use term rewriting. Phobos employs informal rewriting, which means that it uses a rewriting engine that can create new variable bindings and perform capturing substitution. In Phobos, the lexer for a language is speci ed as a set of lexical rewrite ....

....the position in the source text, which can be used to produce more informative messages if an error is detected. The following example demonstrates a single lexer clause, that translates a nonnegative decimal number to a term with operator name number and a single integer parameter. NUM = [0 9] ftoken[i]fposg number[i]g The parser is de ned as a set of grammar productions. For each grammar production in the program syntax shown in Figure 1, we de ne a production in the form S : S1 : Sn term where the symbols S i may be annotated with a term pattern. For instance, the ....

S. C. Johnson. Yacc | yet another compiler compiler. Computer Science Technical Report 32, AT&T Bell Laboratories, July 1975.

....for FreeBSD [21] This library targets the set of unsafe functions, and inspects the process stack to detect buffer overflows that write across frame pointers. In contrast to our work, this is a custom implementation and replaces the standard C library. Several commonly used tools, such as Lint [11], and those proposed in [8] use compile time analysis to detect common programming errors. Existing compilers have also been augmented to perform bounds checking [13] These projects have demonstrated limited success in preventing the general buffer overflow problem. Wagner et al. have recently ....

Stephen C. Johnson. Lint, a C program checker. Bell Laboratories, Murray Hill, New Jersey, USA, December 1977. Computer Science Technical Report 65.

....Similar to libsafe, this library targets the set of unsafe functions, and inspects the process stack to detect bu er over ows that write across frame pointers. In contrast to libsafe, this is a custom implementation and replaces the standard C library. Several commonly used tools, such as Lint [11], and those proposed in [8] use compile time analysis to detect common programming errors. Existing compilers have also been augmented to perform boundschecking [13] These projects have demonstrated a limited success in preventing the general bu er over ow problem. Wagner et al. have recently ....

Stephen C. Johnson. Lint, a C program checker. Bell Laboratories, Murray Hill, New Jersey, USA, December 1977. Computer Science Technical Report 65.

No context found.

Stephen Johnson. Lint, a C program checker. Computer Science Technical Report 65, Bell Laboratories, December 1977.

No context found.

S. Johnson, Lint, a C program checker, Computer Science technical report, Bell Laboratories, Murray Hill, NH, July 1978.

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