ESC/Java: Difference between revisions

Revision as of 05:12, 25 January 2013

Revision as of 23:13, 28 January 2013

Line 1:

{{NoMore footnotes|date=March 2010}}

'''ESC/Java''' (and more recently '''ESC/Java2'''), the "Extended Static Checker for Java," is a [[programming tool]] that attempts to find common [[run-time error]]s in [[Java (programming language)|Java]] programs at [[compile time]].<ref>C. Flanagan, K.R.M. Leino, M. Lillibridge, G. Nelson, J. B. Saxe and R. Stata. "Extended static checking for Java". In ''Proceedings of the Conference on Programming Language Design and Implementation'', pages 234--245, 2002. doi: http://doi.acm.org/10.1145/512529.512558</ref> The underlying approach used in ESC/Java is referred to as [[extended static checking]], which is a collective name referring to a range of techniques for [[static code analysis|statically checking]] the correctness of various program constraints. For example, that an integer variable is greater-than-zero, or lies between the [[bounds checking|bounds of an array]]. This technique was pioneered in ESC/Java (and its predecessor, ESC/Modula-3) and can be thought of as an extended form of [[type checking]]. Extended static checking usually involves the use of an [[automated theorem proving|automated theorem prover]] and, in ESC/Java, the Simplify theorem prover was used.

Line 19:

* [http://www.researchchannel.org/prog/displayevent.aspx?rID=2761&fID=345 Extended Static Checking] Computer Science & Engineering Colloquia. University of Washington. 1999.

{{DEFAULTSORT:Esc/ Java}}

[[Category:2002 introductions]]

[[Category:Static program analysis tools]]