Deriving real-time action systems with multiple time bands using algebraic reasoning

The verify-while-develop paradigm allows one to incrementally develop programs from their specifications using a series of calculations against the remaining proof obligations. This paper presents a derivation method for real-time systems with realistic constraints on their behaviour. We develop a high-level interval-based logic that provides flexibility in an implementation, yet allows algebraic reasoning over multiple granularities and sampling multiple sensors with delay. The semantics of an action system is given in terms of interval predicates and algebraic operators to unify the logics for an action system and its properties, which in turn simplifies the calculations and derivations

Viewpoint consistency in Z and LOTOS: A case study

Specification by viewpoints is advocated as a suitable method of specifying complex systems. Each viewpoint describes the envisaged system from a particular perspective, using concepts and specification languages best suited for that perspective. Inherent in any viewpoint approach is the need to check or manage the consistency of viewpoints and to show that the different viewpoints do not impose contradictory requirements. In previous work we have described a range of techniques for consistency checking, refinement, and translation between viewpoint specifications, in particular for the languages LOTOS and Z. These two languages are advocated in a particular viewpoint model, viz. that of the Open Distributed Processing (ODP) reference model. In this paper we present a case study which demonstrates how all these techniques can be combined in order to show consistency between a viewpoint specified in LOTOS and one specified in Z. Keywords: Viewpoints; Consistency; Z; LOTOS; ODP

Quiescent consistency: Defining and verifying relaxed linearizability

Concurrent data structures like stacks, sets or queues need to be highly optimized to provide large degrees of parallelism with reduced contention. Linearizability, a key consistency condition for concurrent objects, sometimes limits the potential for optimization. Hence algorithm designers have started to build concurrent data structures that are not linearizable but only satisfy relaxed consistency requirements. In this paper, we study quiescent consistency as proposed by Shavit and Herlihy, which is one such relaxed condition. More precisely, we give the first formal definition of quiescent consistency, investigate its relationship with linearizability, and provide a proof technique for it based on (coupled) simulations. We demonstrate our proof technique by verifying quiescent consistency of a (non-linearizable) FIFO queue built using a diffraction tree. © 2014 Springer International Publishing Switzerland

Total Factor Productivity of Philippine Manufacturing Industries

As suggested by vast literature, the Philippine economy has performed poorly over the last three decades due to deterioration in productivity. This paper provides an updated productivity estimates for the manufacturing industries over the period 1956-1992. This paper decomposes this industry productivity growth into technical progress and technical efficiency. It also analyzes the patterns of industry productivity through results of regression method.total factor productivity, manufacturing sector, technical efficiency, output growth

Total Factor Productivity of Philippine Manufacturing Industries

As suggested by vast literature, the Philippine economy has performed poorly over the last three decades due to deterioration in productivity. This paper provides an updated productivity estimates for the manufacturing industries over the period 1956-1992. This paper decomposes this industry productivity growth into technical progress and technical efficiency. It also analyzes the patterns of industry productivity through results of regression method.total factor productivity, manufacturing sector, technical efficiency, output growth

Diffractive Phenomena and Shadowing in Deep-Inelastic Scattering

Shadowing effects in deep-inelastic lepton-nucleus scattering probe the mass spectrum of diffractive leptoproduction from individual nucleons. We explore this relationship using current experimental information on both processes. In recent data from the NMC and E665 collaboration, taken at small x << 0.1 and Q^2 < 1 GeV^2, shadowing is dominated by the diffractive excitation and coherent interaction of low mass vector mesons. If shadowing is explored at small x > 1 GeV^2 as discussed at HERA, the situation is different. Here dominant contributions come from the coherent interaction of diffractively produced heavy mass states. Furthermore we observe that the energy dependence of shadowing is directly related to the mass dependence of the diffractive production cross section for free nucleon targets.Comment: 12 pages Latex, 8 figure

Defining correctness conditions for concurrent objects in multicore architectures

Correctness of concurrent objects is defined in terms of conditions that determine allowable relationships between histories of a concurrent object and those of the corresponding sequential object. Numerous correctness conditions have been proposed over the years, and more have been proposed recently as the algorithms implementing concurrent objects have been adapted to cope with multicore processors with relaxed memory architectures. We present a formal framework for defining correctness conditions for multicore architectures, covering both standard conditions for totally ordered memory and newer conditions for relaxed memory, which allows them to be expressed in uniform manner, simplifying comparison. Our framework distinguishes between order and commitment properties, which in turn enables a hierarchy of correctness conditions to be established. We consider the Total Store Order (TSO) memory model in detail, formalise known conditions for TSO using our framework, and develop sequentially consistent variations of these. We present a work-stealing deque for TSO memory that is not linearizable, but is correct with respect to these new conditions. Using our framework, we identify a new non-blocking compositional condition, fence consistency, which lies between known conditions for TSO, and aims to capture the intention of a programmer-specified fence

Financial management in a joint field environment

MBA Professional ReportThis MBA professional report highlights the FM challenges that comptroller's encounter in the joint field environment, identifies sources of payment inefficiencies and recommends solutions to reduce those inefficiencies, thus addressing the issue of improving foreign contract payments by comptrollers in the field. Problem disbursements during Operation Desert Storm yielded $54 million dollars in mismanaged funds for the U.S. Army alone. With the continued emphasis on joint operations, the comptroller must effectively manage funds obligated to various Department of Defense (DoD) activities. The research involved in this endeavor includes doctrine and policy review, interviews with various DoD comptrollers and a case study of exercise Cobra Gold 2002 budget execution and contractual payments at the joint organization level. Cobra Gold is an excellent example of a large-scale joint and combined operation in a foreign country; it provides a great opportunity to analyze the research question. This professional report concludes that field comptrollers cannot adequately meet fiscal responsibilities without comparable garrison IT connectivity and recommends that all of the U.S. services procure systems that are fully interoperable to best support the warfighter. This report is primarily intended for field comptrollers with limited joint field experience to make them aware of the uniqueness that exists in joint operations.http://archive.org/details/financialmanagem109459910Captain, United States Marine CorpsLieutenant, United States NavyApproved for public release; distribution is unlimited

Weak refinement in Z

An important aspect in the specification of distributed systems is the role of the internal (or unobservable) operation. Such operations are not part of the user interface (i.e. the user cannot invoke them), however, they are essential to our understanding and correct modelling of the system. Various conventions have been employed to model internal operations when specifying distributed systems in Z. If internal operations are distinguished in the specification notation, then refinement needs to deal with internal operations in appropriate ways. However, in the presence of internal operations, standard Z refinement leads to undesirable implementations. In this paper we present a generalization of Z refinement, called weak refinement, which treats internal operations differently from observable operations when refining a system. We illustrate some of the properties of weak refinement through a specification of a telecommunications protocol

New Global Defect Structures

We investigate the presence of defects in systems described by real scalar field in (D,1) spacetime dimensions. We show that when the potential assumes specific form, there are models which support stable global defects for D arbitrary. We also show how to find first-order differential equations that solve the equations of motion, and how to solve models in D dimensions via soluble problems in D=1. We illustrate the procedure examining specific models and finding explicit solutions.Comment: RevTex4, 4 pages, 3 eps figures; to be published in Phys. Rev. Let