Roy Bartsch

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper is to show how mechanical theorem proving can be used to verify even complex and heuristic programs like mission critical expert systems. Our approach is mechanical in two ways: The basic idea of runtime result verification is to validate each program result (at runtime) rather than to verify the program itself beforehand. Filtering each result(More)
  • 1