We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Because the concept of program correctness is generally taught as an activity independent of the programming process, most introductory computer science (CS) students perceive it ...
Timothy S. Gegg-Harrison, Gary R. Bunce, Rebecca D...
Web services -- Web-accessible programs and devices ? are a key application area for the Semantic Web. With the proliferation of Web services and the evolution towards the Semanti...