N. S. Papaspyrou. Denotational semantics of ANSI C. Computer Standards and Interfaces, 23:169--185, 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Verifying BDD Algorithms through Monadic Interpretation - Krstic, Matthews (2002) (Correct)
....checker, saying that if it terminates with the result False, then the input expression is not a tautology. 7 Completing the Refinement Formalization of the complete ANSI C language is a formidable challenge but within reach, as demonstrated by current work of Norish [Nor98] and Papaspyrou [Pap01]. Ideally, verification of C programs would use such a formalization, but for proving properties of a small set of programs partial formalizations could also be acceptable. BDD programs, for example, can be written in a small fragment of C that we can with little pain interpret monadically in ....
N. S. Papaspyrou. Denotational semantics of ANSI C. Computer Standards and Interfaces, 23:169--185, 2001.
Verifying BDD Algorithms through Monadic Interpretation - Krstic, Matthews (2002) (Correct)
....checker, saying that if it terminates with the result False, then the input expression is not a tautology. 7 Completing the Re nement Formalization of the complete ANSI C language is a formidable challenge but within reach, as demonstrated by current work of Norish [Nor98] and Papaspyrou [Pap01]. Ideally, veri cation of C programs would use such a formalization, but for proving properties of a small set of programs partial formalizations could also be acceptable. BDD programs, for example, can be written in a small fragment of C that we can with little pain interpret monadically in ....
N. S. Papaspyrou. Denotational semantics of ANSI C. Computer Standards and Interfaces, 23:169-185, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC