1001 search results - page 68 / 201 » Testing Formal Dialectic |
COCO
2005
Springer
14 years 2 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
VL
2003
IEEE
14 years 2 months ago
2003
IEEE
ct How can rigorous forms of testing be supported in a way that is both compatible with the visual aspect of visual programming languages, and usable by the audiences using those l...
ISSTA
1993
ACM
14 years 1 months ago
1993
ACM
Most of the effort that goes into improving the quality of software paradoxically does not lead to quantitative, measurable quality. Software developers and quality-assurance orga...
ICFEM
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In formal testing, the assumption of input enabling is typically made. This assumption requires all inputs to be enabled anytime. In addition, the useful concept of quies...
WSC
2004
13 years 10 months ago
2004
Traditional approaches to security evaluation have been based on penetration testing of real systems, or analysis of formal models of such systems. The former suffer from the prob...