Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
A special final coalgebra theorem, in the style of Aczel's [2], is proved within standard Zermelo-Fraenkel set theory. Aczel's AntiFoundation Axiom is replaced by a varia...
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
This paper describes a system called TESTTUBE that combines static and dynamic analysis to perform selective retesting of software systems written in C. TESTTUBEfirst identifies w...
Although Non-Functional Requirements (NFR) have been present in many software development methods, they have been faced as a second or even third class type of requirement, frequen...
Luiz Marcio Cysneiros, Julio Cesar Sampaio do Prad...