Identification of Design Principles

This report identifies those design principles for a (possibly new) query and transformation language for the Web supporting inference that are considered essential. Based upon these design principles an initial strawman is selected. Scenarios for querying the Semantic Web illustrate the design principles and their reflection in the initial strawman, i.e., a first draft of the query language to be designed and implemented by the REWERSE working group I4

Arguing satisfaction of security requirements

This chapter presents a process for security requirements elicitation and analysis, based around the construction of a satisfaction argument for the security of a system. The process starts with the enumeration of security goals based on assets in the system, then uses these goals to derive security requirements in the form of constraints. Next, a satisfaction argument for the system is constructed, using a problem-centered representation, a formal proof to analyze properties that can be demonstrated, and structured informal argumentation of the assumptions exposed during construction of the argument. Constructing the satisfaction argument can expose missing and inconsistent assumptions about system context and behavior that effect security, and a completed argument provides assurances that a system can respect its security requirements

A framework for security requirements engineering

This paper presents a framework for security requirements elicitation and analysis, based upon the construction of a context for the system and satisfaction arguments for the security of the system. One starts with enumeration of security goals based on assets in the system. These goals are used to derive security requirements in the form of constraints. The system context is described using a problem-centered notation, then this context is validated against the security requirements through construction of a satisfaction argument. The satisfaction argument is in two parts: a formal argument that the system can meet its security requirements, and a structured informal argument supporting the assumptions expressed in the formal argument. The construction of the satisfaction argument may fail, revealing either that the security requirement cannot be satisfied in the context, or that the context does not contain sufficient information to develop the argument. In this case, designers and architects are asked to provide additional design information to resolve the problems

Boundary Terms, Variational Principles and Higher Derivative Modified Gravity

We discuss the criteria that must be satisfied by a well-posed variational principle. We clarify the role of Gibbons-Hawking-York type boundary terms in the actions of higher derivative models of gravity, such as F(R) gravity, and argue that the correct boundary terms are the naive ones obtained though the correspondence with scalar-tensor theory, despite the fact that variations of normal derivatives of the metric must be fixed on the boundary. We show in the case of F(R) gravity that these boundary terms reproduce the correct ADM energy in the hamiltonian formalism, and the correct entropy for black holes in the semi-classical approximation.Comment: 54 pages, 2 figures. Several typos corrected, references added. Version appearing in PR

New Constraints on Dispersive Form Factor Parameterizations from the Timelike Region

We generalize a recent model-independent form factor parameterization derived from rigorous dispersion relations to include constraints from data in the timelike region. These constraints dictate the convergence properties of the parameterization and appear as sum rules on the parameters. We further develop a new parameterization that takes into account finiteness and asymptotic conditions on the form factor, and use it to fit to the elastic \pi electromagnetic form factor. We find that the existing world sample of timelike data gives only loose bounds on the form factor in the spacelike region, but explain how the acquisition of additional timelike data or fits to other form factors are expected to give much better results. The same parameterization is seen to fit spacelike data extremely well.Comment: 24 pages, latex (revtex), 3 eps figure

Bounded Refinement Types

We present a notion of bounded quantification for refinement types and show how it expands the expressiveness of refinement typing by using it to develop typed combinators for: (1) relational algebra and safe database access, (2) Floyd-Hoare logic within a state transformer monad equipped with combinators for branching and looping, and (3) using the above to implement a refined IO monad that tracks capabilities and resource usage. This leap in expressiveness comes via a translation to "ghost" functions, which lets us retain the automated and decidable SMT based checking and inference that makes refinement typing effective in practice.Comment: 14 pages, International Conference on Functional Programming, ICFP 201

Generally Covariant Actions for Multiple D-branes

We develop a formalism that allows us to write actions for multiple D-branes with manifest general covariance. While the matrix coordinates of the D-branes have a complicated transformation law under coordinate transformations, we find that these may be promoted to (redundant) matrix fields on the transverse space with a simple covariant transformation law. Using these fields, we define a covariant distribution function (a matrix generalization of the delta function which describes the location of a single brane). The final actions take the form of an integral over the curved space of a scalar single-trace action built from the covariant matrix fields, tensors involving the metric, and the covariant distribution function. For diagonal matrices, the integral localizes to the positions of the individual branes, giving N copies of the single-brane action.Comment: 34 pages, LaTeX. v2: comments and refs adde