Sciweavers

6800 search results - page 267 / 1360
» Testing with Functions as Specifications
Sort
View
135
Voted
ICSE
2009
IEEE-ACM
16 years 7 months ago
Equality and hashing for (almost) free: Generating implementations from abstraction functions
ng Implementations from Abstraction Functions Derek Rayside, Zev Benjamin, Rishabh Singh, Joseph P. Near, Aleksandar Milicevic and Daniel Jackson Computer Science and Artificial In...
Derek Rayside, Zev Benjamin, Rishabh Singh, Joseph...
STOC
2001
ACM
119views Algorithms» more  STOC 2001»
16 years 6 months ago
Private approximation of NP-hard functions
d Abstract] Shai Halevi Robert Krauthgamer Eyal Kushilevitz Kobbi Nissim ? The notion of private approximation was introduced recently by Feigenbaum, Fong, Strauss and Wright. Inf...
Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz,...
230
Voted
AAIP
2009
15 years 7 months ago
Automated Method Induction: Functional Goes Object Oriented
The development of software engineering has had a great deal of benefits for the development of software. Along with it came a whole new paradigm of the way software is designed a...
Thomas Hieber, Martin Hofmann 0008
CORR
2010
Springer
170views Education» more  CORR 2010»
15 years 6 months ago
Global Optimization for Value Function Approximation
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...
Marek Petrik, Shlomo Zilberstein
LISP
2008
96views more  LISP 2008»
15 years 6 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal