Scott M. Pike

Department of Computer Science, Texas A&M University

Department of Computer Science, Texas A&M University
  • home »
  • publications »
  • View all publications
back

Links

  • Home
  • +  Research
    • Main research page
    • Research Project 1
    • Research Project 2
  • +  Teaching
    • Main teaching page
    • CPSC-668
    • CPSC-689
    • CPSC-410/611
  • +  Publications
    • All publications
    • Book Chapters
    • Conference Proceedings
    • Workshop Papers
  • Service
  • Resources
  • Personal
  • Current CV

Contact

  • pike[at]cse.tamu.edu
  • +1.979.776.2162 (tel)
  • +1.979.847.8578 (fax)
13

Publications

Publications listed by category and date of publication.

Please observe the copyright notices posted here governing the use of material from this page.

Click for papers indexed by

ACM, IEEE, DBLP, Springer, CiteSeer, and Google Scholar

Sort:

By Date: Newest publications first | Oldest publications first
By Category: Book Chapters | Conference Proceedings | Workshop Papers
By Publisher: ACM | ACTA | Cambridge | ETD | IEEE Xplore | None | Springer



Workshop Papers


  Encapsulating Concurrency as an Approach to Unification

  2004 [more]
ACMs Icon
  • Citation:
    Santosh Kumar, Bruce W. Weide, Paolo A.G. Sivilotti, Nigamanth Sridhar, Jason O. Hallstrom, and Scott M. Pike, "Encapsulating Concurrency as an Approach to Unification" in Proceedings of the Third Workshop on Specification and Verification of Component-Based Systems (SAVCBS), co-located with FSE 2004.
  • Abstract:
    We extend traditional techniques for sequential specifcation and verifcation to systems involving intrinsically concurrent activities. Our approach uses careful design of component specifcations to encapsulate inherent concurrency, and hence isolate clients from associated verifcation concerns. The approach has three parts: (i) relational specifcations to capture the interleaved effects of concurrent threads of execution, (ii) intermediate components to support a client's view of being the only active thread of computation, and (iii) a new specifcation clause to express requirements on a client's future behavior. We illustrate these ideas, and discuss their merits, in the context of a case study specifed using RESOLVE.
  • Publisher: ACM
  • Link to copy of this pubilcation on file with the publisher:

  • Download this publication:  
    KumarSAVCBS2004.ppt KumarSAVCBS2004.ppt
    Unification.pdf Unification.pdf
    Unification.ps Unification.ps




  Why Swapping?

  2002 [more]
Nones Icon
  • Citation:
    Bruce W. Weide, Scott M. Pike, and Wayne D. Heym, "Why Swapping?" in Proceedings of the RESOLVE Workshop 2002, pp. 72-79. Citations: [1] [2] [3] [4]
  • Abstract:
    An analysis of the pros and cons of all options available for the built-in data movement operator in imperative languages shows that the swap operator is the best choice, while the assignment operator is the worst.
  • Publisher: None
  • Link to copy of this pubilcation on file with the publisher:

  • Download this publication:  
    RESOLVE2002.pdf RESOLVE2002.pdf
    Weide2.html Weide2.html
    RESOLVE2002.bib RESOLVE2002.bib




  Iterators Reconsidered

  2002 [more]
Nones Icon
  • Citation:
    Jason O. Hallstrom, Scott M. Pike, and Nigamanth Sridhar, "Iterators Reconsidered" in Proceedings of the Fifth ICSE Workshop on Component-Based Software Engineering.
  • Abstract:
    Software developers are eager to increase the scale of their software products at a rate proportional to the growth of computing resources. With memory, bandwidth, and computing power doubling roughly every eighteen months, development approaches that are not based on compositional reasoning techniques can not be used to engineer the systems of tomorrow. The enormous scale of these projects far outstrips our ability to understand them using ad-hoc approaches. Industry best practice recognizes the importance of component reuse, but the emphasis is weighted heavily on the reuse of component code, often times neglecting the need to reuse the effort that went into understanding the component's behavior. That is, any scalable software engineering discipline must provide mechanisms for reusing software components, as well as mechanisms for reusing the reasoning effort required to use those components. This paper examines the Iterator pattern with regard to compositional reasoning. The approach, touted as industry best practice, is shown to provide ample opportunity for breaking the principles of encapsulation. These various hazards are briefly described, and several techniques for ensuring safe use of the pattern are explored.
  • Publisher: None
  • Link to copy of this pubilcation on file with the publisher:

  • Download this publication:  
    Iterators.pdf Iterators.pdf
    Iterators.ps Iterators.ps
    ICSE2002.bib ICSE2002.bib




  Binary Trees: A Challenge Problem for Separating Concerns

  2001 [more]
Nones Icon
  • Citation:
    Scott M. Pike, "Binary Trees: A Challenge Problem for Separating Concerns," in Proceedings of the ICSE 2001 Workshop on Advanced Separation of Concerns in Software Engineering, pp. 99-101.
  • Abstract:
    The explosive growth in hardware performance over the last 50 years has buttressed a belief in Moore’s Law that storage, bandwidth, and computing power will double approximately every 18 months. This unparalleled rate of progess in hardware technology has fueled an ever-growing industry of software applications. Unfortunately, the scale of current software has outpaced the development of tools and technologies for bringing software complexity within the tractable range of our limited human intellect. Research in separation of concerns has addressed this problem on many fronts, but it stands in need of challenge problems to motivate and evaluate new and existing approaches. This position paper outlines a formidable set of cross-cutting concerns pertaining to binary trees. The centrality of this data structure in diverse and conflicting application domains makes it an ideal challenge problem for current research.
  • Publisher: None
  • Link to copy of this pubilcation on file with the publisher:
    www.research.ibm.com/hyperspace/workshops/icse2001/papers-index.htm

  • Download this publication:  
    binarytree.pdf binarytree.pdf
    binarytree.ps binarytree.ps
    ICSE2001.bib ICSE2001.bib




Total Number of Publications: 13
publication admin

Last Modified: Mon Jul 21 11:14:57 CDT 2008
© Scott M. Pike (some rights reserved...)     My Erdös Number | Copyright | Site Map | Contact | About