Inspecting rewriting logic computations (in a parametric and stepwise way)

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-54624-2_12Trace inspection is concerned with techniques that allow the trace content to be searched for specific components. This paper presents a rich and highly dynamic, parameterized technique for the trace inspection of Rewriting Logic theories that allows the non-deterministic execution of a given unconditional rewrite theory to be followed up in different ways. Using this technique, an analyst can browse, slice, filter, or search the traces as they come to life during the program execution. Starting from a selected state in the computation tree, the navigation of the trace is driven by a user-defined, inspection criterion that specifies the required exploration mode. By selecting different inspection criteria, one can automatically derive a family of practical algorithms such as program steppers and more sophisticated dynamic trace slicers that facilitate the dynamic detection of control and data dependencies across the computation tree. Our methodology, which is implemented in the Anima graphical tool, allows users to capture the impact of a given criterion thereby facilitating the detection of improper program behaviors.This work has been partially supported by the EU (FEDER), the Spanish MEC project ref. TIN2010-21062-C02-02, the Spanish MICINN complementary action ref. TIN2009-07495-E, and by Generalitat Valenciana ref. PROMETEO2011/052. This work was carried out during the tenure of D. Ballis’ ERCIM “Alain Bensoussan ”Postdoctoral Fellowship. The research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement n. 246016. F. Frechina was supported by FPU-ME grant AP2010-5681.Alpuente Frasnedo, M.; Ballis, D.; Frechina, F.; Sapiña Sanchis, J. (2014). Inspecting rewriting logic computations (in a parametric and stepwise way). En Specification, algebra, and software: essays dedicated to Kokichi Futatsugi. Springer Verlag (Germany). 229-255. https://doi.org/10.1007/978-3-642-54624-2_12S229255Alpuente, M., Ballis, D., Baggi, M., Falaschi, M.: A Fold/Unfold Transformation Framework for Rewrite Theories extended to CCT. In: Proc. PEPM 2010, pp. 43–52. ACM (2010)Alpuente, M., Ballis, D., Espert, J., Romero, D.: Model-checking Web Applications with Web-TLR. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol. 6252, pp. 341–346. Springer, Heidelberg (2010)Alpuente, M., Ballis, D., Espert, J., Romero, D.: Backward Trace Slicing for Rewriting Logic Theories. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS, vol. 6803, pp. 34–48. Springer, Heidelberg (2011)Alpuente, M., Ballis, D., Frechina, F., Sapiña, J.: Slicing-Based Trace Analysis of Rewriting Logic Specifications with iJulienne. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 121–124. Springer, Heidelberg (2013)Alpuente, M., Ballis, D., Frechina, F., Romero, D.: Using Conditional Trace Slicing for improving Maude programs. Science of Computer Programming (2013) (to appear)Alpuente, M., Ballis, D., Romero, D.: A Rewriting Logic Approach to the Formal Specification and Verification of Web applications. Science of Computer Programming (2013) (to appear)Baggi, M., Ballis, D., Falaschi, M.: Quantitative Pathway Logic for Computational Biology. In: Degano, P., Gorrieri, R. (eds.) CMSB 2009. LNCS, vol. 5688, pp. 68–82. Springer, Heidelberg (2009)Bruni, R., Meseguer, J.: Semantic Foundations for Generalized Rewrite Theories. Theoretical Computer Science 360(1-3), 386–414 (2006)Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: Maude Manual (Version 2.6). Technical report, SRI Int’l Computer Science Laboratory (2011), http://maude.cs.uiuc.edu/maude2-manual/Clements, J., Flatt, M., Felleisen, M.: Modeling an Algebraic Stepper. In: Sands, D. (ed.) ESOP 2001. LNCS, vol. 2028, pp. 320–334. Springer, Heidelberg (2001)Durán, F., Meseguer, J.: A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories. In: Ölveczky, P.C. (ed.) WRLA 2010. LNCS, vol. 6381, pp. 86–103. Springer, Heidelberg (2010)Eker, S.: Associative-Commutative Matching via Bipartite Graph Matching. The Computer Journal 38(5), 381–399 (1995)Eker, S.: Associative-Commutative Rewriting on Large Terms. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 14–29. Springer, Heidelberg (2003)Klop, J.W.: Term Rewriting Systems. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, vol. I, pp. 1–112. Oxford University Press (1992)Martí-Oliet, N., Meseguer, J.: Rewriting Logic: Roadmap and Bibliography. Theoretical Computer Science 285(2), 121–154 (2002)Meseguer, J.: Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science 96(1), 73–155 (1992)Meseguer, J.: The Temporal Logic of Rewriting: A Gentle Introduction. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Montanari Festschrift. LNCS, vol. 5065, pp. 354–382. Springer, Heidelberg (2008)Plotkin, G.D.: The Origins of Structural Operational Semantics. The Journal of Logic and Algebraic Programming 60-61(1), 3–15 (2004)Riesco, A., Verdejo, A., Caballero, R., Martí-Oliet, N.: Declarative Debugging of Rewriting Logic Specifications. In: Corradini, A., Montanari, U. (eds.) WADT 2008. LNCS, vol. 5486, pp. 308–325. Springer, Heidelberg (2009)Riesco, A., Verdejo, A., Martí-Oliet, N.: Declarative Debugging of Missing Answers for Maude. In: Proc. RTA 2010. LIPIcs, vol. 6, pp. 277–294 (2010)TeReSe. Term Rewriting Systems. Cambridge University Press (2003

