Mechanical proofs about computer programs
Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
On the role of automated theorem proving in the compile-time derivation of concurrency
Journal of Automated Reasoning
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Compiler Specification and Verification
Compiler Specification and Verification
A Discipline of Programming
An Introduction to the PL/CV2 Programming Logic
An Introduction to the PL/CV2 Programming Logic
The Static Derivation of Concurrency and its Mechanzed Certification
Seminar on Concurrency, Carnegie-Mellon University
The Automated Proof of a Trace Transformation: Bitonic Sort
The Automated Proof of a Trace Transformation: Bitonic Sort
A Mechanically Certified Theorem About Optimal Concurrency of SortingNetworks
A Mechanically Certified Theorem About Optimal Concurrency of SortingNetworks
| Hi-index | 0.00 |
Our concern is the mechanical certification of transformations of sequential program executions into parallel executions with equivalent semantics. The objective of such transformations is to accelerate the execution of programs. The result reported here is a mechanically certified theorem of optimality. We present a transformation which applies to every program in a particular programming language, the language of sorting networks. This transformation transforms the sequential execution of any sorting network into an execution which is as fast or faster than any other transformation which applies to every sorting network. The theorem is stated formally in a mechanized logic.