1,720,983 research outputs found
SCV: Structure and Constant Value Based Binary Diffing
No full text∗This research was partially supported by the MIC(Ministry of Information
and Communication), Korea, under the ITRC(Information
Technology Research Center) Support program supervised by the
IITA(Institute of Information Technology Advancement) (IITA-2008-
C1090-0801-0020), and partially supported by Brain Korea 21 Project, the
School of Information Technology, KAIST in 2008
A static bug detector for uninitialized field references in Java programs
No full textCorrectness of Java programs is important because they are executed in distributed computing environments. The object initialization scheme in the Java programming language is complicated, and this complexity may lead to undesirable semantic bugs. Various tools have been developed for detecting program patterns that might cause errors during program execution. However, current tools cannot identify code patterns in which an uninitialized field is accessed when an object is initialized. We refer to such erroneous patterns as uninitialized field references. In this paper, we propose a static pattern detection algorithm for identifying uninitialized field references. We design a sound analysis for this problem and implement an analyzer using the Soot framework. In addition, we apply our algorithm to some real Java applications. From the experiments, we identify 12 suspicious field references in the applications, and among those we find two suspected errors by manual inspection.This research was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA. (Institute of Information Technology Assessment) (IITA-2005-C1090-0502-0031
Goal−directed Weakening of Abstract Interpretation Results
No full textOne proposal for automatic construction of proofs about programs is to combine Hoare logic and abstract interpretation. Constructing proofs is in Hoare logic. Discovering programs' invariants is done by abstract interpreters. One problem of this approach is that abstract interpreters often compute invariants that are not needed for the proof goal. The reason is that the abstract interpreter does not know what the proof goal is, so it simply tries to find as strong invariants as possible. These unnecessary invariants increase the size of the constructed proofs. Unless the proof-construction phase is notified which invariants are not needed, it blindly proves all the computed invariants. In this article, we present a framework for designing algorithms, called abstract-value slicers, that slice out unnecessary invariants from the results of forward abstract interpretation. The framework provides a generic abstract-value slicer that can be instantiated into a slicer for a particular abstract interpretation. Such an instantiated abstract-value slicer works as a postprocessor to an abstract interpretation in the whole proof-construction process, and notifies to the next proof-construction phase which invariants it does not have to prove. Using the framework, we designed an abstract-value slicer for an existing relational analysis and applied it on programs. In this experiment, the slicer identified 62%-81% of the computed invariants as unnecessary, and resulted in 52%-84% reduction in the size of constructed proofs.S. Seo and T. Han were supported by Korea Ministry of Information and Communication under the Information Technology Research Center support program, supervised by the Institute of Information Technology Assessment (IITA-2005-C1090-0502-0031). H. Yang was supported by EPSRC and the Basic Research Program of the Korea-Science & Engineering Foundation (grant No. R08-2003-000-10370-0). K. Yi was supported by Brain Korea 21 Project of Korea Ministry of Education and Human Resources, by IT Leading R&D Support Project of Korea Ministry of Information and Communication, by Korea Research Foundation grant KRF-2003-041-D00528, and by National Security Research Institute of Korea.
Refining schizophrenia via graph reachability in esterel
No full textThis research was supported by the MKE(Ministry of
Knowledge Economy), Korea, under the ITRC(Information
Technology Research Center) Support program supervised
by the IITA(Institute of Information Technology Advancement)
(IITA-2009-C1090-0902-0020) and the Engineering
Research Center of Excellence Program of Korea Ministry of
Education, Science and Technology(MEST) / Korea Science
and Engineering Foundation(KOSEF), grant number R11-
2008-007-02004-0
Compact modeling of extremely scaled graphene FETs
No full textIn this work, compact current modeling of field-effect transistors (FETs) with transferred graphene channel grown by using chemical vapor deposition is presented. A highly-doped silicon substrate is used as a back gate, channels are defined by using electron-beam lithography, and the channel length of the transistor is scaled down to 20 nm. The DC characteristics of the scaled graphene transistors are observed by considering the source/drain series resistances. In compact modeling of graphene FETs, an electron-hole puddle existing near the charge-neutral region (Dirac point) is considered at a low carrier density while the velocity saturation effect due to surface polar phonon scattering is included at a high carrier density.
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
- …