Debugging Maude programs via runtime assertion checking and trace slicing

[EN] This is the author’s version of a work that was accepted for publication in . Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Journal of Logical and Algebraic Methods in Programming, [VOL 85, ISSUE 5, (2016)] DOI 10.1016/j.jlamp.2016.03.001.In this paper we propose a dynamic analysis methodology for improving the diagnosis of erroneous Maude programs. The key idea is to combine runtime checking and dynamic trace slicing for automatically catching errors at runtime while reducing the size and complexity of the erroneous traces to be analyzed (i.e., those leading to states failing to satisfy some of the assertions). First, we formalize a technique that is aimed at automatically detecting deviations of the program behavior (symptoms) with respect to two types of user-defined assertions: functional assertions and system assertions. The proposed dynamic checking is provably sound in the sense that all errors flagged are definitely violations of the specifications. Then, upon eventual assertion violations we generate accurate trace slices that help identify the cause of the error. Our methodology is based on (i) a logical notation for specifying assertions that are imposed on execution runs; (ii) a runtime checking technique that dynamically tests the assertions; and (iii) a mechanism based on (equational) least general generalization that automatically derives accurate criteria for slicing from falsified assertions. Finally, we report on an implementation of the proposed technique in the assertion-based, dynamic analyzer ABETS and show how the forward and backward tracking of asserted program properties leads to a thorough trace analysis algorithm that can be used for program diagnosis and debugging. © 2016 Elsevier Inc. All rights reserved.This work has been partially supported by the EU (FEDER) and the Spanish MINECO under grants TIN2015-69175-C4-1-R and TIN2013-45732-C4-1-P, and by Generalitat Valenciana Ref. PROMETEOII/2015/013. F. Frechina was supported by FPU-ME grant AP2010-5681, and J. Sapiña was supported by FPI-UPV grant SP2013-0083 and mobility grant VIIT-3946.Alpuente Frasnedo, M.; Ballis, D.; Frechina, F.; Sapiña-Sanchis, J. (2016). Debugging Maude programs via runtime assertion checking and trace slicing. Journal of Logical and Algebraic Methods in Programming. 85(5):707-736. https://doi.org/10.1016/j.jlamp.2016.03.001S70773685

Compressibility and structural stability of ultra-incompressible bimetallic interstitial carbides and nitrides

We have investigated by means of high-pressure x-ray diffraction the structural stability of Pd2Mo3N, Ni2Mo3C0.52N0.48, Co3Mo3C0.62N0.38, and Fe3Mo3C. We have found that they remain stable in their ambient-pressure cubic phase at least up to 48 GPa. All of them have a bulk modulus larger than 330 GPa, being the least compressible material Fe3Mo3C, B0 = 374(3) GPa. In addition, apparently a reduction of compressibility is detected as the carbon content increased. The equation of state for each material is determined. A comparison with other refractory materials indicates that interstitial nitrides and carbides behave as ultra-incompressible materials.Comment: 14 pages, 3 figures, 1 tabl

Assertion-based Analysis via Slicing with ABETS

[EN] We present ABETS, an assertion-based, dynamic analyzer that helps diagnose errors in Maude programs. ABETS uses slicing to automatically create reduced versions of both a run's execution trace and executed program, reduced versions in which any information that is not relevant to the bug currently being diagnosed is removed. In addition, ABETS employs runtime assertion checking to automate the identification of bugs so that whenever an assertion is violated, the system automatically infers accurate slicing criteria from the failure. We summarize the main services provided by ABETS, which also include a novel assertionbased facility for program repair that generates suitable program fixes when a state invariant is violated. Finally, we provide an experimental evaluation that shows the performance and effectiveness of the system.This work has been partially supported by the EU (FEDER) and Spanish MINECO grant TIN2015-69175-C4-1-R, and by Generalitat Valenciana PROMETEOII/2015/013. J. Sapina was supported by FPI-UPV grant SP2013-0083.Alpuente Frasnedo, M.; Frechina, F.; Sapiña Sanchis, J.; Ballis, D. (2016). Assertion-based Analysis via Slicing with ABETS. Theory and Practice of Logic Programming. 16(5):515-532. https://doi.org/10.1017/S1471068416000375S51553216

