Content deleted Content added
Magioladitis (talk | contribs) m clean up / fixed sortkey using AWB (8872) |
Nominated for deletion; see Wikipedia:Articles for deletion/ESC/Java. (TW) |
||
Line 1:
<!-- Please do not remove or change this AfD message until the issue is settled -->
{{Article for deletion/dated|page=ESC/Java|timestamp=20140207162833|year=2014|month=February|day=7|substed=yes|help=off}}
<!-- For administrator use only: {{Old AfD multi|page=ESC/Java|date=7 February 2014|result='''keep'''}} -->
<!-- End of AfD message, feel free to edit beyond this point -->
{{More 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.
| |||