Sciweavers

291 search results - page 27 / 59
» Generating Unit Tests from Formal Proofs
Sort
View
JSS
2002
101views more  JSS 2002»
14 years 11 months ago
Software requirements validation via task analysis
As a baseline for software development, a correct and complete requirements definition is one foundation of software quality. Previously, a novel approach to static testing of sof...
Hong Zhu, Lingzi Jin, Dan Diaper, Ganghong Bai
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
16 years 3 days ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
CASES
2007
ACM
15 years 3 months ago
SCCP/x: a compilation profile to support testing and verification of optimized code
Embedded systems are often used in safety-critical environments. Thus, thorough testing of them is mandatory. A quite active research area is the automatic test-case generation fo...
Raimund Kirner
ICFP
2012
ACM
13 years 2 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
PPPJ
2006
ACM
15 years 5 months ago
The Project Maxwell assembler system
The JavaTM programming language is primarily used for platform-independent programming. Yet it also offers many productivity, maintainability and performance benefits for platfo...
Bernd Mathiske, Douglas N. Simon, Dave Ungar