Na área de simulação de processos, existe uma visível tendência da migração das ferramentas seqüenciais modulares, que hoje são as mais amplamente utilizadas, para as baseadas em equações. Uma das principais vantagens do paradigma baseado em equações ou simultâneo é que este se mostra eficiente na solução de problemas de simulação, otimização, estimação de parâmetros e reconciliação de dados, todos baseados em um mesmo conjunto de modelos, evitando retrabalho de modelagem. Porém, a tecnologia simultânea também apresenta algumas deficiências, onde destacam-se os problemas de robustez tanto na modelagem quanto na obtenção de resultados numéricos. Este trabalho tem como objetivo reunir e desenvolver técnicas que permitam reduzir estas deficiências. Para tanto, as técnicas conhecidas para depuração de sistemas de equações que representam problemas estacionários e dinâmicos foram estudadas em detalhe. Pôde-se observar que para o caso estático os métodos disponíveis para depuração de modelos, já se apresentam em um nível bem desenvolvido. Já para o caso dinâmico, onde há uma maior complexidade, as técnicas conhecidas encontram-se em um nível de desenvolvimento muito menor. Neste ponto encontram-se as principais contribuições deste trabalho. / In the field of process simulation the movement from the sequential modular tools, which are currently the most widely used, to the equation based approach is clear. One of the key advantages of the equation based or simulatneous approach is that using a single model one can solve simulation, optimization, parameter estimation, and optimization problems. This fact avoids modeling rework for each application. However, the simultaneous technology has problems regarding modeling and solving robustness. This work aims to group and develop methods capable of minimize these deficiencies. In order to achieve this goal, available debugging approaches for both steady-state and dynamic system of equations were studied in detail. For the steady-state case well stablished debugging techniques are known. For dynamic models, where the complexity is higher, the analysis and debugging methods are much less mature. This was the source for the major contributions of this work.

Na área de simulação de processos, existe uma visível tendência da migração das ferramentas seqüenciais modulares, que hoje são as mais amplamente utilizadas, para as baseadas em equações. Uma das principais vantagens do paradigma baseado em equações ou simultâneo é que este se mostra eficiente na solução de problemas de simulação, otimização, estimação de parâmetros e reconciliação de dados, todos baseados em um mesmo conjunto de modelos, evitando retrabalho de modelagem. Porém, a tecnologia simultânea também apresenta algumas deficiências, onde destacam-se os problemas de robustez tanto na modelagem quanto na obtenção de resultados numéricos. Este trabalho tem como objetivo reunir e desenvolver técnicas que permitam reduzir estas deficiências. Para tanto, as técnicas conhecidas para depuração de sistemas de equações que representam problemas estacionários e dinâmicos foram estudadas em detalhe. Pôde-se observar que para o caso estático os métodos disponíveis para depuração de modelos, já se apresentam em um nível bem desenvolvido. Já para o caso dinâmico, onde há uma maior complexidade, as técnicas conhecidas encontram-se em um nível de desenvolvimento muito menor. Neste ponto encontram-se as principais contribuições deste trabalho. / In the field of process simulation the movement from the sequential modular tools, which are currently the most widely used, to the equation based approach is clear. One of the key advantages of the equation based or simulatneous approach is that using a single model one can solve simulation, optimization, parameter estimation, and optimization problems. This fact avoids modeling rework for each application. However, the simultaneous technology has problems regarding modeling and solving robustness. This work aims to group and develop methods capable of minimize these deficiencies. In order to achieve this goal, available debugging approaches for both steady-state and dynamic system of equations were studied in detail. For the steady-state case well stablished debugging techniques are known. For dynamic models, where the complexity is higher, the analysis and debugging methods are much less mature. This was the source for the major contributions of this work.

