@article {18360,
	title = {A formal program complexity model and its application},
	journal = {Journal of Systems and Software},
	volume = {17},
	year = {1992},
	month = {1992/03//},
	pages = {253 - 266},
	abstract = {This article takes an axiomatic approach to defining program complexity using complexity rankings and measures. A complexity ranking is an abstract, qualitative comparison between programs that is approximated by a complexity measure on each program. A set of axioms are stated and a classification scheme is presented with properties of each class. This is extended a series of properties developed by Weyuker. The formal model has many applications, including evaluating and classifying existing complexity measures and serving as criteria for complexity measure selection.},
	isbn = {0164-1212},
	doi = {10.1016/0164-1212(92)90114-Y},
	url = {http://www.sciencedirect.com/science/article/pii/016412129290114Y},
	author = {Tian,Jianhui and Zelkowitz, Marvin V}
}
