Recommendations
A Typed C11 Semantics for Interactive Theorem Proving
CPP '15: Proceedings of the 2015 Conference on Certified Programs and ProofsWe present a semantics of a significant fragment of the C programming language as described by the C11 standard. It consists of a small step semantics of a core language, which uses a structured memory model to capture subtleties of C11, such as strict-...
Mizoguchi-Takahashi's type fixed point theorem
Recently, Eldred [A.A. Eldred, J. Anuradha, P. Veeramani, On equivalence of generalized multi-valued contactions and Nadler's fixed point theorem, J. Math. Anal. Appl. (2007) doi:10.1016/j.jmaa.2007.01.087] claimed that Nadler's [S.B. Nadler Jr., ...
Translating timed i/o automata specifications for theorem proving in PVS
FORMATS'05: Proceedings of the Third international conference on Formal Modeling and Analysis of Timed SystemsTimed Input/Output Automaton (TIOA) is a mathematical framework for specification and analysis of systems that involve discrete and continuous evolution. In order to employ an interactive theorem prover in deducing properties of a TIOA, its state-...
Comments