Goryachev-Chaplygin, Kovalevskaya, and Brdi\v{c}ka-Eardley-Nappi-Witten pp-waves spacetimes with higher rank St\"ackel-Killing tensors

Hidden symmetries of the Goryachev-Chaplygin and Kovalevskaya gyrostats spacetimes, as well as the Brdi\v{c}ka-Eardley-Nappi-Witten pp-waves are studied. We find out that these spacetimes possess higher rank St\"ackel-Killing tensors and that in the case of the pp-wave spacetimes the symmetry group of the St\"ackel-Killing tensors is the well-known Newton-Hooke group.Comment: 11 pages; accepted for publication in JM

The modular Dirac equation

We introduce a new equation we dubbed the modular Dirac equation to see and reconstruct a spin 1/2 particle at the center of a nearly $AdS_2$ spacetime in the entanglement wedge reconstruction paradigm and we study hidden symmetries of this spacetime, too. Various properties of the Dirac modular operator are studied: a generalized Tomita-Takesaki construction, the connection to the Schwarzian derivative of the logarithm of the modular Dirac operator, the link with the an allowable complex metric, the connection to regenesis, we write the corresponding Lagrangian of the modular Dirac equation and we put in perspective some limitations of the current bulk reconstruction in the case of unknown couplings.Comment: 14 pages. Comments welcome

An architecture-based dependability modeling framework using AADL

For efficiency reasons, the software system designers' will is to use an integrated set of methods and tools to describe specifications and designs, and also to perform analyses such as dependability, schedulability and performance. AADL (Architecture Analysis and Design Language) has proved to be efficient for software architecture modeling. In addition, AADL was designed to accommodate several types of analyses. This paper presents an iterative dependency-driven approach for dependability modeling using AADL. It is illustrated on a small example. This approach is part of a complete framework that allows the generation of dependability analysis and evaluation models from AADL models to support the analysis of software and system architectures, in critical application domains

Memory Leak Analysis by Contradiction

We present a novel leak detection algorithm. To prove the absence of a memory leak, the algorithm assumes its presence and runs a backward heap analysis to disprove this assumption. We have implemented this approach in a memory leak analysis tool and used it to analyze several routines that manipulate linked lists and trees. Because of the reverse nature of the algorithm, the analysis can locally reason about the absence of memory leaks. We have also used the tool as a scalable, but unsound leak detector for C programs. The tool has found several bugs in larger programs from the SPEC2000 suite

Demand-Driven Alias Analysis for C

This paper presents a demand-driven, flow-insensitive analysis algorithm for answering may-alias queries. We formulate the computation of alias queries as a CFL-reachability problem, and use this formulation to derive a demand-driven analysis algorithm. The analysis uses a worklist algorithm that gradually explores the program structure and stops as soon as enough evidence is gathered to answer the query. Unlike existing techniques, our approach does not require building or intersecting points-to sets. Experiments show that our technique is effective at answering alias queries accurately and efficiently in a demand-driven fashion. For a set of alias queries from the SPEC2000 benchmarks, our analysis is able to accurately answer 97% of the queries in less than 1 millisecond per query. Compared to a demand-driven points-to analysis that constructs and intersects points-to sets on-the-fly, our alias analysis is more than two times faster