696 search results - page 22 / 140 » Explaining abstract counterexamples |
135
Voted
ICSE
2005
IEEE-ACM
16 years 2 months ago
2005
IEEE-ACM
We present an automatic error-detection approach that combines static checking and concrete test-case generation. Our approach consists of taking the abstract error conditions inf...
170
Voted
CAV
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The use of Craig interpolants has enabled the development of powerful hardware and software model checking techniques. Efficient algorithms are known for computing interp...
CALCO
2005
Springer
15 years 8 months ago
2005
Springer
Scalars, Loops, and Free Traced and Strongly Compact Closed Categories Samson Abramsky Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, U.K. htt...
135
Voted
KBSE
1999
IEEE
15 years 6 months ago
1999
IEEE
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
127
Voted
FOGA
1994
15 years 3 months ago
1994
Holland's Schema Theorem is widely taken to be the foundation for explanations of the power of genetic algorithms (GAs). Yet some dissent has been expressed as to its implica...