Sciweavers

1716 search results - page 104 / 344
» Proving Conditional Termination
Sort
View
AAAI
2008
13 years 11 months ago
Revising Imprecise Probabilistic Beliefs in the Framework of Probabilistic Logic Programming
Probabilistic logic programming is a powerful technique to represent and reason with imprecise probabilistic knowledge. A probabilistic logic program (PLP) is a knowledge base whi...
Anbu Yue, Weiru Liu
FORTEST
2008
13 years 10 months ago
From MC/DC to RC/DC: Formalization and Analysis of Control-Flow Testing Criteria
This paper describes an approach to the formalization of existing criteria used in computer systems software testing and proposes a new Reinforced Condition/Decision Coverage (RC/D...
Sergiy A. Vilkomir, Jonathan P. Bowen
FAC
2000
124views more  FAC 2000»
13 years 8 months ago
Algebraic Models of Correctness for Microprocessors
In this paper we present a method of describing microprocessors at different levels of temporal and data abstraction. We consider microprogrammed, pipelined and superscalar proces...
Anthony C. J. Fox, Neal A. Harman
NFM
2011
209views Formal Methods» more  NFM 2011»
13 years 3 months ago
Formalizing Probabilistic Safety Claims
A safety claim for a system is a statement that the system, which is subject to hazardous conditions, satisfies a given set of properties. Following work by John Rushby and Bev Li...
Heber Herencia-Zapana, George Hagen, Anthony Narka...
ACSAC
2007
IEEE
14 years 3 months ago
Tampering with Special Purpose Trusted Computing Devices: A Case Study in Optical Scan E-Voting
Special purpose trusted computing devices are currently being deployed to offer many services for which the general purpose computing paradigm is unsuitable. The nature of the ser...
Aggelos Kiayias, Laurent Michel, Alexander Russell...