Na área de simulação de processos, existe uma visível tendência da migração das ferramentas seqüenciais modulares, que hoje são as mais amplamente utilizadas, para as baseadas em equações. Uma das principais vantagens do paradigma baseado em equações ou simultâneo é que este se mostra eficiente na solução de problemas de simulação, otimização, estimação de parâmetros e reconciliação de dados, todos baseados em um mesmo conjunto de modelos, evitando retrabalho de modelagem. Porém, a tecnologia simultânea também apresenta algumas deficiências, onde destacam-se os problemas de robustez tanto na modelagem quanto na obtenção de resultados numéricos. Este trabalho tem como objetivo reunir e desenvolver técnicas que permitam reduzir estas deficiências. Para tanto, as técnicas conhecidas para depuração de sistemas de equações que representam problemas estacionários e dinâmicos foram estudadas em detalhe. Pôde-se observar que para o caso estático os métodos disponíveis para depuração de modelos, já se apresentam em um nível bem desenvolvido. Já para o caso dinâmico, onde há uma maior complexidade, as técnicas conhecidas encontram-se em um nível de desenvolvimento muito menor. Neste ponto encontram-se as principais contribuições deste trabalho. / In the field of process simulation the movement from the sequential modular tools, which are currently the most widely used, to the equation based approach is clear. One of the key advantages of the equation based or simulatneous approach is that using a single model one can solve simulation, optimization, parameter estimation, and optimization problems. This fact avoids modeling rework for each application. However, the simultaneous technology has problems regarding modeling and solving robustness. This work aims to group and develop methods capable of minimize these deficiencies. In order to achieve this goal, available debugging approaches for both steady-state and dynamic system of equations were studied in detail. For the steady-state case well stablished debugging techniques are known. For dynamic models, where the complexity is higher, the analysis and debugging methods are much less mature. This was the source for the major contributions of this work.

The technical evolution during the past decade have escalated the use of electronic devices, which are more common today than ever before. The market is still growing rapidly and will continue to do so. The reason for this is the increased demand for devices with integrated circuits. In addition to the increased volume of production, the chips are also becoming more complex which is also reflected in the requirements of the chip design process. An advanced chip that combines several different hardware modules (cores) to form a complete system is called a System-on-Chip (SoC). It is of great importance that these chips work according to expectation, although it can be difficult to guarantee. The purpose of SoC testing is to verify correct behaviour as well as for diagnosis and debug. Complex systems lead to more and bigger tests which lead to increased test data volume and test time. This results in a higher test cost and many methods are proposed to remedy this situation. This report proposes a method that minimises fail result data with a real-time compression component embedded on the chip. The compressed fail results can be saved on-chip and retrieved when needed instead of during the test. Furthermore this method will facilitate debug and diagnosis of SoCs. A mask buffer is used to give the opportunity of choosing exactly which cycles, pins or bits that are relevant. All other result bits are masked and ignored. The results are satisfying, the data is compressed to a much smaller size which is easier to store on-chip. The method is simple, fast and loss-less.

The debug register rootkit is a special type of rootkit that has existed for over a decade, and is told to be undetectable by any scanning tools. It exploits the debug registers in Intel’s IA-32 processor architecture. This paper investigates the debug register rootkit to find out why it is considered a threat, and which malware removal tools have implemented detection algorithms against this threat. By implementing and running a debug register rootkit against the most popular Linux tools, new conclusions about the protection of the Linux system can be reached. Recently, debug register rootkits were found on Windows as well. This project intends to bring knowledge about the problem and investigate if there are any threats. Our study has shown that still after 12 years, the most popular tools for the Linux operating system have not implemented any detection algorithms against this threat. The security industry may need to prepare for this threat in case it is spread further.

The debug register rootkit is a special type of rootkit that has existed for over a decade, and is told to be undetectable by any scanning tools. It exploits the debug registers in Intel’s IA-32 processor architecture. This paper investigates the debug register rootkit to find out why it is considered a threat, and which malware removal tools have implemented detection algorithms against this threat. By implementing and running a debug register rootkit against the most popular Linux tools, new conclusions about the protection of the Linux system can be reached. Recently, debug register rootkits were found on Windows as well. This project intends to bring knowledge about the problem and investigate if there are any threats. Our study has shown that still after 12 years, the most popular tools for the Linux operating system have not implemented any detection algorithms against this threat. The security industry may need to prepare for this threat in case it is spread further.

