Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
The paper presents a novel approach based on Bogor for the accurate verification of applications based on PublishSubscribe infrastructures. Previous efforts adopted standard model...
The accurate selection of the utterances is very important to obtain right estimated speaker models in speaker verification. In this sense, it is important to determine the quality...
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...