Alfred V. Aho - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 79 from 79

2008

Do Crosscutting Concerns Cause Defects?Marc Eaddy, Thomas Zimmermann, Kaitin D. Sherwood, Vibhav Garg, Gail C. Murphy, Nachiappan Nagappan, Alfred V. Aho. TSE, 34(4):497-515, 2008. [doi]

CERBERUS: Tracing Requirements to Source Code Using Information Retrieval, Dynamic Analysis, and Program AnalysisMarc Eaddy, Alfred V. Aho, Giuliano Antoniol, Yann-Gaël Guéhéneuc. IWPC 2008: 53-62 [doi]

2007

Debugging Aspect-Enabled ProgramsMarc Eaddy, Alfred V. Aho, Weiping Hu, Paddy McDonald, Julian Burger. SC 2007: 200-215 [doi]

2006

Statement Annotations for Fine-Grained AdvisingMarc Eaddy, Alfred V. Aho. ECOOPW 2006: 89-99

A Layered Software Architecture for Quantum Computing Design ToolsKrysta Marie Svore, Alfred V. Aho, Andrew W. Cross, Isaac L. Chuang, Igor L. Markov. Computer, 39(1):74-83, 2006. [doi]

2002

Reminiscences on Influential PapersKenneth A. Ross, Alfred V. Aho, Anastassia Ailamaki. SIGMOD, 31(4):97, 2002. [doi]

1998

SCF3/Sculptor with Chisel: Requirements Engineering for Communications ServicesAlfred V. Aho, Sean Gallagher, Nancy D. Griffeth, Cynthia Schell, Deborah Swayne. fiw 1998: 45-63

1997

Columbia Digital News System An Environment for Briefing and Search over Multimedia InformationAlfred V. Aho, Shih-Fu Chang, Kathleen McKeown, Dragomir R. Radev, John R. Smith, Kazi A. Zaman. adl 1997: 82-94 [doi]

Columbia Digital News Project: An Environment for Briefing and Search over Multimedia InformationAlfred V. Aho, Shih-Fu Chang, Kathleen McKeown, Dragomir R. Radev, John R. Smith, Kazi A. Zaman. jodl, 1(4):377-385, 1997. [doi]

1996

Accessing Information from Globally Distributed Knowledge RepositoriesAlfred V. Aho. PODS 1996: 1-4 [doi]

1995

Feature Interactions in the Global Information Infrastructure (Panel)Alfred V. Aho, Nancy D. Griffeth. ESEC/FSE 1995: 2-4 [doi]

1990

Algorithms for Finding Patterns in StringsAlfred V. Aho. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B). pages 255-300, 1990.

1989

Code Generation Using Tree Matching and Dynamic ProgrammingAlfred V. Aho, Mahadevan Ganapathi, Steven W. K. Tjiang. TOPLAS, 11(4):491-516, 1989. [doi]

1988

Maintaining Cross References in ManuscriptsAlfred V. Aho, Ravi Sethi. SPE, 18(1):1-13, 1988.

The AWK Programming LanguageAlfred V. Aho, Brian W. Kernighan, Peter J. Weinberger. Addison-Wesley, 1988.

1986

Storing a Dynamic Sparse TableAlfred V. Aho, David Lee. focs 1986: 55-60

Compilers: Principles, Techniques, and ToolsAlfred V. Aho, Ravi Sethi, Jeffrey D. Ullman. Addison-Wesley, 1986.

1985

Efficient Tree Pattern Matching: An Aid to Code GenerationAlfred V. Aho, Mahadevan Ganapathi. POPL 1985: 334-340

1983

Data Structures and AlgorithmsAlfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman. Addison-Wesley, 1983.

On Notions of Information Transfer in VLSI CircuitsAlfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis. stoc 1983: 133-139

1981

Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational ExpressionsAlfred V. Aho, Yehoshua Sagiv, Thomas G. Szymanski, Jeffrey D. Ullman. SICOMP, 10(3):405-421, 1981.

1979

Awk-A Pattern Scanning and Processing LanguageAlfred V. Aho, Brian W. Kernighan, Peter J. Weinberger. SPE, 9(4):267-279, 1979.

Optimal Partial-Match Retrieval When Fields Are Independently SpecifiedAlfred V. Aho, Jeffrey D. Ullman. TODS, 4(2):168-179, 1979. [doi]

Efficient Optimization of a Class of Relational ExpressionsAlfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman. TODS, 4(4):435-454, 1979. [doi]

The Theory of Joins in Relational DatabasesAlfred V. Aho, Catriel Beeri, Jeffrey D. Ullman. TODS, 4(3):297-314, 1979. [doi]

Equivalences Among Relational ExpressionsAlfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman. SICOMP, 8(2):218-246, 1979.

The Universality of Data Retrieval LanguagesAlfred V. Aho, Jeffrey D. Ullman. POPL 1979: 110-120 [doi]

Modeling Communications Protocols by AutomataAlfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis. focs 1979: 267-273

Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languageBarry K. Rosen, Alfred V. Aho, Stephen N. Zilles , editors, ACM, January 1979. [doi]

1978

Tools For Automatic Compiler Generation (Panel Discussion)Alfred V. Aho, Susan L. Graham. acm 1978: 476-477 [doi]

Tools For Automatic Compiler Generation (Panel Discussion)Alfred V. Aho, Steven C. Johnson. acm 1978: 476 [doi]

