Librarian and Faculty Collaborative Instruction: A Phenomenological Self-Study

Several models of librarian and faculty collaboration are found in the professional librarian literature. The literature on collaborative self-study research in higher education settings indicates collaborative self-study research can improve interdisciplinary and collaborative approaches to teaching and research and facilitate the transfer of knowledge. A research librarian and assistant professor of special education conducted a phenomenological self-study to examine their multiple roles as researchers, collaborators, and educators who collaborated to develop, implement, and evaluate distance-delivered instructional services for public school teachers who live and work in remote, rural, and Native communities throughout the state of Alaska. Several themes emerged from this study, including: (a) the authors’ interdisciplinary and collaborative efforts resulted in increased opportunities to team teach and conduct future collaborative research; (b) the authors struggled to communicate effectively with students via audio-conference; and (c) the beliefs and practices of both authors were transformed by their participation in this self-study. The study suggests implications for further and improved interdisciplinary collaboration between librarians and faculty. The authors believe this collaborative approach to self-study research facilitates reflective and authentic teaching and research for academic librarians working in collaboration with teaching faculty.Ye

On Role Logic

We present role logic, a notation for describing properties of relational structures in shape analysis, databases, and knowledge bases. We construct role logic using the ideas of de Bruijn's notation for lambda calculus, an encoding of first-order logic in lambda calculus, and a simple rule for implicit arguments of unary and binary predicates. The unrestricted version of role logic has the expressive power of first-order logic with transitive closure. Using a syntactic restriction on role logic formulas, we identify a natural fragment RL^2 of role logic. We show that the RL^2 fragment has the same expressive power as two-variable logic with counting C^2 and is therefore decidable. We present a translation of an imperative language into the decidable fragment RL^2, which allows compositional verification of programs that manipulate relational structures. In addition, we show how RL^2 encodes boolean shape analysis constraints and an expressive description logic.Comment: 20 pages. Our later SAS 2004 result builds on this wor

Program Verification of Numerical Computation

These notes outline a formal method for program verification of numerical computation. It forms the basis of the software package VPC in its initial phase of development. Much of the style of presentation is in the form of notes that outline the definitions and rules upon which VPC is based. The initial motivation of this project was to address some practical issues of computation, especially of numerically intensive programs that are commonplace in computer models. The project evolved into a wider area for program construction as proofs leading to a model of inference in a more general sense. Some basic results of machine arithmetic are derived as a demonstration of VPC

Heterogeneity, Politics of Ethnicity, and Multiculturalism What is a Viable Framework for Indonesia?

Indonesia is a plural society that consists of several hundred ethnic and sub-ethnic groups. One of its generic characteristics is heterogeneity. In the last ten years after the implementation of regional autonomy, we have witnessed the emergence of strong ethnic and religiously flavoured local identity politics in various places in Indonesia that created open and vicious conflicts. This periodical violence exploded especially during the election of district and provincial heads. The intimate relation multiculturalism, with the actual political praxis of everyday life as an alternative to the existing paradigm of the “homogenization” of nationhood, has not been discussed. I believe it is time to discuss the strategic junctures between heterogeneity, politics of ethnicity (and religion) and multiculturalism as well as their possible realization at the local and national levels in order to find a viable framework for a future Indonesia

A static analysis for quantifying information flow in a simple imperative language

We propose an approach to quantify interference in a simple imperative language that includes a looping construct. In this paper we focus on a particular case of this definition of interference: leakage of information from private variables to public ones via a Trojan Horse attack. We quantify leakage in terms of Shannon's information theory and we motivate our definition by proving a result relating this definition of leakage and the classical notion of programming language interference. The major contribution of the paper is a quantitative static analysis based on this definition for such a language. The analysis uses some non-trivial information theory results like Fano's inequality and L1 inequalities to provide reasonable bounds for conditional statements. While-loops are handled by integrating a qualitative flow-sensitive dependency analysis into the quantitative analysis

Predicate Abstraction for Linked Data Structures

We present Alias Refinement Types (ART), a new approach to the verification of correctness properties of linked data structures. While there are many techniques for checking that a heap-manipulating program adheres to its specification, they often require that the programmer annotate the behavior of each procedure, for example, in the form of loop invariants and pre- and post-conditions. Predicate abstraction would be an attractive abstract domain for performing invariant inference, existing techniques are not able to reason about the heap with enough precision to verify functional properties of data structure manipulating programs. In this paper, we propose a technique that lifts predicate abstraction to the heap by factoring the analysis of data structures into two orthogonal components: (1) Alias Types, which reason about the physical shape of heap structures, and (2) Refinement Types, which use simple predicates from an SMT decidable theory to capture the logical or semantic properties of the structures. We prove ART sound by translating types into separation logic assertions, thus translating typing derivations in ART into separation logic proofs. We evaluate ART by implementing a tool that performs type inference for an imperative language, and empirically show, using a suite of data-structure benchmarks, that ART requires only 21% of the annotations needed by other state-of-the-art verification techniques