Sciweavers

188 search results - page 11 / 38
» Back to the Complexity of Universal Programs
Sort
View
PLDI
2009
ACM
14 years 2 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
POPL
1994
ACM
13 years 11 months ago
Combinations of Abstract Domains for Logic Programming
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
Agostino Cortesi, Baudouin Le Charlier, Pascal Van...
JOT
2006
82views more  JOT 2006»
13 years 7 months ago
The Initium RJS Screensaver: Part 1, MS Windows
This paper describes a Java-based screensaver technology for the Initium Remote Job Submission (RJS) system running on Microsoft Windows. Initium RJS is a Java Web Start (JAWS) te...
Douglas A. Lyon
JOT
2006
73views more  JOT 2006»
13 years 7 months ago
The Initium RJS ScreenSaver: Part 2, UNIX
This paper describes a Java-based screensaver technology for the Initium Remote Job Submission (RJS) system running on UNIX XWindows. Initium RJS is a Java Web Start (JAWS) techno...
Douglas A. Lyon, Francisco Castellanos
ICSE
2008
IEEE-ACM
14 years 8 months ago
Predicting defects using network analysis on dependency graphs
In software development, resources for quality assurance are limited by time and by cost. In order to allocate resources effectively, managers need to rely on their experience bac...
Thomas Zimmermann, Nachiappan Nagappan