Sciweavers

557 search results - page 63 / 112
» Useful Transformations in Answer set programming
Sort
View
ICFEM
2009
Springer
13 years 5 months ago
Implementing a Direct Method for Certificate Translation
Abstract. Certificate translation is a method that transforms certificates of source programs into certificates of their compilation. It provides strong guarantees on low-level cod...
Gilles Barthe, Benjamin Grégoire, Sylvain H...
IWMM
2007
Springer
85views Hardware» more  IWMM 2007»
14 years 2 months ago
Uniqueness inference for compile-time object deallocation
This paper presents an analysis and transformation for individual object reclamation in Java programs. First, we propose a uniqueness inference algorithm that identifies variable...
Sigmund Cherem, Radu Rugina
ICALP
1995
Springer
13 years 11 months ago
Weakly Useful Sequences
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) w...
Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo
CORR
2010
Springer
100views Education» more  CORR 2010»
13 years 8 months ago
Products of Weighted Logic Programs
Abstract. Weighted logic programming, a generalization of bottom-up logic programming, is a successful framework for specifying dynamic programming algorithms. In this setting, pro...
Shay B. Cohen, Robert J. Simmons, Noah A. Smith
ASE
1998
81views more  ASE 1998»
13 years 7 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang