Sciweavers

192 search results - page 34 / 39
» Using Call Exit Analysis for Logic Program Transformation
Sort
View
POPL
2005
ACM
14 years 8 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
IPPS
2009
IEEE
14 years 2 months ago
Toward adjoinable MPI
4 Automatic differentiation is the primary means of obtaining analytic5 derivatives from a numerical model given as a computer program. There-6 fore, it is an essential productivi...
Jean Utke, Laurent Hascoët, Patrick Heimbach,...
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 7 months ago
Linear Tabling Strategies and Optimizations
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
Neng-Fa Zhou, Taisuke Sato, Yi-Dong Shen
CCS
2007
ACM
14 years 1 months ago
Multi-module vulnerability analysis of web-based applications
In recent years, web applications have become tremendously popular, and nowadays they are routinely used in security-critical environments, such as medical, financial, and milita...
Davide Balzarotti, Marco Cova, Viktoria Felmetsger...
DOCENG
2006
ACM
14 years 1 months ago
Comparing XML path expressions
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
Pierre Genevès, Nabil Layaïda