Compilers: Principles, Techniques, and Tools

By Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman. 1986

Citations in the corpus

• Control-flow integrity principles, implementations, and applications (2009, unknown): “, [Aho et al. 1985; Atkinson 2002; Wagner and Dean 2001]), for instance at compile time.”
• Grammar-based Neural Text-to-SQL Generation (2019, unknown): “Constructing a grammar that constrains the outputs correctly such that it cannot generate invalid programs (“over-generate”) is difficult, as the abstract syntax trees (ASTs; Aho et al., 1986) used by the languages’ compilers 1 are not suffi-ciently constraining.”
• Optimizing Java Bytecode Using the Soot Framework: Is It Feasible? (2000, unknown): “The compiler javac is able to produce efficient bytecode because it has the structured tree representation ofthe original program, and the stack based nature of the bytecode is particularly well suited for code generation from trees[ 2 ].”
• Learning of Context-Free Languages: A Survey of the Literature (1996, unknown): “A handle of a sentential form is a substring of the sentential form with the property that there exists a production A ! and replacing by A would produce the previous sentential form in a rightmost derivation [ ASU88 ].”
• A Software Package for the Numerical Integration of ODEs by Means of High-Order Taylor Methods (2005, unknown): “A detailed exposition can be found in [Aho et al. 86].”
• Securing software by enforcing data-flow integrity (2006, unknown): “Using the terminology from [ 7 ], an instruction that writes to a memory position denes the value in the memory position, and an instruction that reads the value is said to use the value.”
• A methodology for testing spreadsheets (2001, unknown): “The process of translating an abstract syntax tree representation of an expression into its control ow graph representation is well known [1]; a similar translation applied to the abstract syntax tree for each formula in a spreadsheet yields that formula's formula graph.”
• Sequoia: Programming the Memory Hierarchy (2006, unknown): “To encapsulate communication, Sequoia tasks use call-by-value-result (CBVR) [Aho et al. 1986] parameter passing semantics.”
• The Tapenade automatic differentiation tool: Principles, model, and specification (2013, unknown): “Data-Flow Equations of Program Static Analysis Static data-.ow analysis [Aho et al. 1986] is an essential step to achieve ef.cient differ­entiation.”
• Soot: a Java bytecode optimization framework (2010, unknown): “Standard code generation techniques for stack machines are used here[ 2 ].”
• Lazy abstraction (2002, unknown): “This is essentially the control ow graph [1], with instructions labeling the edges rather than the vertices.”
• Superoptimizer: a look at the smallest program (1987, unknown): “Data-flow analysis [1] is a technique applied during the semantic and code generation phases of the compilation process.”