A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is
Traditional approaches to the algorithmic veri cation of real-time systems are limited to checking program correctness with respect to concrete timing properties (e.g., \message delivery within 10 milliseconds"). We address the more realistic and more ambitious problem of deriving symbolic constraints on the timing properties required of real-time systems (e.g., \message delivery within the time it takes to execute two assignment statements"). To model this problem, we i n troduce parametricdoi:10.1145/167088.167242 dblp:conf/stoc/AlurHV93 fatcat:dfo6ljqo5vdszh7j6fuwpdymqe