A integração de técnicas BIM (Building Information Modeling) no projeto e na construção de estruturas de madeira

Dissertação de mestrado integrado em Engenharia Civil

Estudi de nusos rígids prefabricats de formigó

Una de les principals limitacions de les edificacions industrialitzades resoltes amb prefabricat de formigó, és que els nusos que defineixen les interseccions dels seus elements són articulacions, provocant diferències importants del model estructural d’una obra resolta “in situ” on els nusos poden ser considerats encastaments elàstics. Aquest projecte proposa fer un pas més en aquesta limitació exposada i plantejar sistemes de nusos rígids, resolts amb el propi prefabricat que permetin variar el model de nusos articulats a rígids. Això augmentarà el grau d’hiperestaticitat de l’estructura, redistribuint els esforços en els seus elements, disminuint les deformacions i les longituds de vinclament dels pilars. L’objecte del treball és definir la millora que aporta la utilització de nusos rígids en el càlcul estructural, basada en una disminució de sol·licitacions al llarg del pilar, possibilitat de reducció de secció de pilars, reducció de l’armadura necessària en pilars i jàsseres, i finalment, un estalvi econòmic. Partirem d’un edifici d’habitatges d’ús residencial PB+3 de planta rectangular de 24·11 m i de 13,5 m d’altura. Aquesta tipologia d’edifici serà el punt de partida per al plantejament, sobre d’aquesta base, de 3 models estructurals diferents, amb la intenció de satisfer de forma raonada i minuciosa 3 plantejaments estàticament diferents

CEIP Maria Lluïsa Serra

Award-winning

Estudi de nusos rígids prefabricats de formigó

Una de les principals limitacions de les edificacions industrialitzades resoltes amb prefabricat de formigó, és que els nusos que defineixen les interseccions dels seus elements són articulacions, provocant diferències importants del model estructural d’una obra resolta “in situ” on els nusos poden ser considerats encastaments elàstics. Aquest projecte proposa fer un pas més en aquesta limitació exposada i plantejar sistemes de nusos rígids, resolts amb el propi prefabricat que permetin variar el model de nusos articulats a rígids. Això augmentarà el grau d’hiperestaticitat de l’estructura, redistribuint els esforços en els seus elements, disminuint les deformacions i les longituds de vinclament dels pilars. L’objecte del treball és definir la millora que aporta la utilització de nusos rígids en el càlcul estructural, basada en una disminució de sol·licitacions al llarg del pilar, possibilitat de reducció de secció de pilars, reducció de l’armadura necessària en pilars i jàsseres, i finalment, un estalvi econòmic. Partirem d’un edifici d’habitatges d’ús residencial PB+3 de planta rectangular de 24·11 m i de 13,5 m d’altura. Aquesta tipologia d’edifici serà el punt de partida per al plantejament, sobre d’aquesta base, de 3 models estructurals diferents, amb la intenció de satisfer de forma raonada i minuciosa 3 plantejaments estàticament diferents

A generator of efficient abstract machine implementations and its application to emulator minimization

The implementation of abstract machines involves complex decisions regarding, e.g., data representation, opcodes, or instruction specialization levéis, all of which affect the final performance of the emulator and the size of the bytecode programs in ways that are often difficult to foresee. Besides, studying alternatives by implementing abstract machine variants is a time-consuming and error-prone task because of the level of complexity and optimization of competitive implementations, which makes them generally difficult to understand, maintain, and modify. This also makes it hard to genérate specific implementations for particular purposes. To ameliorate those problems, we propose a systematic approach to the automatic generation of implementations of abstract machines. Different parts of their definition (e.g., the instruction set or the infernal data and bytecode representation) are kept sepárate and automatically assembled in the generation process. Alternative versions of the abstract machine are therefore easier to produce, and variants of their implementation can be created mechanically, with specific characteristics for a particular application if necessary. We illustrate the practicality of the approach by reporting on an implementation of a generator of production-quality WAMs which are specialized for executing a particular fixed (set of) program(s). The experimental results show that the approach is effective in reducing emulator size.

A generic framework for the analysis and specialization of kogic programs

The relationship between abstract interpretation [2] and partial evaluation [5] has received considerable attention and (partial) integrations have been proposed starting from both the partial deduction (see e.g. [6] and its references) and abstract interpretation perspectives. Abstract interpretation-based analyzers (such as the CiaoPP analyzer [9,4]) generally compute a program analysis graph [1] in order to propagate (abstract) call and success information by performing fixpoint computations when needed. On the other hand, partial deduction methods [7] incorporate powerful techniques for on-line specialization including (concrete) call propagation and unfolding.

Abstract Interpretation-based verification/certification in the ciaoPP system

CiaoPP is the abstract interpretation-based preprocessor of the Ciao multi-paradigm (Constraint) Logic Programming system. It uses modular, incremental abstract interpretation as a fundamental tool to obtain information about programs. In CiaoPP, the semantic approximations thus produced have been applied to perform high- and low-level optimizations during program compilation, including transformations such as múltiple abstract specialization, parallelization, partial evaluation, resource usage control, and program verification. More recently, novel and promising applications of such semantic approximations are being applied in the more general context of program development such as program verification. In this work, we describe our extensión of the system to incorpórate Abstraction-Carrying Code (ACC), a novel approach to mobile code safety. ACC follows the standard strategy of associating safety certificates to programs, originally proposed in Proof Carrying- Code. A distinguishing feature of ACC is that we use an abstraction (or abstract model) of the program computed by standard static analyzers as a certifícate. The validity of the abstraction on the consumer side is checked in a single-pass by a very efficient and specialized abstractinterpreter. We have implemented and benchmarked ACC within CiaoPP. The experimental results show that the checking phase is indeed faster than the proof generation phase, and that the sizes of certificates are reasonable. Moreover, the preprocessor is based on compile-time (and run-time) tools for the certification of CLP programs with resource consumption assurances.

Generation of reduced certificates in abstraction-carrying code

Abstraction-Carrying Code (ACC) has recently been proposed as a framework for mobile code safety in which the code supplier provides a program together with an abstraction whose validity entails compliance with a predefined safety policy. The abstraction plays thus the role of safety certifícate and its generation is carried out automatically by a fixed-point analyzer. The advantage of providing a (fixedpoint) abstraction to the code consumer is that its validity is checked in a single pass of an abstract interpretation-based checker. A main challenge is to reduce the size of certificates as much as possible while at the same time not increasing checking time. In this paper, we first introduce the notion of reduced certifícate which characterizes the subset of the abstraction which a checker needs in order to validate (and re-construct) the full certifícate in a single pass. Based on this notion, we then instrument a generic analysis algorithm with the necessary extensions in order to identify the information relevant to the checker.