Efficient Optimization of a Class of Relational Expressions (Abstract)Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman. SIGMOD 1978: 39 [doi]

1977

1976

Optimal Code Generation for Expression TreesAlfred V. Aho, Stephen C. Johnson. JACM, 23(3):488-501, 1976. [doi]

Bounds on the Complexity of the Longest Common Subsequence ProblemAlfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman. JACM, 23(1):1-12, 1976. [doi]

Node Listings for Reducible Flow GraphsAlfred V. Aho, Jeffrey D. Ullman. jcss, 13(3):286-299, 1976.

On Finding Lowest Common Ancestors in TreesAlfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman. SICOMP, 5(1):115-132, 1976.

Code Generation for Expressions with Common SubexpressionsAlfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman. POPL 1976: 19-31

1975

1974

LR ParsingAlfred V. Aho, Stephen C. Johnson. ACM Comput. Surv., 6(2):99-124, 1974.

The Design and Analysis of Computer AlgorithmsAlfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman. Addison-Wesley, 1974.

Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract)Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman. focs 1974: 104-109

1973

A Technique for Speeding up LR(k) ParsersAlfred V. Aho, Jeffrey D. Ullman. SICOMP, 2(2):106-127, 1973.

Error Detection in Precedence ParsersAlfred V. Aho, Jeffrey D. Ullman. mst, 7(2):97-113, 1973.

On Finding Lowest Common Ancestors in TreesAlfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman. stoc 1973: 253-265

Deterministic Parsing of Ambiguous GrammarsAlfred V. Aho, Steven C. Johnson, Jeffrey D. Ullman. POPL 1973: 1-21

1972

A Minimum Distance Error-Correcting Parser for Context-Free LanguagesAlfred V. Aho, Thomas G. Peterson. SICOMP, 1(4):305-312, 1972.

Equivalence of Programs with Structured VariablesAlfred V. Aho, Jeffrey D. Ullman. jcss, 6(2):125-137, 1972.

The Transitive Reduction of a Directed GraphAlfred V. Aho, M. R. Garey, Jeffrey D. Ullman. SICOMP, 1(2):131-137, 1972.

Optimization of LR(k) ParsersAlfred V. Aho, Jeffrey D. Ullman. jcss, 6(6):573-602, 1972.

Optimization of Straight Line ProgramsAlfred V. Aho, Jeffrey D. Ullman. SICOMP, 1(1):1-19, 1972.

A Technique for Speeding Up LR(k) ParsersAlfred V. Aho, Jeffrey D. Ullman. stoc 1972: 251-263

Weak and Mixed Strategy Precedence ParsingAlfred V. Aho, Peter J. Denning, Jeffrey D. Ullman. JACM, 19(2):225-243, 1972. [doi]

1971

Translations on a Context-Free GrammarAlfred V. Aho, Jeffrey D. Ullman. iandc, 19(5):439-475, December 1971.

Characterizations and Extensions of Pushdown TranslationsAlfred V. Aho, Jeffrey D. Ullman. mst, 5(2):172-192, 1971.

The Care and Feeding of LR(k) GrammarsAlfred V. Aho, Jeffrey D. Ullman. stoc 1971: 159-170

Principles of Optimal Page ReplacementAlfred V. Aho, Peter J. Denning, Jeffrey D. Ullman. JACM, 18(1):80-93, 1971. [doi]

1970

A Characterization of Two-Way Deterministic Classes of LanguagesAlfred V. Aho, Jeffrey D. Ullman. jcss, 4(6):523-538, 1970.

On the Computational Power of Pushdown AutomataAlfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft. jcss, 4(2):129-136, 1970.

Transformations on Straight Line Programs-Preliminary VersionAlfred V. Aho, Jeffrey D. Ullman. stoc 1970: 136-148

Equivalence of Programs with Structured VariablesAlfred V. Aho, Jeffrey D. Ullman. focs 1970: 25-31

1969

Nested Stack AutomataAlfred V. Aho. JACM, 16(3):383-406, 1969. [doi]

A General Theory of TranslationAlfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman. mst, 3(3):193-221, 1969.

Syntax Directed Translations and the Pushdown AssemblerAlfred V. Aho, Jeffrey D. Ullman. jcss, 3(1):37-56, 1969.

Properties of Syntax Directed TranslationsAlfred V. Aho, Jeffrey D. Ullman. jcss, 3(3):319-334, 1969.

A Characterization of Two-Way Deterministic Classes of LanguagesAlfred V. Aho, Jeffrey D. Ullman. focs 1969: 231-239

Translations on a Context Free GrammarAlfred V. Aho, Jeffrey D. Ullman. stoc 1969: 93-112

1968

Indexed Grammars - An Extension of Context-Free GrammarsAlfred V. Aho. JACM, 15(4):647-671, 1968. [doi]

The Theory of LanguagesAlfred V. Aho, Jeffrey D. Ullman. mst, 2(2):97-125, 1968.

Time and Tape Complexity of Pushdown Automaton LanguagesAlfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman. iandc, 13(3):186-206, September 1968.

Automaton Analogs of Syntax Directed Translation SchemataAlfred V. Aho, Jeffrey D. Ullman. focs 1968: 143-159

1967

Indexed Grammars-An Extension of Context Free GrammarsAlfred V. Aho. focs 1967: 21-31

Sign in or sign up to see more results.

runs on WebDSL