Example: bankruptcy
Static Program Analysis - Aarhus Universitet

Static Program Analysis - Aarhus Universitet

Back to document page

in programming, what can be more fun than writing programs that analyze programs? As known from Turing and Rice, all nontrivial properties of the behavior of programs written in common programming languages are mathematically undecidable. This means that automated reasoning of software generally must involve approximation.

  Writing, Static

Download Static Program Analysis - Aarhus Universitet


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries