Sciweavers

1710 search results - page 207 / 342
» High-Level Programs and Program Conditions
Sort
View
WFLP
2009
Springer
239views Algorithms» more  WFLP 2009»
15 years 11 months ago
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
Michael Leuschel, Salvador Tamarit, Germán ...
ISORC
2007
IEEE
15 years 11 months ago
Experiences from Applying WCET Analysis in Industrial Settings
Knowing the program timing characteristics is fundamental to the successful design and execution of real-time systems. Today, measurement-based timing analysis tools such as in-ci...
Jan Gustafsson, Andreas Ermedahl
TPHOL
2007
IEEE
15 years 11 months ago
Formalising Java's Data Race Free Guarantee
We formalise the data race free (DRF) guarantee provided by Java, as captured by the semi-formal Java Memory Model (JMM) [1] and published in the Java Language Specification [2]. ...
David Aspinall, Jaroslav Sevcík
ESOP
2007
Springer
15 years 11 months ago
Anti-pattern Matching
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. In a previous work, we hav...
Claude Kirchner, Radu Kopetz, Pierre-Etienne Morea...
ILP
2007
Springer
15 years 11 months ago
Relational Macros for Transfer in Reinforcement Learning
We describe an application of inductive logic programming to transfer learning. Transfer learning is the use of knowledge learned in a source task to improve learning in a related ...
Lisa Torrey, Jude W. Shavlik, Trevor Walker, Richa...