default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid R. Musser
Person information
- affiliation: Rensselaer Polytchnic Institute, Troy, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[c34]David R. Musser, Carlos A. Varela:
Structured reasoning about actor systems. AGERE!@SPLASH 2013: 37-48
2000 – 2009
- 2008
- [c33]Aytekin Vargun, David R. Musser:
Code-carrying theory. SAC 2008: 376-383 - [i1]David R. Musser, Gor V. Nishanov:
A Fast Generic Sequence Matching Algorithm. CoRR abs/0810.0264 (2008) - 2006
- [c32]Ana L. Milanova, Sonia Fahmy
, David R. Musser, Bülent Yener:
A Secure Programming Paradigm for Network Virtualization. BROADNETS 2006 - [c31]Josh Bloch, Jaakko Järvi, David R. Musser, Sibylle Schupp, Jeremy G. Siek:
LCSD: library-centric software design. OOPSLA Companion 2006: 618 - 2005
- [j20]Douglas P. Gregor, Jaakko Järvi, Mayuresh Kulkarni, Andrew Lumsdaine, David R. Musser, Sibylle Schupp:
Generic Programming and High-Performance Libraries. Int. J. Parallel Program. 33(2-3): 145-164 (2005) - 2004
- [c30]Jaakko Järvi, Andrew Lumsdaine, Douglas P. Gregor, Mayuresh Kulkarni, David R. Musser, Sibylle Schupp:
Generic Programming and High-Performance Libraries. IPDPS Next Generation Software Program - NSFNGS - PI Workshop 2004 - 2003
- [j19]Douglas P. Gregor, Sibylle Schupp, David R. Musser:
Design patterns for library optimization. Sci. Program. 11(4): 309-320 (2003) - 2002
- [j18]Sibylle Schupp, Douglas P. Gregor, David R. Musser, Shin-Ming Liu:
Semantic and behavioral library transformations. Inf. Softw. Technol. 44(13): 797-810 (2002) - [c29]David R. Musser, Zhiqing Shao:
Concept Use or Concept Refinement: An Important Distinction in Building Generic Specifications. ICFEM 2002: 132-143 - [c28]William Klostermeyer, David R. Musser, Arturo J. Sánchez-Ruíz:
Complete Traversals as General Iteration Patterns. Generic Programming 2002: 187-206 - [c27]Sibylle Schupp, Douglas P. Gregor, B. Osman, David R. Musser, Jeremy G. Siek, Lie-Quan Lee, Andrew Lumsdaine:
Concept-Based Component Libraries and Optimizing Compilers. IPDPS 2002 - 2001
- [c26]Sibylle Schupp, Douglas P. Gregor, David R. Musser, Shin-Ming Liu:
User-Extensible Simplification - Type-Based Optimizer Generators. CC 2001: 86-101 - [c25]Douglas P. Gregor, Sibylle Schupp, David R. Musser:
Base Class Injection. GCSE 2001: 106-117 - [c24]Sibylle Schupp, Douglas P. Gregor, David R. Musser:
Library Transformations. SCAM 2001: 111-123 - 2000
- [e1]Mehdi Jazayeri, Rüdiger Loos, David R. Musser:
Generic Programming, International Seminar on Generic Programming, Dagstuhl Castle, Germany, April 27 - May 1, 1998, Selected Papers. Lecture Notes in Computer Science 1766, Springer 2000, ISBN 3-540-41090-2 [contents]
1990 – 1999
- 1998
- [j17]Eric Gamess, David R. Musser, Arturo J. Sánchez-Ruíz:
Complete Traversals and their Implementation Using the Standard Template Library. CLEI Electron. J. 1(2) (1998) - [c23]David R. Musser, Sibylle Schupp, Rüdiger Loos:
Requirement Oriented Programming. Generic Programming 1998: 12-24 - [c22]David R. Musser, Arturo J. Sánchez-Ruíz:
Theory and Generality of Complete Traversals. Generic Programming 1998: 91-101 - 1997
- [j16]David R. Musser:
Introspective Sorting and Selection Algorithms. Softw. Pract. Exp. 27(8): 983-993 (1997) - [j15]Changqing Wang, David R. Musser:
Dynamic Verification of C++ Generic Algorithms. IEEE Trans. Software Eng. 23(5): 314-323 (1997) - 1996
- [b1]David R. Musser, Atul Saini:
STL tutorial and reference guide - C++ programming with the standard template library. Addison-Wesley professional computing series, Addison-Wesley 1996, ISBN 978-0-201-63398-6, pp. I-XXI, 1-400 - [c21]Úlfar Erlingsson, Erich L. Kaltofen, David R. Musser:
Generic Gram-Schmidt Orthogonalization by Exact Division. ISSAC 1996: 275-282 - 1994
- [j14]David R. Musser, Alexander A. Stepanov:
Algorithm-oriented Generic Libraries. Softw. Pract. Exp. 24(7): 623-642 (1994) - [j13]Deepak Kapur, Xumin Nie, David R. Musser:
An Overview of the Tecton Proof System. Theor. Comput. Sci. 133(2): 307-339 (1994) - 1992
- [c20]Deepak Kapur, David R. Musser, Xumin Nie:
The Tecton Proof System. Formal Methods in Databases and Software Engineering 1992: 54-79 - 1991
- [j12]Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman:
Semi-Unification. Theor. Comput. Sci. 81(2): 169-187 (1991) - [c19]Raj Agarwal, David R. Musser, Deepak Kapur, Xumin Nie:
The Tecton Proof System. RTA 1991: 442-444
1980 – 1989
- 1988
- [j11]Deepak Kapur, David R. Musser, Paliath Narendran:
Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure. J. Symb. Comput. 6(1): 19-36 (1988) - [c18]Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman:
Semi-Unification. FSTTCS 1988: 435-454 - [c17]David R. Musser, Alexander A. Stepanov:
Generic Programming. ISSAC 1988: 13-25 - 1987
- [j10]Deepak Kapur, David R. Musser:
Proof by Consistency. Artif. Intell. 31(2): 125-157 (1987) - [c16]David R. Musser, Alexander A. Stepanov:
A library of generic algorithms in Ada. SIGAda 1987: 216-225 - 1986
- [c15]Deepak Kapur, David R. Musser:
Inductive Reasoning with Incomplete Specifications (Preliminary Report). LICS 1986: 367-377 - 1985
- [j9]David R. Musser:
AIDS to hierarchical specification structuring and reusing theorems in AFFIRM-85. ACM SIGSOFT Softw. Eng. Notes 10(4): 2-4 (1985) - [c14]Deepak Kapur, Joseph L. Mundy, David R. Musser, Paliath Narendran:
Reasoning about three dimensional space. ICRA 1985: 405-410 - 1983
- [j8]John V. Guttag, Deepak Kapur, David R. Musser:
On Proving Uniform Termination and Restricted Termination of Rewriting Systems. SIAM J. Comput. 12(1): 189-214 (1983) - [j7]Erich L. Kaltofen, David R. Musser, B. David Saunders:
A Generalized Class of Polynomials that are Hard to Factor. SIAM J. Comput. 12(3): 473-483 (1983) - 1982
- [c13]David R. Musser, Deepak Kapur:
Rewrite Rule Theory and Abstract Data Type Analysis. EUROCAM 1982: 77-90 - [c12]John V. Guttag, Deepak Kapur, David R. Musser:
Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting Systems. ICALP 1982: 300-312 - 1981
- [c11]Deepak Kapur, David R. Musser, Alexander A. Stepanov:
Tecton: A Language for Manipulating Generic Objects. Program Specification 1981: 402-414 - [c10]Deepak Kapur, David R. Musser, Alexander A. Stepanov:
Operators and algebraic structures. FPCA 1981: 59-64 - [c9]Erich L. Kaltofen, David R. Musser, B. David Saunders:
A generalized class of polynomials that are hard to factor. SYMSACC 1981: 188-194 - 1980
- [j6]David R. Musser:
Abstract Data Type Specification in the AFFIRM System. IEEE Trans. Software Eng. 6(1): 24-32 (1980) - [c8]Roddy W. Erickson, David R. Musser:
The AFFIRM Theorem Prover: Proof Forests and Management of Large Proofs. CADE 1980: 220-231 - [c7]Susan L. Gerhart, David R. Musser, David H. Thompson, D. A. Baker, R. L. Bates, Roddy W. Erickson, Ralph L. London, D. G. Taylor, David S. Wile:
An Overview of AFFIRM: A Specification and Verification System. IFIP Congress 1980: 343-347 - [c6]David R. Musser:
On Proving Inductive Properties of Abstract Data Types. POPL 1980: 154-162
1970 – 1979
- 1978
- [j5]John V. Guttag, Ellis Horowitz, David R. Musser:
Abstract Data Types and Software Validation. Commun. ACM 21(12): 1048-1064 (1978) - [j4]David R. Musser:
On the Efficiency of a Polynomial Irreducibility Test. J. ACM 25(2): 271-282 (1978) - 1977
- [j3]George E. Collins, David R. Musser:
Analysis of the Pope-Stein Division Algorithm. Inf. Process. Lett. 6(5): 151-155 (1977) - [c5]John V. Guttag, Ellis Horowitz, David R. Musser:
Some Extensions to Algebraic Specifications. Language Design for Reliable Software 1977: 63-67 - 1976
- [c4]John D. Lipson, Ellis Horowitz, David R. Musser:
SIGSAM (Tutorial Session). ACM Annual Conference 1976: 435 - [c3]John V. Guttag, Ellis Horowitz, David R. Musser:
The Design of Data Type Specifications. ICSE 1976: 414-420 - 1975
- [j2]David R. Musser:
Multivariate Polynomial Factorization. J. ACM 22(2): 291-308 (1975) - 1974
- [j1]George E. Collins, David R. Musser, Michael Rothstein:
SAC-1 solution of problem #7. SIGSAM Bull. 8(2): 17-19 (1974) - [c2]Ralph L. London, David R. Musser:
The application of a symbolic mathematical system to program verification. ACM Annual Conference (1) 1974: 265-273 - 1973
- [c1]Raymond T. Yeh, Donald I. Good, David R. Musser:
New directions in teaching the fundamentals of computer science - discrete structures and computational analysis. SIGCSE 1973: 60-67
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
