The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrew W. Appel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrew W. Appel, Kai Li
    Virtual Memory Primitives for User Programs. [Citation Graph (2, 0)][DBLP]
    ASPLOS, 1991, pp:96-107 [Conf]
  2. Andrew W. Appel, John R. Ellis, Kai Li
    Real-Time Concurrent Collection on Stock Multiprocessors. [Citation Graph (1, 0)][DBLP]
    PLDI, 1988, pp:11-20 [Conf]
  3. Andrew W. Appel, David B. MacQueen
    Standard ML of New Jersey. [Citation Graph (1, 0)][DBLP]
    PLILP, 1991, pp:1-13 [Conf]
  4. Andrew W. Appel, Guy J. Jacobson
    The World's Fastest Scrabble Program. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1988, v:31, n:5, pp:572-578 [Journal]
  5. Neophytos G. Michael, Andrew W. Appel
    Machine Instruction Syntax and Semantics in Higher Order Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 2000, pp:7-24 [Conf]
  6. Andrew W. Appel, Edward W. Felten
    Proof-Carrying Authentication. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 1999, pp:52-62 [Conf]
  7. Lujo Bauer, Michael A. Schneider, Edward W. Felten, Andrew W. Appel
    Access Control on the Web Using Proof-carrying Authorization. [Citation Graph (0, 0)][DBLP]
    DISCEX (2), 2003, pp:117-119 [Conf]
  8. Daniel C. Wang, Andrew W. Appel, Jeffrey L. Korn, Christopher S. Serra
    The Zephyr Abstract Syntax Description Language. [Citation Graph (0, 0)][DBLP]
    DSL, 1997, pp:213-228 [Conf]
  9. Andrew W. Appel, David B. MacQueen
    A Standard ML compiler. [Citation Graph (0, 0)][DBLP]
    FPCA, 1987, pp:301-324 [Conf]
  10. Marcelo J. R. Gonçalves, Andrew W. Appel
    Cache Performance of Fast-Allocating Programs. [Citation Graph (0, 0)][DBLP]
    FPCA, 1995, pp:293-305 [Conf]
  11. Matthias Blume, Andrew W. Appel
    Lambda-Splitting: A Higher-Order Approach to Cross-Module Optimizations. [Citation Graph (0, 0)][DBLP]
    ICFP, 1997, pp:112-124 [Conf]
  12. Andrew W. Appel, Amy P. Felty
    Lightweight Lemmas in lambda-Prolog. [Citation Graph (0, 0)][DBLP]
    ICLP, 1999, pp:411-425 [Conf]
  13. Jeffrey L. Korn, Andrew W. Appel
    Traversal-Based Visualization of Data Structures. [Citation Graph (0, 0)][DBLP]
    INFOVIS, 1998, pp:11-18 [Conf]
  14. Zhong Shao, Andrew W. Appel
    Space-Efficient Closure Representations. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1994, pp:150-161 [Conf]
  15. Zhong Shao, John H. Reppy, Andrew W. Appel
    Unrolling Lists. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1994, pp:185-195 [Conf]
  16. Andrew P. Tolmach, Andrew W. Appel
    Debugging Standard ML Without Reverse Engineering. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1990, pp:1-12 [Conf]
  17. Amal J. Ahmed, Andrew W. Appel, Roberto Virga
    A Stratified Semantics of General References A Stratified Semantics of General References. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:75-0 [Conf]
  18. Andrew W. Appel
    Foundational Proof-Carrying Code. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:- [Conf]
  19. Yefim Shuf, Manish Gupta, Hubertus Franke, Andrew W. Appel, Jaswinder Pal Singh
    Creating and preserving locality of java applications at allocation and garbage collection times. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 2002, pp:13-25 [Conf]
  20. Andrew P. Tolmach, Andrew W. Appel
    Debuggable Concurrency Extensions for Standard ML. [Citation Graph (0, 0)][DBLP]
    Workshop on Parallel and Distributed Debugging, 1991, pp:120-131 [Conf]
  21. Andrew W. Appel
    Social processes and proofs of theorems and programs, revisited. [Citation Graph (0, 0)][DBLP]
    PLDI, 2004, pp:170- [Conf]
  22. Andrew W. Appel
    Real-time concurrent collection on stock multiprocessors (with retrospective) [Citation Graph (0, 0)][DBLP]
    Best of PLDI, 1988, pp:205-216 [Conf]
  23. Andrew W. Appel, Lal George
    Optimal Spilling for CISC Machines with Few Registers. [Citation Graph (0, 0)][DBLP]
    PLDI, 2001, pp:243-253 [Conf]
  24. Andrew W. Appel, David B. MacQueen
    Separate Compilation for Standard ML. [Citation Graph (0, 0)][DBLP]
    PLDI, 1994, pp:13-23 [Conf]
  25. Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang
    A provably sound TAL for back-end optimization. [Citation Graph (0, 0)][DBLP]
    PLDI, 2003, pp:208-219 [Conf]
  26. Zhong Shao, Andrew W. Appel
    A Type-Based Compiler for Standard ML. [Citation Graph (0, 0)][DBLP]
    PLDI, 1995, pp:116-129 [Conf]
  27. Andrew W. Appel
    Semantics-Directed Code Generation. [Citation Graph (0, 0)][DBLP]
    POPL, 1985, pp:315-324 [Conf]
  28. Andrew W. Appel, Amy P. Felty
    A Semantic Model of Types and Machine Instuctions for Proof-Carrying Code. [Citation Graph (0, 0)][DBLP]
    POPL, 2000, pp:243-253 [Conf]
  29. Andrew W. Appel, Trevor Jim
    Continuation-Passing, Closure-Passing Style. [Citation Graph (0, 0)][DBLP]
    POPL, 1989, pp:293-302 [Conf]
  30. Lal George, Andrew W. Appel
    Iterated Register Coalescing. [Citation Graph (0, 0)][DBLP]
    POPL, 1996, pp:208-218 [Conf]
  31. Zhong Shao, Andrew W. Appel
    Smartest Recompilation. [Citation Graph (0, 0)][DBLP]
    POPL, 1993, pp:439-450 [Conf]
  32. Daniel C. Wang, Andrew W. Appel
    Type-preserving garbage collectors. [Citation Graph (0, 0)][DBLP]
    POPL, 2001, pp:166-178 [Conf]
  33. Andrew W. Appel, Paul-André Melliès, Christopher D. Richards, Jérôme Vouillon
    A very modal model of a modern, major, general type system. [Citation Graph (0, 0)][DBLP]
    POPL, 2007, pp:109-122 [Conf]
  34. Dinghao Wu, Andrew W. Appel, Aaron Stump
    Foundational proof checkers with small witnesses. [Citation Graph (0, 0)][DBLP]
    PPDP, 2003, pp:264-274 [Conf]
  35. Rafael Alonso, Andrew W. Appel
    An Advisor for Flexible Working Sets. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 1990, pp:153-162 [Conf]
  36. Eunyoung Lee, Andrew W. Appel
    Policy-enforced linking of untrusted components. [Citation Graph (0, 0)][DBLP]
    ESEC / SIGSOFT FSE, 2003, pp:371-374 [Conf]
  37. Sudhakar Govindavajhala, Andrew W. Appel
    Using Memory Errors to Attack a Virtual Machine. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 2003, pp:154-165 [Conf]
  38. Gang Tan, Andrew W. Appel
    A Compositional Logic for Control Flow. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2006, pp:80-94 [Conf]
  39. Gang Tan, Andrew W. Appel, Kedar N. Swadi, Dinghao Wu
    Construction of a Semantic Model for a Typed Assembly Language. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2004, pp:30-43 [Conf]
  40. Andrew W. Appel, Edward W. Felten
    Technological access control interferes with noninfringing scholarship. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 2000, v:43, n:9, pp:21-23 [Journal]
  41. Andrew W. Appel, Amy P. Felty
    Polymorphic lemmas and definitions in Lambda Prolog and Twelf [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  42. Andrew W. Appel, Xavier Leroy
    A List-machine Benchmark for Mechanized Metatheory: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:174, n:5, pp:95-108 [Journal]
  43. Andrew W. Appel
    Garbage Collection can be Faster than Stack Allocation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:4, pp:275-279 [Journal]
  44. Andrew W. Appel, Neophytos G. Michael, Aaron Stump, Roberto Virga
    A Trustworthy Proof Checker. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2003, v:31, n:3-4, pp:231-260 [Journal]
  45. Andrew W. Appel
    A Critique of Standard ML. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1993, v:3, n:4, pp:391-429 [Journal]
  46. Andrew W. Appel, Amy P. Felty
    Dependent types ensure partial correctness of theorem provers. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2004, v:14, n:1, pp:3-19 [Journal]
  47. Andrew W. Appel, Trevor Jim
    Shrinking lambda Expressions in Linear Time. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1997, v:7, n:5, pp:515-540 [Journal]
  48. Andrew W. Appel, Zhong Shao
    Empirical and Analytic Study of Stack Versus Heap Cost for Languages with Closures. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1996, v:6, n:1, pp:47-74 [Journal]
  49. Andrew P. Tolmach, Andrew W. Appel
    A Debugger for Standard ML. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1995, v:5, n:2, pp:155-200 [Journal]
  50. Andrew W. Appel
    Runtime Tags Aren't Necessary. [Citation Graph (0, 0)][DBLP]
    Lisp and Symbolic Computation, 1989, v:2, n:2, pp:153-162 [Journal]
  51. Andrew W. Appel
    A Runtime System. [Citation Graph (0, 0)][DBLP]
    Lisp and Symbolic Computation, 1990, v:3, n:4, pp:343-380 [Journal]
  52. Andrew W. Appel
    Loop Headers in Lambda-Calculus or CPS. [Citation Graph (0, 0)][DBLP]
    Lisp and Symbolic Computation, 1994, v:7, n:4, pp:337-343 [Journal]
  53. Andrew W. Appel, Zhong Shao
    Callee-Save Registers in Continuation-Passing Style. [Citation Graph (0, 0)][DBLP]
    Lisp and Symbolic Computation, 1992, v:5, n:3, pp:191-221 [Journal]
  54. Andrew W. Appel
    SSA is Functional Programming. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1998, v:33, n:4, pp:17-20 [Journal]
  55. Andrew W. Appel
    Is POPL mathematics or science? [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1992, v:27, n:4, pp:87-89 [Journal]
  56. Andrew W. Appel
    Intensional Equality ;=) for Continuations. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1996, v:31, n:2, pp:55-57 [Journal]
  57. Andrew W. Appel
    Simple Generational Garbage Collection and Fast Allocation. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1989, v:19, n:2, pp:171-183 [Journal]
  58. Andrew W. Appel
    Allocation without Locking. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1989, v:19, n:7, pp:703-705 [Journal]
  59. Andrew W. Appel, Kenneth J. Supowit
    Generalization of the Sethi-Ullman Algorithm for Register Allocation. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1987, v:17, n:6, pp:417-421 [Journal]
  60. Lujo Bauer, Andrew W. Appel, Edward W. Felten
    Mechanisms for secure modular programming in Java. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 2003, v:33, n:5, pp:461-480 [Journal]
  61. Andrew W. Appel
    Simulating digital circuits with one bit per wire. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1988, v:7, n:9, pp:987-993 [Journal]
  62. Matthias Blume, Andrew W. Appel
    Hierarchical modularity. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1999, v:21, n:4, pp:813-847 [Journal]
  63. Andrew W. Appel
    Axiomatic Bootstrapping: A Guide for Compiler Hackers. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1994, v:16, n:6, pp:1699-1718 [Journal]
  64. Andrew W. Appel, David A. McAllester
    An indexed model of recursive types for foundational proof-carrying code. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2001, v:23, n:5, pp:657-683 [Journal]
  65. Lal George, Andrew W. Appel
    Iterated Register Coalescing. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1996, v:18, n:3, pp:300-324 [Journal]
  66. Zhong Shao, Andrew W. Appel
    Efficient and safe-for-space closure conversion. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2000, v:22, n:1, pp:129-161 [Journal]
  67. Dan S. Wallach, Andrew W. Appel, Edward W. Felten
    SAFKASI: a security mechanism for language-based systems. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Softw. Eng. Methodol., 2000, v:9, n:4, pp:341-378 [Journal]
  68. Andrew W. Appel, Amy P. Felty
    Polymorphic Lemmas and Definitions in lambda-Prolog and Twelf. [Citation Graph (0, 0)][DBLP]
    TPLP, 2004, v:4, n:1-2, pp:1-39 [Journal]
  69. Andrew W. Appel, Sandrine Blazy
    Separation Logic for Small-Step cminor. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2007, pp:5-21 [Conf]
  70. Andrew W. Appel, Sandrine Blazy
    Separation Logic for Small-step Cminor [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  71. A Fresh Look at Separation Algebras and Share Accounting. [Citation Graph (, )][DBLP]


  72. Oracle Semantics for Concurrent Separation Logic. [Citation Graph (, )][DBLP]


  73. Formal Verification of Coalescing Graph-Coloring Register Allocation. [Citation Graph (, )][DBLP]


  74. A theory of indirection via approximation. [Citation Graph (, )][DBLP]


  75. Concurrent Separation Logic for Pipelined Parallelization. [Citation Graph (, )][DBLP]


  76. Multimodal Separation Logic for Reasoning About Operational Semantics. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002