Crystal structure and magnetism of Co(HPO3)⋅H2O: A novel layered compound of Co(II)

Under the terms of the Creative Commons Attribution (CC BY) license to their work.-- et al.The crystal structure and magnetic properties of Co(HPO3)⋅H2O have been determined. The solid crystallizes in space group P c a21, a=8.984(2) Å, b=7.918(2) Å, c=10.139(8) Å, V=721.2 Å3. Z=4 d calc =2.89 g/cm3. The structure consists of layers only connected by hydrogen bonds. These layers can be viewed as formed by zigzag chains of edge‐sharing Co(II)O6 octahedra interconnected by a three atom bridge (O‐P‐O) and a single oxygen bridge. ac magnetic susceptibility measurements show a sharp peak at T c =(10.8±0.1) K, and are consistent with a transition from one‐ to two‐dimensional magnetic order, in agreement with the structure. An analysis of the χT/C vs ε=(1−T c /T) data in the critical region, for T>T c , using a double‐logarithmic plot, yields a critical exponent γ=1.75 for 0.01<ε<0.1, which correspond to a two‐dimensional Ising model.The financial support of the Spanish Commission Interministerial de Cienda yTecnologia (C.I.C.Y.T. No. BP086-0187) is acknowledged. M. D. M., P. A. and F. S. thank the Spanish Ministerio de Educacion y Ciencia for predoctoral fellowships and P. G. R. for a postdoctoral fellowship.Peer Reviewe

The ferrimagnetic compounds CoM[M'(EDTA)]2.4H2O (M,M'=Co,Ni): Magnetic characterization of CoCo[Ni(EDTA)]2.4H2O

Under the terms of the Creative Commons Attribution (CC BY) license to their work.We report on the magnetic properties of the ordered bimetallic compound CoCo(NiEDTA)2⋅4H2O (abbreviated as [CoCoNi]). The structure consists of ordered bimetallic layers formed by alternating octahedral sites of Co and Ni(II); tetrahedral Co sites connect different Co‐Ni layers. We discuss the low‐dimensional ferrimagnetic behavior of this compound in terms of a model that assumes three spin sublattices exchange coupled by an Ising interaction.This work was supported by the Comision Interministerial en Ciencia y Tecnologia (Grant No. PB 85-OI06-C02-02), the Iustitucio Valenciana d'Estudis i Investigació, and the National Science Foundation (Grant No. DMR-8515224). F. S. andP. G. R. thank the Spanish Ministerio de Educacion y Ciencia for a predoctoral and postdoctoral fellowship, respectively.Peer Reviewe

Interchain interactions and magnetic properties of Li2CuO2

An effective Hamiltonian is constructed for an insulating cuprate with edge-sharing chains Li2CuO2.The Hamiltonian contains the nearest and next-nearest neighboring intrachain and zigzag-type interchain interactions.The values of the interactions are obtained from the analysis of the magnetic susceptibility, and this system is found to be described as coupled frustrated chains.We calculate the dynamical spin correlation function S(q,\omega) by using the exact diagonalization method, and show that the spectra of S(q,\omega) are characterized by the zigzag-type interchain interactions. The results of the recent inelastic neutron scattering experiment are discussed in the light of the calculated spectra.Comment: 4 pages, 3 figures, RevTe

High-pressure x-ray diffraction and ab initio study of Ni2Mo3N, Pd2Mo3N, Pt2Mo3N, Co3Mo3N, and Fe3Mo3N: Two families of ultra-incompressible bimetallic interstitial nitrides

We have studied by means of high-pressure x-ray diffraction the structural stability of Ni2Mo3N, Co3Mo3N, and Fe3Mo3N. We also report ab initio computing modeling of the high-pressure properties of these compounds, Pd2Mo3N, and Pt2Mo3N. We have found that the nitrides remain stable in the ambient-pressure cubic structure at least up to 50 GPa and determined their equation of state. All of them have a bulk modulus larger than 300 GPa. Single-crystal elastic constants have been calculated in order to quantify the stiffness of the investigated nitrides. We found that they should have a Vickers hardness similar to that of cubic spinel nitrides like gamma-Si3N4Comment: 25 pages, 6 figures, 3 table

The dynamics of a hole in a CuO_4 plaquette: electron energy-loss spectroscopy of Li_2CuO_2

We have measured the energy and momentum dependent loss function of Li_2CuO_2 single crystals by means of electron energy-loss spectroscopy in transmission. Using the same values for the model parameters, the low-energy features of the spectrum as well as published Cu 2p_(3/2) x-ray photoemission data of Li_2CuO_2 are well described by a cluster model that consists of a single CuO_4 plaquette only. This demonstrates that charge excitations in Li_2CuO_2 are strongly localized.Comment: 5 pages, 5 figure