Sciweavers

15 search results - page 1 / 3
» Sorted Multi-adjoint Logic Programs: Termination Results and...
Sort
View
SAS
2005
Springer
118views Formal Methods» more  SAS 2005»
13 years 10 months ago
Inference of Well-Typings for Logic Programs with Application to Termination Analysis
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
Maurice Bruynooghe, John P. Gallagher, Wouter Van ...
ICLP
1994
Springer
13 years 8 months ago
Language Independence and Language Tolerance in Logic Programs
The consequences of a logic program depend in general upon both the rules of the program and its language. However the consequences of some programs are independent of the choice ...
Norman McCain, Hudson Turner
ICLP
1997
Springer
13 years 9 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
CADE
2011
Springer
12 years 4 months ago
Static Analysis of Android Programs
Android is a programming language based on Java and an operating system for embedded or mobile devices whose upper layers are written in that language. It features an extended even...
Étienne Payet, Fausto Spoto