Sciweavers

1001 search results - page 71 / 201
» Testing Formal Dialectic
Sort
View
CHARME
2003
Springer
97views Hardware» more  CHARME 2003»
14 years 2 months ago
Convergence Testing in Term-Level Bounded Model Checking
We consider the problem of bounded model checking of systems expressed in a decidable fragment of first-order logic. While model checking is not guaranteed to terminate for an ar...
Randal E. Bryant, Shuvendu K. Lahiri, Sanjit A. Se...
CCS
2011
ACM
12 years 9 months ago
Trace equivalence decision: negative tests and non-determinism
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...
Vincent Cheval, Hubert Comon-Lundh, Stéphan...
SAC
2005
ACM
14 years 2 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
14 years 3 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»
14 years 4 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...