Sciweavers

3090 search results - page 118 / 618
» On Testing Answer-Set Programs
Sort
View
ISSTA
2006
ACM
15 years 8 months ago
Path-oriented random testing
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
Arnaud Gotlieb, Matthieu Petit
81
Voted
AAAI
1994
15 years 3 months ago
CHATTERBOTS, TINYMUDS, and the Turing Test: Entering the Loebner Prize Competition
The Turing Test was proposed by Alan Turing in 1950; he called it the Imitation Game. In 1991 Hu Loebner prize competition, offering a f h Loebner started the 100,000 prize to the...
Michael L. Mauldin
ESORICS
2012
Springer
13 years 4 months ago
Boosting the Permissiveness of Dynamic Information-Flow Tracking by Testing
Tracking information flow in dynamic languages remains an open challenge. It might seem natural to address the challenge by runtime monitoring. However, there are well-known funda...
Arnar Birgisson, Daniel Hedin, Andrei Sabelfeld
CORR
2010
Springer
210views Education» more  CORR 2010»
15 years 2 months ago
Test Case Generation for Object-Oriented Imperative Languages in CLP
Testing is a vital part of the software development process. Test Case Generation (TCG) is the process of automatically generating a collection of test-cases which are applied to ...
Miguel Gómez-Zamalloa, Elvira Albert, Germ&...
LICS
2008
IEEE
15 years 8 months ago
Nonlocal Flow of Control and Kleene Algebra with Tests
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
Dexter Kozen