Fault Localization in Multi-Threaded C Programs using Bounded Model Checking (extended version)

Software debugging is a very time-consuming process, which is even worse for multi-threaded programs, due to the non-deterministic behavior of thread-scheduling algorithms. However, the debugging time may be greatly reduced, if automatic methods are used for localizing faults. In this study, a new method for fault localization, in multi-threaded C programs, is proposed. It transforms a multi-threaded program into a corresponding sequential one and then uses a fault-diagnosis method suitable for this type of program, in order to localize faults. The code transformation is implemented with rules and context switch information from counterexamples, which are typically generated by bounded model checkers. Experimental results show that the proposed method is effective, in such a way that sequential fault-localization methods can be extended to multi-threaded programs.Comment: extended version of paper published at SBESC'1

Magnetic phases evolution in the LaMn1-xFexO3+y system

We have investigated the crystal structure and magnetic properties for polycrystalline samples of LaMn1-xFexO3+y, in the whole range x=0.0 to x=1.0, prepared by solid state reaction in air. All samples show the ORT-2 orthorhombic structure that suppresses the Jahn-Teller distortion, thus favoring a ferromagnetic (FM) superexchange (SE) interaction between Mn^{3+}-O-Mn^{3+}. For x=0.0 the oxygen excess (y ~ 0.09) produces vacancies in the La and Mn sites and generates a fraction around 18% of Mn^{4+} ions and 82% of the usual Mn^{3+} ions, with possible double exchange interaction between them. The Fe doping in this system is known to produce only stable Fe^{3+} ions. We find an evolution from a fairly strong FM phase with a Curie temperature T_{C} ~ 160 K, for x=0.0, to an antiferromagnetic (AFM) phase with T_{N} = 790 K, for x=1.0, accompanied by clear signatures of a cluster-glass behavior. For intermediate Fe contents a mixed-phase state occurs, with a gradual decrease (increase) of the FM (AFM) phase, accompanied by a systematic transition broadening for 0.2 < x < 0.7. A model based on the expected exchange interaction among the various magnetic-ion types, accounts very well for the saturation-magnetization dependence on Fe doping.Comment: 27 pages, 9 figure

On Matrix Superpotential and Three-Component Normal Modes

We consider the supersymmetric quantum mechanics (SUSY QM) with three- component normal modes for the Bogomol'nyi-Prasad-Sommerfield (BPS) states. An explicit form of the SUSY QM matrix superpotential is presented and the corresponding three-component bosonic zero-mode eigenfunction is investigated.Comment: 17 pages, no figure. Paper accepted for publication in Journal of Physics A: Mathematical and Theoretica

Caracterização de substâncias húmicas extraídas de solo tratado com carvão vegetal (biochar).

As Terras Pretas de Índio (TPI) são solos antropogênicos encontrados na Amazônia, que têm alto teor de carbono (C) orgânico, alta fertilidade e alta capacidade de recuperação. Os TPI possuem estas características devido ao caráter pirogênico do C que neles se encontra, e que se manifestam na alta proporção de estruturas aromáticas policondensadas com grupos funcionais carboxílicos originadas das alterações naturais de biomassa carbonizada adicionada ao solo pelas populações indígenas pré-colombianas

Fusion Tree Sorting

The sorting problem is one of the most relevant problems in computer science. Within the scope of modern computer science it has been studied for more than 70 years. In spite of these facts, new sorting algorithms have been developed in recent years. Among several types of sorting algorithms, some are quicker; others are more economic in relation to space, whereas others insert a few restrictions in relation to data input. This paper is aimed at explaining the fusion tree data structure, which is responsible for the first sorting algorithm with complexity time smaller than nlgn. The nlgn time complexity has led to some confusion and generated the wrong belief in part of the community of being the minimum possible for this type of problem.Comment: 17 page

Regulatory Dynamics on Random Networks: Asymptotic Periodicity and Modularity

We study the dynamics of discrete-time regulatory networks on random digraphs. For this we define ensembles of deterministic orbits of random regulatory networks, and introduce some statistical indicators related to the long-term dynamics of the system. We prove that, in a random regulatory network, initial conditions converge almost surely to a periodic attractor. We study the subnetworks, which we call modules, where the periodic asymptotic oscillations are concentrated. We proof that those modules are dynamically equivalent to independent regulatory networks.Comment: 23 pages, 3 figure