Abstract: This paper describes a method for transforming concurrent Ada programs by way of abstractions into input for the UPPAAL model checker for the purpose of analyzing the real-time properties of programs. The method depends on being able to compute the best and worst case execution times of procedures called by the various tasks in a concurrent program. It employs abstractions of actions to simplify the control structure of a task, abstractions of complex data structures to more abstract variables and abstractions to simplify clocks. The method is illustrated on an Ada implementation of a kernel implementing ICPP scheduling. A TLA specification of a typical client user task is derived that can be interpreted as an UPPAAL timed automaton.