Sciweavers

590 search results - page 34 / 118
» Non-Failure Analysis for Logic Programs
Sort
View
SAC
2008
ACM
13 years 7 months ago
Removing useless variables in cost analysis of Java bytecode
Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in o...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
PLDI
2004
ACM
14 years 1 months ago
KISS: keep it simple and sequential
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
Shaz Qadeer, Dinghao Wu
EUROCAST
1994
Springer
139views Hardware» more  EUROCAST 1994»
13 years 11 months ago
Illustrating Constraint Programming Systems in Logistic Planning
Logistic systems analysts use a wide array of modeling systems such as algebraic and logic programs. Two simple examples show how they mesh as Constraint Logic programs, emphasizin...
Jean-Michel Thizy
VMCAI
2010
Springer
14 years 4 months ago
Shape Analysis with Reference Set Relations
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
Mark Marron, Rupak Majumdar, Darko Stefanovic, Dee...
ICFP
2009
ACM
14 years 8 months ago
Non-parametric parametricity
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
Georg Neis, Derek Dreyer, Andreas Rossberg