Sciweavers

172 search results - page 14 / 35
» Automatic Termination Analysis of Logic Programs
Sort
View
POPL
2012
ACM
13 years 5 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
SEFM
2005
IEEE
15 years 3 months ago
Precise Analysis of Memory Consumption using Program Logics
Memory consumption policies provide a means to control resource usage on constrained devices, and play an important role in ensuring the overall quality of software systems, and i...
Gilles Barthe, Mariela Pavlova, Gerardo Schneider
88
Voted
LOPSTR
2004
Springer
15 years 2 months ago
Determinacy Analysis for Logic Programs Using Mode and Type Information
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
Pedro López-García, Francisco Bueno,...
75
Voted
ICDAR
2009
IEEE
15 years 4 months ago
Inductive Logic Programming for Symbol Recognition
In this paper, we make an attempt to use Inductive Logic Programming (ILP) to automatically learn non trivial descriptions of symbols, based on a formal description. This work is ...
K. C. Santosh, Bart Lamiroy, Jean-Philippe Ropers
PLDI
2009
ACM
15 years 10 months ago
Automatic generation of library bindings using static analysis
High-level languages are growing in popularity. However, decades of C software development have produced large libraries of fast, timetested, meritorious code that are impractical...
Tristan Ravitch, Steve Jackson, Eric Aderhold, Ben...