Sciweavers

144 search results - page 11 / 29
» Nondeterminism Analysis of Functional Logic Programs
Sort
View
LOPSTR
2004
Springer
14 years 3 months ago
On Termination of Binary CLP Programs
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...
Alexander Serebrenik, Frédéric Mesna...
AGP
1994
IEEE
14 years 1 months ago
A Compositional Semantics for Conditional Term Rewriting Systems
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
María Alpuente, Moreno Falaschi, Marí...
CORR
2000
Springer
103views Education» more  CORR 2000»
13 years 9 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...
IFIP
2009
Springer
14 years 4 months ago
Static Detection of Logic Flaws in Service-Oriented Applications
Application or business logic, used in the development of services, has to do with the operations that define the application functionalities and not with the platform ones. Often...
Chiara Bodei, Linda Brodo, Roberto Bruni
DAC
2002
ACM
14 years 10 months ago
Hole analysis for functional coverage data
One of the main goals of coverage tools is to provide the user with informative presentation of coverage information. Specifically, information on large, cohesive sets of uncovere...
Oded Lachish, Eitan Marcus, Shmuel Ur, Avi Ziv