Sciweavers

317 search results - page 53 / 64
» Deductive Program Repair
Sort
View
COGSCI
2004
148views more  COGSCI 2004»
13 years 10 months ago
Disfluencies, language comprehension, and Tree Adjoining Grammars
Disfluencies include editing terms such as uh and um as well as repeats and revisions. Little is known about how disfluencies are processed, and there has been next to no research...
Fernanda Ferreira, Ellen F. Lau, Karl G. D. Bailey
SIGUCCS
2006
ACM
14 years 4 months ago
Bridging the student support gap
In recent years, the use of a computer has become a requirement for success in a collegiate environment, and the demand for mobile computing has sharply increased. In response to ...
Gerald Bailey, Jamie Piperberg, Bud Hiller
ADC
1999
Springer
97views Database» more  ADC 1999»
14 years 3 months ago
Pseudo-Naive Evaluation
We introduce pseudo-naive evaluation, a method for execution of mixed top-down/bottom-up logic programs and deductive databases. The method is intermediate in power between naive ...
Donald A. Smith, Mark Utting
LPNMR
1990
Springer
14 years 2 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
POPL
2011
ACM
13 years 1 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu