Sciweavers

1054 search results - page 81 / 211
» A Formalization of the Turing Test
Sort
View
SAC
2005
ACM
15 years 10 months ago
Towards the prioritization of regression test suites with data flow information
Regression test prioritization techniques re-order the execution of a test suite in an attempt to ensure that defects are revealed earlier in the test execution phase. In prior wo...
Matthew J. Rummel, Gregory M. Kapfhammer, Andrew T...
SAC
2006
ACM
15 years 10 months ago
Provably faithful evaluation of polynomials
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ï¬...
Sylvie Boldo, César Muñoz
DATE
2009
IEEE
119views Hardware» more  DATE 2009»
15 years 11 months ago
Improved worst-case response-time calculations by upper-bound conditions
Fast real-time feasibility tests and analysis algorithms are necessary for a high acceptance of the formal techniques by industrial software engineers. This paper presents a possi...
Victor Pollex, Steffen Kollmann, Karsten Albers, F...
SAC
2008
ACM
15 years 4 months ago
Using simplified event calculus in digital investigation
In a hypothesis-based approach to digital investigation, the investigator formulates his hypothesis about which events took place, and tests them using the evidence available. A f...
Svein Yngvar Willassen
CCS
2009
ACM
15 years 8 months ago
On voting machine design for verification and testability
We present an approach for the design and analysis of an electronic voting machine based on a novel combination of formal verification and systematic testing. The system was desig...
Cynthia Sturton, Susmit Jha, Sanjit A. Seshia, Dav...