Reasoning about Relaxed Programs
A number of approximate program transformations have recently emerged that enable transformed programs to trade accuracy of their results for increased performance by dynamically and nondeterministically modifying variables that control program execution. We call such transformed programs relaxed pr...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Published: |
2011
|
| Online Access: | http://hdl.handle.net/1721.1/67031 |