Sciweavers

1204 search results - page 80 / 241
» Termination of Polynomial Programs
Sort
View
86
Voted
ENTCS
2007
111views more  ENTCS 2007»
15 years 18 days ago
Extra Variables Can Be Eliminated from Functional Logic Programs
Programs in modern functional logic languages are rewrite systems following the constructor discipline but where confluence and termination are not required, thus defining possi...
Javier de Dios Castro, Francisco Javier Lóp...
PPOPP
2011
ACM
14 years 3 months ago
Programming the memory hierarchy revisited: supporting irregular parallelism in sequoia
We describe two novel constructs for programming parallel machines with multi-level memory hierarchies: call-up, which allows a child task to invoke computation on its parent, and...
Michael Bauer, John Clark, Eric Schkufza, Alex Aik...
APSEC
2008
IEEE
15 years 7 months ago
Correctness of Request Executions in Online Updates of Concurrent Object Oriented Programs
Online update is a technique that reduces the disruption caused by a software update. It does so by applying a patch to a running process as opposed to shutting down the process a...
Yogesh Murarka, Umesh Bellur
125
Voted
FIDJI
2003
Springer
15 years 5 months ago
Model Generation for Distributed Java Programs
— We present techniques for analyzing the source code of distributed Java applications, and building finite models of their behaviour. The models are labelled transition systems...
Rabéa Boulifa, Eric Madelaine
AAAI
2006
15 years 2 months ago
Focused Real-Time Dynamic Programming for MDPs: Squeezing More Out of a Heuristic
Real-time dynamic programming (RTDP) is a heuristic search algorithm for solving MDPs. We present a modified algorithm called Focused RTDP with several improvements. While RTDP ma...
Trey Smith, Reid G. Simmons