Muhammad Taimoor Khan

Learn More
In this paper, we present our ongoing work and initial results on the formal specification and verification of MiniMaple (a substantial subset of Maple with slight extensions) programs. The main goal of our work is to find behavioral errors in such programs w.r.t. their specifications by static analysis. This task is more complex for widely used computer(More)
We present our initial results on the behavioral analysis of computer algebra programs. Computer algebra programs written in symbolic computation languages such as Maple and Mathematica sometimes do not behave as expected [5], e.g. by triggering runtime errors or delivering wrong results. There has been a lot of research on applying formal techniques to(More)
In this paper, we give the complete definition of a formal (denota-tional) semantics of a subset of the language of the computer algebra systems Maple which we call MiniMaple. As a next step we will develop a verification calculus for this language. The verification conditions generated by the calculus must be sound with respect to the formal semantics.
In this paper, we present the syntactic definition and the formal type system for a substantial subset of the language of the computer algebra system Maple, which we call MiniMaple. The goal of the type system is to prevent runtime typing errors by static analysis of the source code of MiniMaple programs. The type system is implemented by a type checker,(More)
This paper is an example-based demonstration of our initial results on the formal specification of programs written in the computer algebra language MiniMaple (a substantial subset of Maple with slight extensions). The main goal of this work is to define a verification framework for MiniMaple. Formal specification of MiniMaple programs is rather complex(More)
In this paper, we give the complete definition of the translation of MiniMaple and its specification language to an intermediate language Why3ML of verification calculus Why3. For the verification, we first translate MiniMaple annotated program into a semantically equivalent Why3ML program, then verification conditions are generated by using Why3(More)
In this poster, we present an overview of our ongoing work and results on the development of a verification framework for programs written in a (substantial) subset of the language of the computer algebra system Maple, which we call MiniMaple. The main goal here is to detect behavioral errors in such programs w.r.t. their specifications by static analysis.(More)
In this thesis, we present a novel framework for the formal specification and verification of computer algebra programs and its application to a non-trivial computer algebra package. The programs are written in the language MiniMaple which is a substantial subset of the language of the commercial computer algebra system Maple. The main goal of the thesis is(More)
  • 1