Sciweavers

74 search results - page 11 / 15
» Logic Programs with Functions and Default Values
Sort
View
CORR
2000
Springer
103views Education» more  CORR 2000»
13 years 6 months ago
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua S...
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
13 years 12 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 1 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
SIGSOFT
2004
ACM
14 years 7 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
BMCBI
2004
229views more  BMCBI 2004»
13 years 6 months ago
Automatic annotation of protein motif function with Gene Ontology terms
Background: Conserved protein sequence motifs are short stretches of amino acid sequence patterns that potentially encode the function of proteins. Several sequence pattern search...
Xinghua Lu, Chengxiang Zhai, Vanathi Gopalakrishna...