This book constitutes the refereed proceedings of the 7th International Conference on Reliable Software Technologies, Ada-Europe 2002, held in Vienna, Austria, in June 2002.The 24 revised full papers presented together with four invited papers were carefully reviewed and selected for inclusion in the proceedings. The papers are organized in topical sections on embedded systems, case studies, real-time systems, high-integrity systems, Ada language issues, program analysis, tools, distributed systems, and libraries and APIs.

This book constitutes the refereed proceedings of the 22nd Ada-Europe International Conference on Reliable Software Technologies, Ada-Europe 2017, held in Vienna, Austria, in June 2017. The revised 15 full papers presented were carefully reviewed and selected from 37 submissions. They are organized in topical sections on runtimes, safety and security, timing verification, programming models, the future of safety-minded languages, mixed criticality.

Das Buch ist eine unkonventionelle, auf intuitives Verstandnis ausgerichtete Einfuhrung in die theoretischen Grundlagen der praktischen Aspekte der Informatik. Dabei geht es nicht ausschliesslich um die Entwicklung von Software. Beim Leser werden keine besonderen Vorkenntnisse vorausgesetzt. Es werden etwa Informationstheorie, Codierungstheorie, Zahlendarstellung und Numerik, Boolesche Algebra, Fuzzy-Logik sowie Quanten-Computer behandelt, wobei gewahrleistet bleibt, dass leicht verstandlich wird, wie auf diesem theoretischen Unterbau die praktische Realisierung eines Computers sowohl in Hardware als auch in Software erfolgen kann. Fur die funfte Auflage wurde das Buch komplett uberarbeitet und auf den neuesten Stand gebracht."

Static program analysis aims to determine the dynamic behavior of programs without actually executing them. Symbolic analysis is an advanced static program analysis technique that has been successfully applied to memory leak detection, compilation of parallel programs, detection of superfluous bound checks, variable aliases and task deadlocks, and to worst-case execution time analysis. The symbolic analysis information is invaluable for optimizing compilers, code generators, program verification, testing and debugging. In this book we take a novel algebra-based approach to the symbolic analysis of imperative programming languages. Our approach employs path expression algebra to compute the complete control and data flow analysis information valid at a given program point. This information is then provided for subsequent domain-specific analyses. Our approach derives solutions for arbitrary (even intra-loop) nodes of reducible and irreducible control flow graphs. We prove the correctness of our analysis method. Experimental results show that the problem sizes arising from real-world applications such as the SPEC95 benchmark suite are tractable for our symbolic analysis method.