The Temporal Logic Sugar

Ilan Beer Shoham Ben-David Cindy Eisner Dana Fisman Anna Gringauze Yoav Rodeh

To appear at 13th Conference on Computer-Aided Verification (CAV01), Paris, France, 18-22 July 2001


We address the problem of the usability of temporal logic. Historically, the usability issue has focused on the relative merits of branching versus linear time, but we believe that the problem is not completely addressed by one or the other. Our solution is the temporal logic Sugar. Sugar adds the power of regular expressions to CTL. In addition, it adds syntactic sugar: an extensive set of operators which allow complicated properties to be expressed succinctly in an intuitive manner.

Server START Conference Manager
Update Time 28 Mar 2001 at 08:36:01
Start Conference Manager
Conference Systems