Sciweavers

378 search results - page 54 / 76
» Higher-order transformation of logic programs
Sort
View
PLDI
2004
ACM
14 years 25 days ago
KISS: keep it simple and sequential
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
Shaz Qadeer, Dinghao Wu
JFLP
2002
81views more  JFLP 2002»
13 years 7 months ago
A Practical Partial Evaluation Scheme for Multi-Paradigm Declarative Languages
We present a practical partial evaluation scheme for multi-paradigm declarative languages combining features from functional, logic, and concurrent programming. In contrast to pre...
Elvira Albert, Michael Hanus, Germán Vidal
ICMLA
2007
13 years 8 months ago
Learning to evaluate conditional partial plans
In our research we study rational agents which learn how to choose the best conditional, partial plan in any situation. The agent uses an incomplete symbolic inference engine, emp...
Slawomir Nowaczyk, Jacek Malec
JAPLL
2010
124views more  JAPLL 2010»
13 years 5 months ago
Reasoning about XML with temporal logics and automata
We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of pr...
Leonid Libkin, Cristina Sirangelo
POPL
2010
ACM
14 years 4 months ago
Generating Compiler Optimizations from Proofs
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
Ross Tate, Michael Stepp, Sorin Lerner