The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David R. Musser: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. John V. Guttag, Ellis Horowitz, David R. Musser
    Abstract Data Types and Software Validation. [Citation Graph (5, 0)][DBLP]
    Commun. ACM, 1978, v:21, n:12, pp:1048-1064 [Journal]
  2. Roddy W. Erickson, David R. Musser
    The AFFIRM Theorem Prover: Proof Forests and Management of Large Proofs. [Citation Graph (0, 0)][DBLP]
    CADE, 1980, pp:220-231 [Conf]
  3. Sibylle Schupp, Douglas Gregor, David R. Musser, Shin-Ming Liu
    User-Extensible Simplification–Type-Based Optimizer Generators. [Citation Graph (0, 0)][DBLP]
    CC, 2001, pp:86-101 [Conf]
  4. David R. Musser, Arturo J. Sánchez-Ruíz
    Theory and Generality of Complete Traversals. [Citation Graph (0, 0)][DBLP]
    Generic Programming, 1998, pp:91-101 [Conf]
  5. David R. Musser, Sibylle Schupp, Rüdiger Loos
    Requirement Oriented Programming. [Citation Graph (0, 0)][DBLP]
    Generic Programming, 1998, pp:12-24 [Conf]
  6. Deepak Kapur, David R. Musser, Xumin Nie
    The Tecton Proof System. [Citation Graph (0, 0)][DBLP]
    Formal Methods in Databases and Software Engineering, 1992, pp:54-79 [Conf]
  7. David R. Musser, Deepak Kapur
    Rewrite Rule Theory and Abstract Data Type Analysis. [Citation Graph (0, 0)][DBLP]
    EUROCAM, 1982, pp:77-90 [Conf]
  8. Deepak Kapur, David R. Musser, Alexander A. Stepanov
    Tecton: A Language for Manipulating Generic Objects. [Citation Graph (0, 0)][DBLP]
    Program Specification, 1981, pp:402-414 [Conf]
  9. Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman
    Semi-Unification. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:435-454 [Conf]
  10. Douglas Gregor, Sibylle Schupp, David R. Musser
    Base Class Injection. [Citation Graph (0, 0)][DBLP]
    GCSE, 2001, pp:106-117 [Conf]
  11. John V. Guttag, Deepak Kapur, David R. Musser
    Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:300-312 [Conf]
  12. David R. Musser, Zhiqing Shao
    Concept Use or Concept Refinement: An Important Distinction in Building Generic Specifications. [Citation Graph (0, 0)][DBLP]
    ICFEM, 2002, pp:132-143 [Conf]
  13. John V. Guttag, Ellis Horowitz, David R. Musser
    The Design of Data Type Specifications. [Citation Graph (0, 0)][DBLP]
    ICSE, 1976, pp:414-420 [Conf]
  14. Susan L. Gerhart, David R. Musser, David H. Thompson, D. A. Baker, R. L. Bates, Roddy W. Erickson, R. L. London, D. G. Taylor, David S. Wile
    An Overview of AFFIRM: A Specification and Verification System. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1980, pp:343-347 [Conf]
  15. William Klostermeyer, David R. Musser, Arturo J. Sánchez-Ruíz
    Complete Traversals as General Iteration Patterns. [Citation Graph (0, 0)][DBLP]
    Generic Programming, 2002, pp:187-206 [Conf]
  16. Jaakko Järvi, Andrew Lumsdaine, D. P. Gregor, Mayuresh Kulkarni, David R. Musser, Sibylle Schupp
    Generic Programming and High-Performance Libraries. [Citation Graph (0, 0)][DBLP]
    IPDPS Next Generation Software Program - NSFNGS - PI Workshop, 2004, pp:- [Conf]
  17. Sibylle Schupp, D. P. Gregor, B. Osman, David R. Musser, Jeremy G. Siek, Lie-Quan Lee, Andrew Lumsdaine
    Concept-Based Component Libraries and Optimizing Compilers. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  18. Úlfar Erlingsson, Erich Kaltofen, David R. Musser
    Generic Gram-Schmidt Orthogonalization by Exact Division. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1996, pp:275-282 [Conf]
  19. David R. Musser, Alexander A. Stepanov
    Generic Programming. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1988, pp:13-25 [Conf]
  20. John V. Guttag, Ellis Horowitz, David R. Musser
    Some Extensions to Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    Language Design for Reliable Software, 1977, pp:63-67 [Conf]
  21. Deepak Kapur, David R. Musser
    Inductive Reasoning with Incomplete Specifications (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    LICS, 1986, pp:367-377 [Conf]
  22. Josh Bloch, Jaakko Järvi, David R. Musser, Sibylle Schupp, Jeremy G. Siek
    LCSD: library-centric software design. [Citation Graph (0, 0)][DBLP]
    OOPSLA Companion, 2006, pp:618- [Conf]
  23. David R. Musser
    On Proving Inductive Properties of Abstract Data Types. [Citation Graph (0, 0)][DBLP]
    POPL, 1980, pp:154-162 [Conf]
  24. Raj Agarwal, David R. Musser, Deepak Kapur, Xumin Nie
    The Tecton Proof System. [Citation Graph (0, 0)][DBLP]
    RTA, 1991, pp:442-444 [Conf]
  25. Sibylle Schupp, Douglas Gregor, David R. Musser
    Library Transformations. [Citation Graph (0, 0)][DBLP]
    SCAM, 2001, pp:111-123 [Conf]
  26. Deepak Kapur, David R. Musser
    Proof by Consistency. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1987, v:31, n:2, pp:125-157 [Journal]
  27. Eric Gamess, David R. Musser, Arturo J. Sánchez-Ruíz
    Complete Traversals and their Implementation Using the Standard Template Library. [Citation Graph (0, 0)][DBLP]
    CLEI Electron. J., 1998, v:1, n:2, pp:- [Journal]
  28. Douglas Gregor, Jaakko Järvi, Mayuresh Kulkarni, Andrew Lumsdaine, David R. Musser, Sibylle Schupp
    Generic Programming and High-Performance Libraries. [Citation Graph (0, 0)][DBLP]
    International Journal of Parallel Programming, 2005, v:33, n:2-3, pp:145-164 [Journal]
  29. Sibylle Schupp, Douglas Gregor, David R. Musser, Shin-Ming Liu
    Semantic and behavioral library transformations. [Citation Graph (0, 0)][DBLP]
    Information & Software Technology, 2002, v:44, n:13, pp:797-810 [Journal]
  30. George E. Collins, David R. Musser
    Analysis of the Pope-Stein Division Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1977, v:6, n:5, pp:151-155 [Journal]
  31. David R. Musser
    Multivariate Polynomial Factorization. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1975, v:22, n:2, pp:291-308 [Journal]
  32. David R. Musser
    On the Efficiency of a Polynomial Irreducibility Test. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:2, pp:271-282 [Journal]
  33. Deepak Kapur, David R. Musser, Paliath Narendran
    Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1988, v:6, n:1, pp:19-36 [Journal]
  34. John V. Guttag, Deepak Kapur, David R. Musser
    On Proving Uniform Termination and Restricted Termination of Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:1, pp:189-214 [Journal]
  35. Erich Kaltofen, David R. Musser, B. David Saunders
    A Generalized Class of Polynomials that are Hard to Factor. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:3, pp:473-483 [Journal]
  36. Douglas Gregor, Sibylle Schupp, David R. Musser
    Design patterns for library optimization. [Citation Graph (0, 0)][DBLP]
    Scientific Programming, 2003, v:11, n:4, pp:309-320 [Journal]
  37. David R. Musser
    Introspective Sorting and Selection Algorithms. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1997, v:27, n:8, pp:983-993 [Journal]
  38. David R. Musser, Alexander A. Stepanov
    Algorithm-oriented Generic Libraries. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1994, v:24, n:7, pp:623-642 [Journal]
  39. Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman
    Semi-Unification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:169-187 [Journal]
  40. Deepak Kapur, Xumin Nie, David R. Musser
    An Overview of the Tecton Proof System. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:133, n:2, pp:307-339 [Journal]
  41. David R. Musser
    Abstract Data Type Specification in the AFFIRM System. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1980, v:6, n:1, pp:24-32 [Journal]
  42. Changqing Wang, David R. Musser
    Dynamic Verification of C++ Generic Algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1997, v:23, n:5, pp:314-323 [Journal]

  43. Code-carrying theory. [Citation Graph (, )][DBLP]


  44. A Fast Generic Sequence Matching Algorithm [Citation Graph (, )][DBLP]


Search in 0.047secs, Finished in 0.049secs
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