Sciweavers

15 search results - page 2 / 3
» Learning programs from traces using version space algebra
Sort
View
NFM
2011
242views Formal Methods» more  NFM 2011»
13 years 6 days ago
Model Checking Using SMT and Theory of Lists
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
Aleksandar Milicevic, Hillel Kugler
HASKELL
2006
ACM
13 years 11 months ago
Statically typed linear algebra in Haskell
Many numerical algorithms are specified in terms of operations on vectors and matrices. Matrix operations can be executed extremely efficiently using specialized linear algebra k...
Frederik Eaton
ML
1998
ACM
117views Machine Learning» more  ML 1998»
13 years 4 months ago
Learning Team Strategies: Soccer Case Studies
We use simulated soccer to study multiagent learning. Each team's players (agents) share action set and policy, but may behave di erently due to position-dependent inputs. All...
Rafal Salustowicz, Marco Wiering, Jürgen Schm...
KBSE
2005
IEEE
13 years 10 months ago
Locating faulty code using failure-inducing chops
Software debugging is the process of locating and correcting faulty code. Prior techniques to locate faulty code either use program analysis techniques such as backward dynamic pr...
Neelam Gupta, Haifeng He, Xiangyu Zhang, Rajiv Gup...
PLDI
2010
ACM
13 years 10 months ago
Traceable data types for self-adjusting computation
Self-adjusting computation provides an evaluation model where computations can respond automatically to modifications to their data by using a mechanism for propagating modifica...
Umut A. Acar, Guy E. Blelloch, Ruy Ley-Wild, Kanat...