Automatic binding-related error diagnosis in logic programs

This paper proposes a diagnosis algorithm for locating a certain kind of errors in logic programs: variable binding errors that result in abstract symptoms during compile-time checking of assertions based on abstract interpretation. The diagnoser analyzes the graph generated by the abstract interpreter, which is a provably safe approximation of the program semantics. The proposed algorithm traverses this graph to find the point where the actual error originates (a reason of the symptom), leading to the point the error has been reported (the symptom). The procedure is fully automatic, not requiring any interaction with the user. A prototype diagnoser has been implemented and preliminary results are encouraging.

A flexible (C)LP-based approach to the analysis of object-oriented programs

Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of the work involving object-oriented languages and abstract interpretation usually omits the description of that language or just refers to the Control Flow Graph(CFG) it represents. However, this lack of formalization on one hand results in an absence of assurances regarding the correctness of the transformation and on the other it typically strongly couples the analysis to the source language. In this work we present a framework for analysis of object-oriented languages in which in a first phase we transform the input program into a representation based on Horn clauses. This allows on one hand proving the transformation correct attending to a simple condition and on the other being able to apply an existing analyzer for (constraint) logic programming to automatically derive a safe approximation of the semantics of the original program. The approach is flexible in the sense that the first phase decouples the analyzer from most languagedependent features, and correct because the set of Horn clauses returned by the transformation phase safely approximates the standard semantics of the input program. The resulting analysis is also reasonably scalable due to the use of mature, modular (C)LP-based analyzers. The overall approach allows us to report results for medium-sized programs.

Annotation algorithms for unrestricted independent and-parallelism in logic programs

We present two new algorithms which perform automatic parallelization via source-to-source transformations. The objective is to exploit goal-level, unrestricted independent and-parallelism. The proposed algorithms use as targets new parallel execution primitives which are simpler and more flexible than the well-known &/2 parallel operator. This makes it possible to genérate better parallel expressions by exposing more potential parallelism among the literals of a clause than is possible with &/2. The difference between the two algorithms stems from whether the order of the solutions obtained is preserved or not. We also report on a preliminary evaluation of an implementation of our approach. We compare the performance obtained to that of previous annotation algorithms and show that relevant improvements can be obtained.

Combining static analysis and profiling for estimating execution times

Effective static analyses have been proposed which infer bounds on the number of resolutions. These have the advantage of being independent from the platform on which the programs are executed and have been shown to be useful in a number of applications, such as granularity control in parallel execution. On the other hand, in distributed computation scenarios where platforms with different capabilities come into play, it is necessary to express costs in metrics that include the characteristics of the platform. In particular, it is specially interesting to be able to infer upper and lower bounds on actual execution times. With this objective in mind, we propose an approach which combines compile-time analysis for cost bounds with a one-time profiling of a given platform in order to determine the valúes of certain parameters for that platform. These parameters calibrate a cost model which, from then on, is able to compute statically time bound functions for procedures and to predict with a significant degree of accuracy the execution times of such procedures in that concrete platform. The approach has been implemented and integrated in the CiaoPP system.

User-definable resource bounds analysis for logic programs

We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in general be functions of input data sizes. A resource in our approach is a quite general, user-defined notion which associates a basic cost function with elementary operations. The analysis then derives the related (upper- and lower-bound) resource usage functions for all predicates in the program. We also present an assertion language which is used to define both such resources and resourcerelated properties that the system can then check based on the results of the analysis. We have performed some preliminary experiments with some concrete resources such as execution steps, bytes sent or received by an application, number of files left open, number of accesses to a datábase, number of calis to a procedure, number of asserts/retracts, etc. Applications of our analysis include resource consumption verification and debugging (including for mobile code), resource control in parallel/distributed computing, and resource-oriented specialization.

Electrical energy balance contest in Solar Decathlon Europe 2012

Solar Decathlon Europe (SDE) is an international multidisciplinary competition in which 20 universityteams build and operate energy-efficient solar-powered houses. The aim of SDE is not only scientificbut also educational and divulgative, making visitors to understand the problems presented by realengineering applications and architecture. From a research perspective, the energy data gathered dur-ing the competition constitutes a very promising information for the analysis and understanding of thephotovoltaic systems, grid structures, energy balances and energy efficiency of the set of houses. Thisarticle focuses on the electrical energy components of SDE competition, the energy performance of thehouses and the strategies and behaviors followed by the teams. The rules evaluate the houses? electricalenergy self-sufficiency by looking at the electricity autonomy in terms of aggregated electrical energybalance; the temporary generation-consumption profile pattern correlation; and the use of electricityper measurable area. Although the houses are evaluated under the same climatological and consump-tion conditions, production results are very different due to the specific engineering solutions (differentelectrical topologies, presence or absence of batteries, diverse photovoltaic module solutions, etc.)

El concurso del tiempo : las viviendas progresivas del PREVI-Lima

La tesis se propone estudiar y analizar críticamente las viviendas progresivas del concurso internacional de arquitectura PREVI llevado a cabo en la ciudad de Lima en los años setenta y en el que participaron, entre otros, arquitectos como Atelier 5, Aldo Van Eyck, Candilis, Josic and Woods o José Luis Íñiguez de Ozono y Vázquez de Castro. Los casi cincuenta años transcurridos desde la construcción de las propuestas nos permiten realizar una crítica de los proyectos de construcción progresiva desde el punto de vista del crecimiento de las agrupaciones, las unidades de vivienda y las tecnologías empleadas o los mecanismos de gestión. Este estudio, a su vez, nos lleva a plantear la cuestión de la posible vigencia de este tipo de realizaciones en el Perú actual y en otros entornos latinoamericanos. ABSTRACT: The aim of this thesis is to study, analyse and evaluate critically the progressive housing projects of the international architectural competition PREVI that took place in Lima in the seventies. In this proposal were involved, among others, architects such as Atelier 5, Aldo Van Eyck, Candilis, Josic and Woods and José Luis Iñiguez de Ozoño and Vázquez de Castro. These proposals were built fifty years ago. It allows us to review these progressive projects from a new perspective and to evaluate them from the point of view of housing types and groups, innovative technologies or management strategies. In addition, this study leads us to think about the possibility of proposals like this in current Peru and other Latin American locations.

Evaluation of mission planning strategies of a robotic aerial vehicle for the AIRC international competition

The International Aerial Robotics Competition (IARC) is an important event where teams from universities design flying autonomous vehicles to overcome the last challenges in the field. The goal of the Seventh Mission proposed by the IARC is to guide several mobile ground robots to a target area. The scenario is complex and not determinist due to the random behavior of the ground robots movement. The UAV must select efficient strategies to complete the mission. The goal of this work has been evaluating different alternative mission planning strategies of a UAV for this competition. The Mission Planner component is in charge of taking the UAV decisions. Different strategies have been developed and evaluated for the component, achieving a better performance Mission Planner and valuable knowledge about the mission. For this purpose, it was necessary to develop a simulator to evaluate the different strategies. The simulator was built as an improvement of an existing previous version.

A Vision-based Quadrotor Multi-robot Solution for the Indoor Autonomy Challenge of the 2013 International Micro Air Vehicle Competition

This paper presents a completely autonomous solution to participate in the Indoor Challenge of the 2013 International Micro Air Vehicle Competition (IMAV 2013). Our proposal is a multi-robot system with no centralized coordination whose robotic agents share their position estimates. The capability of each agent to navigate avoiding collisions is a consequence of the resulting emergent behavior. Each agent consists of a ground station running an instance of the proposed architecture that communicates over WiFi with an AR Drone 2.0 quadrotor. Visual markers are employed to sense and map obstacles and to improve the pose estimation based on Inertial Measurement Unit (IMU) and ground optical flow data. Based on our architecture, each robotic agent can navigate avoiding obstacles and other members of the multi-robot system. The solution is demonstrated and the achieved navigation performance is evaluated by means of experimental flights. This work also analyzes the capabilities of the presented solution in simulated flights of the IMAV 2013 Indoor Challenge. The performance of the CVG UPM team was awarded with the First Prize in the Indoor Autonomy Challenge of the IMAV 2013 competition.