589 search results - page 64 / 118 » Automated test generation for engineering applications |
POPL
2009
ACM
14 years 8 months ago
2009
ACM
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...
EDO
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This paper presents a framework that lets a component developer provide a component user with different kinds of information, depending on the specific context and needs....
ICSE
2008
IEEE-ACM
14 years 8 months ago
2008
IEEE-ACM
Mutants are automatically-generated, possibly faulty variants of programs. The mutation adequacy ratio of a test suite is the ratio of non-equivalent mutants it is able to identif...
VLDB
1998
ACM
13 years 12 months ago
1998
ACM
Deterministic testing of SQL database systems is human intensive and cannot adequately cover the SQL input domain. A system (RAGS), was built to stochastically generate valid SQL ...
DATE
2000
IEEE
14 years 4 days ago
2000
IEEE
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...