A generic framework for context-sensitive analysis of modular programs

Context-sensitive analysis provides information which is potentially more accurate than that provided by context-free analysis. Such information can then be applied in order to validate/debug the program and/or to specialize the program obtaining important improvements. Unfortunately, context-sensitive analysis of modular programs poses important theoretical and practical problems. One solution, used in several proposals, is to resort to context-free analysis. Other proposals do address context-sensitive analysis, but are only applicable when the description domain used satisfies rather restrictive properties. In this paper, we argüe that a general framework for context-sensitive analysis of modular programs, Le., one that allows using all the domains which have proved useful in practice in the non-modular setting, is indeed feasible and very useful. Driven by our experience in the design and implementation of analysis and specialization techniques in the context of CiaoPP, the Ciao system preprocessor, in this paper we discuss a number of design goals for context-sensitive analysis of modular programs as well as the problems which arise in trying to meet these goals. We also provide a high-level description of a framework for analysis of modular programs which does substantially meet these objectives. This framework is generic in that it can be instantiated in different ways in order to adapt to different contexts. Finally, the behavior of the different instantiations w.r.t. the design goals that motivate our work is also discussed

Verification of Java Bytecode using Analysis and Transformation of Logic Programs

State of the art analyzers in the Logic Programming (LP) paradigm are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including termination, bounds on resource consumption, etc. The aim of this work is to automatically transfer the power of such analysis tools for LP to the analysis and verification of Java bytecode (JVML). In order to achieve our goal, we rely on well-known techniques for meta-programming and program specialization. More precisely, we propose to partially evaluate a JVML interpreter implemented in LP together with (an LP representation of) a JVML program and then analyze the residual program. Interestingly, at least for the examples we have studied, our approach produces very simple LP representations of the original JVML programs. This can be seen as a decompilation from JVML to high-level LP source. By reasoning about such residual programs, we can automatically prove in the CiaoPP system some non-trivial properties of JVML programs such as termination, run-time error freeness and infer bounds on its resource consumption. We are not aware of any other system which is able to verify such advanced properties of Java bytecode

Abstract verification and debugging of constraint logic programs

The technique of Abstract Interpretation [13] has allowed the development of sophisticated program analyses which are provably correct and practical. The semantic approximations produced by such analyses have been traditionally applied to optimization during program compilation. However, recently, novel and promising applications of semantic approximations have been proposed in the more general context of program verification and debugging [3],[10],[7]

Shot noise of a quantum dot measured with GHz stub impedance matching

The demand for a fast high-frequency read-out of high impedance devices, such as quantum dots, necessitates impedance matching. Here we use a resonant impedance matching circuit (a stub tuner) realized by on-chip superconducting transmission lines to measure the electronic shot noise of a carbon nanotube quantum dot at a frequency close to 3 GHz in an efficient way. As compared to wide-band detection without impedance matching, the signal to noise ratio can be enhanced by as much as a factor of 800 for a device with an impedance of 100 k$\Omega$. The advantage of the stub resonator concept is the ease with which the response of the circuit can be predicted, designed and fabricated. We further demonstrate that all relevant matching circuit parameters can reliably be deduced from power reflectance measurements and then used to predict the power transmission function from the device through the circuit. The shot noise of the carbon nanotube quantum dot in the Coulomb blockade regime shows an oscillating suppression below the Schottky value of $2eI$, as well an enhancement in specific regions.Comment: 6 pages, 4 figures, supplementar

The CIAO multiparadigm compiler and system: A progress report

Abstract is not available