Axel Dold

Learn More
Self-medication is documented as an integral part of health care therapy in developing countries such as Ethiopia, Cameroon, Uganda and Mexico. In South Africa the types of illnesses and health problems that are referred to both traditional healers and biomedical practices have been well documented. However, very little literature exists on self-diagnosis,(More)
We report on a large formal verification effort in mechanically proving correct a compiling specification for a realistic bootstrap compiler from ComLisp (a subset of ANSI Common Lisp sufficiently expressive to serve as a compiler implementation language) to binary Transputer code using the PVS system. The compilation is carried out in five steps through a(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)
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)