Computer Software
Print ISSN : 0289-6540
Search
Advanced search
OR
Browse
Search
Volume 21, Issue 6
Displaying 1-9 of 9 articles from this issue
Show all abstracts
    • |<
    • <
    • 1
    • >
    • >|
  • [title in Japanese]
    Takashi CHIKAYAMA
    2004 Volume 21 Issue 6 Pages 423-424
    Published: November 25, 2004
    Released on J-STAGE: November 30, 2008
    DOIhttps://doi.org/10.11309/jssst.21.423
    JOURNAL FREE ACCESS
    Download PDF (17K)
  • [title in Japanese]
    Kazunori UEDA
    2004 Volume 21 Issue 6 Pages 425-426
    Published: November 25, 2004
    Released on J-STAGE: November 30, 2008
    DOIhttps://doi.org/10.11309/jssst.21.425
    JOURNAL FREE ACCESS
    Download PDF (19K)
  • Implementation Techniques for Faster Reflective Computing
    Shigeru CHIBA, Michiaki TATSUBORI, Yoshiki SATO, Kiyoshi NAKAGAWA
    2004 Volume 21 Issue 6 Pages 427-437
    Published: November 25, 2004
    Released on J-STAGE: November 30, 2008
    DOIhttps://doi.org/10.11309/jssst.21.427
    JOURNAL FREE ACCESS
    Show abstractHide abstract
    Reflection had been regarded as an idea that was inapplicable for practical software development. This paper presents techniques that we have developed for better implementation of reflective computing. Our techniques move the bottleneck of reflective computing from runtime to load/compile time so that reflection could be pragmatic in C++/Java programming, in which execution performance is significant. This paper also mentions our perspective on this research area, in particular, with respect to the relation between reflection and aspect-oriented programming.
    View full abstract
    Download PDF (116K)
  • A Type System and Compilation Techniques for Concurrent Objects
    Masahiro YASUGI
    2004 Volume 21 Issue 6 Pages 438-455
    Published: November 25, 2004
    Released on J-STAGE: November 30, 2008
    DOIhttps://doi.org/10.11309/jssst.21.438
    JOURNAL FREE ACCESS
    Show abstractHide abstract
    Autonomous concurrent objects can be regarded as message receivers rather than labeled records by message senders, each having object references. The subtype relation on reference types can be determined by judging how various messages can be understood. Based on this idea, this paper presents a type system and compilation techniques for concurrent objects, implementing efficient pattern matching of first class messages, where the look-up can be performed as direct indexing of a small table, and the table size can be bounded by a number slightly more than the number of injection tags which the message value may have.
    View full abstract
    Download PDF (262K)
  • A Practical Pointer Analysis for C Language
    Tatsurou SEKIGUCHI
    2004 Volume 21 Issue 6 Pages 456-471
    Published: November 25, 2004
    Released on J-STAGE: November 30, 2008
    DOIhttps://doi.org/10.11309/jssst.21.456
    JOURNAL FREE ACCESS
    Show abstractHide abstract
    This paper aims at describing an algorithm of pointer analysis for practical large-scale application programs written in C language. We formulate the algorithm of pointer analysis in the framework of abstract interpretation. The analysis is carried out by executing an abstract program. To our knowledge, the precision of our abstract memory region is the most accurate among polynomial-time pointer analysis algorithms. We have applied a dynamic checking removal optimization based on our pointer analysis to Fail-Safe C compiler in order to demonstrate effectiveness of our pointer analysis. The experiment targeting SPECCPU 2000 has shown that twenty to seventy percent of dynamic checking can be removed and ten to forty percent of elapsed time is improved.
    View full abstract
    Download PDF (182K)
  • XML and Schema Languages
    Makoto MURATA, Kohsuke KAWAGUCHI
    2004 Volume 21 Issue 6 Pages 472-481
    Published: November 25, 2004
    Released on J-STAGE: November 30, 2008
    DOIhttps://doi.org/10.11309/jssst.21.472
    JOURNAL FREE ACCESS
    Show abstractHide abstract
    This paper describes XML and schema languages using formal language theory. It also overviews schemabased XML technologies, notably validation and static type checking.
    View full abstract
    Download PDF (129K)
  • Operating System Technologies for Preventing Unauthorized Access
    Takahiro SHINAGAWA
    2004 Volume 21 Issue 6 Pages 482-493
    Published: November 25, 2004
    Released on J-STAGE: November 30, 2008
    DOIhttps://doi.org/10.11309/jssst.21.482
    JOURNAL FREE ACCESS
    Show abstractHide abstract
    This tutorial paper reviews some major operating system technologies for preventing unauthorized access. To classify and evaluate these technologies, a security taxonomy is introduced. The taxonomy is designed to describe the type of unauthorized access and measure the impact of the unauthorized access. Based on the taxonomy, this paper tries to determine the effectiveness of the operating system technologies for preventing unauthorized access.
    View full abstract
    Download PDF (122K)
  • Report on FLOPS 2004
    Susumu NISHIMURA
    2004 Volume 21 Issue 6 Pages 494-498
    Published: November 25, 2004
    Released on J-STAGE: November 30, 2008
    DOIhttps://doi.org/10.11309/jssst.21.494
    JOURNAL FREE ACCESS
    Download PDF (131K)
  • SPA 2004 Report
    Michiaki TATSUBORI, Hirotake ABE, Ryohtaro KAWAKAMI, Masato SAITO, Eij ...
    2004 Volume 21 Issue 6 Pages 499-504
    Published: November 25, 2004
    Released on J-STAGE: November 30, 2008
    DOIhttps://doi.org/10.11309/jssst.21.499
    JOURNAL FREE ACCESS
    Download PDF (97K)
    • |<
    • <
    • 1
    • >
    • >|
feedback
 Top