In computer science, abstract interpretation is a theory of sound approximation of the semantics of computer programs, based on monotonic functions over ordered sets, especially lattices. It can be viewed as a partial execution of a computer program which gains information about its semantics (e.g. control structure, flow of information) without performing all the calculations. Its main concrete application is formal static analysis, the automatic extraction of information about the possible executions of computer programs; such analyses have two main usages: inside compilers, to analyse programs in order to decide whether certain optimisations or transformations are applicable; for debugging or even the certification of programs against classes of bugs. Abstract interpretation was formalized by Patrick Cousot and Radhia Cousot.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.