Axel Dold

Learn More
We describe an approach to mechanically prove the correct-ness of BURS speciications and show how such a tool can be connected with BURS based back-end generators 9]. The proofs are based on the operational semantics of both source and target system languages spec-iied by means of Abstract State Machines 14]. In 27] we decomposed the correctness condition(More)
— At present, software development in the automotive industry is characterized by frequent changes caused by new innovations, fast-growing system complexity, growing software portion in cars, changing business relationships. This dynamical environment demands for flexible software processes. In order to improve a software development process with respect to(More)
In this paper we describe a formal veriication of transformations for peephole optimization using the PVS system 12]. Our basic approach is to develop a generic scheme to mechanize these kinds of veri-cations for a large class of machine architectures. This generic scheme is instantiated with a formalization of a non-trivial stack machine 14] and a PDP-11(More)
In this paper we present an approach t o wards a framework based on the type theory ECC (Extended Calculus of Constructions) in which speciications, programs and operators for modular development b y stepwise reenement can be formally described and reasoned about. We show that generic software development steps can be expressed as higher-order functions and(More)
We present a framework for formalizing the semantics of expression evaluation using Abstract State Machines. Many programming languages allow some non-determinism for evaluating expressions. The semantics only have in common that arguments are evaluated before an operator is applied. The evaluation of one argument may be interleaved with the evaluation of(More)