233,651 research outputs found
The Impact of Systematic Edits in History Slicing
While extracting a subset of a commit history, specifying the necessary
portion is a time-consuming task for developers. Several commit-based history
slicing techniques have been proposed to identify dependencies between commits
and to extract a related set of commits using a specific commit as a slicing
criterion. However, the resulting subset of commits become large if commits for
systematic edits whose changes do not depend on each other exist. We
empirically investigated the impact of systematic edits on history slicing. In
this study, commits in which systematic edits were detected are split between
each file so that unnecessary dependencies between commits are eliminated. In
several histories of open source systems, the size of history slices was
reduced by 13.3-57.2% on average after splitting the commits for systematic
edits.Comment: 5 pages, MSR 201
Quantum Fields in Nonstatic background: A Histories Perspective
For a quantum field living on a non - static spacetime no instantaneous
Hamiltonian is definable, for this generically necessitates a choice of
inequivalent representation of the canonical commutation relations at each
instant of time. This fact suggests a description in terms of time - dependent
Hilbert spaces, a concept that fits naturally in a (consistent) histories
framework. Our primary tool for the construction of the quantum theory in a
continuous -time histories format is the recently developed formalism based on
the notion of the history group . This we employ to study a model system
involving a 1+1 scalar field in a cavity with moving boundaries.
The instantaneous (smeared) Hamiltonian and a decoherence functional are then
rigorously defined so that finite values for the time - averaged particle
creation rate are obtainable through the study of energy histories. We also
construct the Schwinger - Keldysh closed- time - path generating functional as
a ``Fourier transform'' of the decoherence functional and evaluate the
corresponding n - point functions.Comment: 27 pages, LATEX; minor changes and corrections; version to appear in
JM
Theory and Practice of Transactional Method Caching
Nowadays, tiered architectures are widely accepted for constructing large
scale information systems. In this context application servers often form the
bottleneck for a system's efficiency. An application server exposes an object
oriented interface consisting of set of methods which are accessed by
potentially remote clients. The idea of method caching is to store results of
read-only method invocations with respect to the application server's interface
on the client side. If the client invokes the same method with the same
arguments again, the corresponding result can be taken from the cache without
contacting the server. It has been shown that this approach can considerably
improve a real world system's efficiency.
This paper extends the concept of method caching by addressing the case where
clients wrap related method invocations in ACID transactions. Demarcating
sequences of method calls in this way is supported by many important
application server standards. In this context the paper presents an
architecture, a theory and an efficient protocol for maintaining full
transactional consistency and in particular serializability when using a method
cache on the client side. In order to create a protocol for scheduling cached
method results, the paper extends a classical transaction formalism. Based on
this extension, a recovery protocol and an optimistic serializability protocol
are derived. The latter one differs from traditional transactional cache
protocols in many essential ways. An efficiency experiment validates the
approach: Using the cache a system's performance and scalability are
considerably improved
Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity
We present a lightweight approach to Hoare-style specifications for
fine-grained concurrency, based on a notion of time-stamped histories that
abstractly capture atomic changes in the program state. Our key observation is
that histories form a partial commutative monoid, a structure fundamental for
representation of concurrent resources. This insight provides us with a
unifying mechanism that allows us to treat histories just like heaps in
separation logic. For example, both are subject to the same assertion logic and
inference rules (e.g., the frame rule). Moreover, the notion of ownership
transfer, which usually applies to heaps, has an equivalent in histories. It
can be used to formally represent helping---an important design pattern for
concurrent algorithms whereby one thread can execute code on behalf of another.
Specifications in terms of histories naturally abstract granularity, in the
sense that sophisticated fine-grained algorithms can be given the same
specifications as their simplified coarse-grained counterparts, making them
equally convenient for client-side reasoning. We illustrate our approach on a
number of examples and validate all of them in Coq.Comment: 17 page
A Wikipedia Literature Review
This paper was originally designed as a literature review for a doctoral
dissertation focusing on Wikipedia. This exposition gives the structure of
Wikipedia and the latest trends in Wikipedia research
Agency and fictional truth: a formal study on fiction-making
Fictional truth, or truth in fiction/pretense, has been the object of extended scrutiny among philosophers and logicians in recent decades. Comparatively little attention, however, has been paid to its inferential relationships with time and with certain deliberate and contingent human activities, namely, the creation of fictional works. The aim of the paper is to contribute to filling the gap. Toward this goal, a formal framework is outlined that is consistent with a variety of conceptions of fictional truth and based upon a specific formal treatment of time and agency, that of so-called stit logics. Moreover, a complete axiomatic theory of fiction-making TFM is defined, where fiction-making is understood as the exercise of agency and choice in time over what is fictionally true. The language L of TFM is an extension of the language of propositional logic, with the addition of temporal and modal operators. A distinctive feature of L with respect to other modal languages is a variety of operators having to do with fictional truth, including a \u2018fictionality\u2019 operator M (to be read as \u201cit is a fictional truth that\u201d). Some applications of TFM are outlined, and some interesting linguistic and inferential phenomena, which are not so easily dealt with in other frameworks, are accounted for
- …