Maude: specification and programming in rewriting logic

Maude is a high-level language and a high-performance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational specification and programming in its sublanguage of functional modules and theories. The underlying equational logic chosen for Maude is membership equational logic, that has sorts, subsorts, operator overloading, and partiality definable by membership and equality conditions. Rewriting logic is reflective, in the sense of being able to express its own metalevel at the object level. Reflection is systematically exploited in Maude endowing the language with powerful metaprogramming capabilities, including both user-definable module operations and declarative strategies to guide the deduction process. This paper explains and illustrates with examples the main concepts of Maude's language design, including its underlying logic, functional, system and object-oriented modules, as well as parameterized modules, theories, and views. We also explain how Maude supports reflection, metaprogramming and internal strategies. The paper outlines the principles underlying the Maude system implementation, including its semicompilation techniques. We conclude with some remarks about applications, work on a formal environment for Maude, and a mobile language extension of Maude

State space c-reductions for concurrent systems in rewriting logic

We present c-reductions, a state space reduction technique. The rough idea is to exploit some equivalence relation on states (possibly capturing system regularities) that preserves behavioral properties, and explore the induced quotient system. This is done by means of a canonizer function, which maps each state into a (non necessarily unique) canonical representative of its equivalence class. The approach exploits the expressiveness of rewriting logic and its realization in Maude to enjoy several advantages over similar approaches: exibility and simplicity in the definition of the reductions (supporting not only traditional symmetry reductions, but also name reuse and name abstraction); reasoning support for checking and proving correctness of the reductions; and automatization of the reduction infrastructure via Maude's meta-programming features. The approach has been validated over a set of representative case studies, exhibiting comparable results with respect to other tools

TYC 2675-663-1: A newly discovered W UMa system in an active state

The recently discovered eclipsing binary system TYC 2675-663-1 is a X-ray source, and shows properties in the optical that are similar to the W UMa systems, but are somewhat unusual compared to what is seen in other contact binary systems. The goal of this work is to characterize its properties and investigate its nature by means of detailed photometric and spectroscopic observations. We have performed extensive V-band photometric measurements with the INTEGRAL satellite along with ground-based multi-band photometric observations, as well as high-resolution spectroscopic monitoring from which we have measured the radial velocities of the components. These data have been analysed to determine the stellar properties, including the absolute masses and radii. Additional low-resolution spectroscopy was obtained to investigate spectral features. From the measured eclipse timings we determine an orbital period for the binary of P=0.4223576+-0.0000009 days. The light-curve and spectroscopic analyses reveal the observations to be well represented by a model of an overcontact system composed of main-sequence F5 and G7 stars (temperature difference of nearly 1000 K), with the possible presence of a third star. Low-resolution optical spectroscopy reveals a complex H alpha emission, and other features that are not yet understood. The unusually large mass ratio of q=0.81+-0.05 places it in the rare "H" (high mass ratio) subclass of the W UMa systems, which are presumably on their way to coalescence.Comment: 12 pages in double column format. Accepted for publication in Astronomy and Astrophysic

Optimization of double pulse pumping for Ni-like Sm x-ray lasers

We report a systematic study of double pulse pumping of the Ni-like Sm x-ray laser at 73 Angstrom, currently the shortest wavelength saturated x-ray laser. It is found that the Sm x-ray laser output can change by orders of magnitude when the intensity ratio of the pumping pulses and their relative delay are varied. Optimum pumping conditions are found and interpreted in terms of a simple model. (C) 1999 American Institute of Physics. [S0021-8979(99)07102-9]

Quantifying the optical properties and chromophore concentrations of turbid media by chemometric analysis of hyperspectral diffuse reflectance data collected using a fourier interferometric imaging system

A non-contact Fourier transform interferometric imaging system was used to collect hyperspectral images of the steady-state diffuse reflectance from a point source in turbid media for the spectral range of 550-850 nm. Steady-state diffuse reflectance profiles were generated from the hyperspectral images, and partial least-squares (PLS) regression was performed on the diffuse reflectance profiles to quantify absorption (mu (alpha)) and reduced scattering (mu (s)') properties of turbid media. The feasibility of using PLS regression to predict optical properties was examined for two different sets of spatially-resolved diffuse reflectance data. One set of data was collected from 40 turbid phantoms, while the second set was generated by convolving Monte Carlo simulations with the instrument response of the imaging system. Study results show that PLS prediction of mu (alpha) and mu (s)' was accurate to within +/-8% and +/-5%, respectively, when the model was trained on turbid phantom data. Moreover, PLS prediction of optical properties was considerably faster and more efficient than direct least-squares fitting of spatially-resolved profiles. When the PLS model was trained on Monte Carlo simulated data and subsequently used to predict mu (alpha) and mu (s)' from the diffuse reflectance of turbid phantom, the percent accuracies degraded to +/-12% and +/-5%, respectively. These accuracy values are applicable to homogenous, semi-infinite turbid phantoms with optical property ranges comparable to tissues

Automated Certification of Authorisation Policy Resistance

Attribute-based Access Control (ABAC) extends traditional Access Control by considering an access request as a set of pairs attribute name-value, making it particularly useful in the context of open and distributed systems, where security relevant information can be collected from different sources. However, ABAC enables attribute hiding attacks, allowing an attacker to gain some access by withholding information. In this paper, we first introduce the notion of policy resistance to attribute hiding attacks. We then propose the tool ATRAP (Automatic Term Rewriting for Authorisation Policies), based on the recent formal ABAC language PTaCL, which first automatically searches for resistance counter-examples using Maude, and then automatically searches for an Isabelle proof of resistance. We illustrate our approach with two simple examples of policies and propose an evaluation of ATRAP performances.Comment: 20 pages, 4 figures, version including proofs of the paper that will be presented at ESORICS 201

Maude: specification and programming in rewriting logic

AbstractMaude is a high-level language and a high-performance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational specification and programming in its sublanguage of functional modules and theories. The underlying equational logic chosen for Maude is membership equational logic, that has sorts, subsorts, operator overloading, and partiality definable by membership and equality conditions. Rewriting logic is reflective, in the sense of being able to express its own metalevel at the object level. Reflection is systematically exploited in Maude endowing the language with powerful metaprogramming capabilities, including both user-definable module operations and declarative strategies to guide the deduction process. This paper explains and illustrates with examples the main concepts of Maude's language design, including its underlying logic, functional, system and object-oriented modules, as well as parameterized modules, theories, and views. We also explain how Maude supports reflection, metaprogramming and internal strategies. The paper outlines the principles underlying the Maude system implementation, including its semicompilation techniques. We conclude with some remarks about applications, work on a formal environment for Maude, and a mobile language extension of Maude