The TEXbook
The revised report on the syntactic theories of sequential control and state
Theoretical Computer Science
A variable typed logic of effects
Information and Computation
From operational semantics to domain theory
Information and Computation
Reasoning about functions with effects
Higher order operational techniques in semantics
The next 700 programming languages
Communications of the ACM
Some Lambda Calculus and Type Theory Formalized
Journal of Automated Reasoning
Higher-Order and Symbolic Computation
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Programming, Transforming, and Providing with Function Abstractions and Memories
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
On generic context lemmas for higher-order calculi with sharing
Theoretical Computer Science
A contextual semantics for concurrent Haskell with futures
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Journal of Automated Reasoning
Correctness of program transformations as a termination problem
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
A supposedly fun thing i may have to do again: a HOAS encoding of Howe's method
Proceedings of the seventh international workshop on Logical frameworks and meta-languages, theory and practice
| Hi-index | 0.00 |
In this paper we report on the results of a sophisticated and substantial use of PVS to establish a recent result in operational semantics. The result we establish is a context lemma for operational equivalence for very wide class of programming languages, known as the CIU theorem. The proof uses the annotated holes technique to represent contexts and compute with them. Thus this paper demonstrates that that it is possible to use PVS as a tool in the development of modern operational techniques, and a productive tool at that. The process of formalizing the CIU theorem revealed several gaps in published proof. The proof of the CIU theorem in PVS took approximately six months to develop. The actual machine checked proof involves the proving of around one thousand facts, and takes PVS slightly less than three hours of CPU time running on a Linux machine configured with 2 GBytes of main memory and four 550 MHz Xeon PIII processors.