Sciweavers

336 search results - page 57 / 68
» Program Speedups in Theory and Practice
Sort
View
PASTE
2005
ACM
14 years 29 days ago
Generalizing symbolic execution to library classes
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have foc...
Sarfraz Khurshid, Yuk Lai Suen
FOCS
2009
IEEE
14 years 2 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
TLCA
2005
Springer
14 years 27 days ago
Recursive Functions with Higher Order Domains
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...
Ana Bove, Venanzio Capretta
INFOCOM
2010
IEEE
13 years 5 months ago
Reliable Wireless Broadcasting with Near-Zero Feedback
We examine the problem of minimizing feedbacks in reliable wireless broadcasting, by pairing rateless coding with extreme value theory. Our key observation is that, in a broadcast ...
Weiyao Xiao, Sachin Agarwal, David Starobinski, Ar...
ATAL
2007
Springer
14 years 1 months ago
Goals in the context of BDI plan failure and planning
We develop a Belief-Desire-Intention (BDI) style agent-oriented programming language with special emphasis on the semantics of goals in the presence of the typical BDI failure han...
Sebastian Sardiña, Lin Padgham