Result checking is the theory and practice of proving that the result of an execution of a program on an input is correct. Result checking has most often been envisioned in the fr...
Abstract. Non-functional requirements encompass important design concerns such as schedulability, security, and communication constraints. In model-based development they non-local...
Ethan K. Jackson, Dirk Seifert, Markus Dahlweid, T...
In many distributed computing paradigms, especially sensor networks and ubiquitous computing but also grid computing and web services, programmers commonly tie their application to...
Jonathan J. Davies, Alastair R. Beresford, Alan My...
Traditional interprocedural data-flow analysis is performed on whole programs; however, such whole-program analysis is not feasible for large or incomplete programs. We propose fr...
Abstract. Verification of programs with invocations to unknown procedures is a practical problem, because in many scenarios not all codes of programs to be verified are available...