Sciweavers

10 search results - page 1 / 2
» Inferring non-suspension conditions for logic programs with ...
Sort
View
79
Voted
TOCL
2008
75views more  TOCL 2008»
15 years 1 months ago
Inferring non-suspension conditions for logic programs with dynamic scheduling
Samir Genaim, Andy King
95
Voted
ESOP
2003
Springer
15 years 6 months ago
Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling
Abstract. A goal-independent suspension analysis is presented that infers a class of goals for which a logic program with delays can be executed without suspension. The crucial poi...
Samir Genaim, Andy King
125
Voted
TPLP
2002
90views more  TPLP 2002»
15 years 22 days ago
Properties of input-consuming derivations
We study the properties of input-consuming derivations of moded logic programs. Inputconsuming derivations can be used to model the behavior of logic programs using dynamic schedu...
Annalisa Bossi, Sandro Etalle, Sabina Rossi
124
Voted
ICSE
2010
IEEE-ACM
15 years 3 months ago
DETERMIN: inferring likely deterministic specifications of multithreaded programs
The trend towards multicore processors and graphic processing units is increasing the need for software that can take advantage of parallelism. Writing correct parallel programs u...
Jacob Burnim, Koushik Sen
162
Voted
ICDAR
2009
IEEE
14 years 11 months ago
Unconstrained Handwritten Document Layout Extraction Using 2D Conditional Random Fields
The paper describes a new approach using a Conditional Random Fields (CRFs) to extract physical and logical layouts in unconstrained handwritten letters such as those sent by indi...
Florent Montreuil, Emmanuele Grosicki, Laurent Heu...