The first step of debugging a deployed application is to reproduce the reported bug. But bugs that cause unpredictable behaviors without crashing the applica- tion can be difficult to reproduce, because the developer has to rely on bug-re- ports issued by users. The goal of this thesis has been to develop a diagnostic tool which makes user-reported bugs easier to reproduce. More specifically, the goal has been to develop such a tool for React Native applications implement- ing Redux, taking into consideration both state-data stored in Redux stores and React Native components. Requirements for the diagnostic tool were laid out and partitioned into proto- types that were implemented separately in iterations and then merged into the resulting tool. Requirements were also drawn for three sample applications to test and evaluate the tool, as well as a back-end to prove the tool's capability in uploading and downloading state-data from a server. The thesis resulted in a diagnostic tool that's imported into an already existing code-base as a third-party library, and which collects the complete state of the reported application instance and delivers it to the developer as a single JSON document. The tool can then inject the state-data into a fresh instance of the ap- plication to make it identical to the malfunctioning instance reported by the user; a process referred to as "reviving". Redux stores demonstrated state-over- write protection which complicates state-injection. A study was performed to compare the impact this difference has on performance. As expected, the study revealed that the diagnostic tool takes marginally longer to revive state-data in Redux stores for this reason.

'...Zugriffsfehler im Modul xyz...' - solche oder ähnliche Fehlermeldungen sehen Benutzer von Computern meist dann, wenn sie versuchen mit einem Programm Operationen auszuführen, die fehlerhaft programmiert wurden. Die Ursachen für derartige Fehler sind dabei recht vielfältig. Oftmals sind sie bereits in der benutzten Programmiersprache zu suchen, dazu kommen zusätzlich Fehler in den Compilern, Beschränkungen in dem Betriebssystem sowie Seiteneffekte anderer Programme, wie z.B. falsches Speichermanagement. Angeführt wird die Liste möglicher Fehlerquellen allerdings vom Menschen selbst. Wobei auch hier noch zu unterscheiden ist, ob der Mensch einen Fehler aus Unwissenheit gemacht hat, oder ob er dessen Relevanz einfach unterschätzt hat. In beiden Fällen wird es immer schwer sein in einem Endprodukt die genaue Ursache eines Fehlverhaltens zu lokalisieren. Ähnlich wie es zu Problemen bei der Erstellung von Software kommen kann, treten natürlich auch während der Entwicklung einer Schaltung grundlegende Schwierigkeiten auf...

This thesis presents a novel approach to operation-centric tracing for hardware debug with a retrospective analysis of traces which are distributed across a computer system. Therefore, these traces record entries about the operations at runtime, and a software tool correlates these entries after a problem occurred. This tool is based on a generic method using identifiers saved from operations. Because identifiers are changed along the path of an operation through the system and traces record different information, the entries are transformed to find matching entries in other traces. After the correlation, the method reconstructs the operation paths with help of an operation graph which describes for each type of operation the subtasks and their sequence. With these paths the designer gets a better overview about the chip or system activity, and can isolate the problem cause faster. The TRACE MATCHER implements the described method and it is evaluated with an example bridge chip. Therefore, the benefit for hardware debug, correctness of the reconstructed paths, the performance of their Implementation, and the configuration effort are evaluated. At the end guidelines for trace and system design describe how matching can be improved by carefully designed identifiers at operations.

Debugging is an essential part of programming. No debugger is good at debugging optimized Rust code, which is a problem because unoptimized Rust code is slow compared to optimized. The ability to debug optimized code is important for embedded systems because of the close relation to hardware. Therefore, a tool like a debugger is handy because it enables the developer to see what is happening in the hardware when debugging embedded systems.This thesis presents a debugger named ERDB and a debugging library named rust-debug. The goal of the library is to make it easier to create debugging tools by simplifying the process of retrieving debug information from the DWARF format. The goal of ERDB is to improve debugging for optimized Rust code.This thesis will explain the design and implementation of ERDB and rust-debug, and it will also explain how the debug information format DWARF works.ERDB will be compared to other debuggers to see if it has achieved its goal. The result highlight that the problem is in the compiler not generating the needed debug information.