Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Boucle programme")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 275

  • Page / 11
Export

Selection :

  • and

Loop formulas for disjunctive logic programsLEE, Joohyung; LIFSCHITZ, Vladimir.Lecture notes in computer science. 2003, pp 451-465, issn 0302-9743, isbn 3-540-20642-6, 15 p.Conference Paper

Provably secure data hiding and tamper resistance for a simple loop programBAZZI, Rida A; CANDAN, K. Selcuk; BADIN, Raphael et al.SPIE proceedings series. 2003, pp 517-527, isbn 0-8194-4930-X, 11 p.Conference Paper

Forced termination of loopsDROMEY, R. G.Software, practice & experience. 1985, Vol 15, Num 1, pp 29-39, issn 0038-0644Article

Interprocedural transformations for extracting maximum parallelismCHANG, Yu-Sug; LEE, Hye-Jung; PARK, Doo-Soon et al.Lecture notes in computer science. 2002, pp 415-424, issn 0302-9743, isbn 3-540-00009-7, 10 p.Conference Paper

A note on the complexity of program evaluationIBARRA, O. H; LENINGER, B. S; ROSIER, L. E et al.Mathematical systems theory. 1984, Vol 17, Num 2, pp 85-96, issn 0025-5661Article

A heuristic for deriving loop functionsDUNLOP, D. D; BASILI, V. R.IEEE transactions on software engineering. 1984, Vol 10, Num 3, pp 275-285, issn 0098-5589Article

Analisi automatica di reti di livellazione = Analyse automatique des réseaux de nivellement = Computer analysis of levelling netsBARBARELLA, M.Bollettino di geodesia e scienze affini. 1983, Vol 42, Num 4, pp 353-376, issn 0006-6710Article

On the stability semantics of combinational programsVAN DUNG, Tran.Lecture notes in computer science. 2005, pp 180-194, issn 0302-9743, isbn 3-540-29107-5, 1Vol, 15 p.Conference Paper

A technique for developing loop invariantsREMMERS, J. H.Information processing letters. 1984, Vol 18, Num 3, pp 137-139, issn 0020-0190Article

Loop cleaningKASYANOV, V. N.Information processing letters. 1984, Vol 18, Num 1, pp 1-6, issn 0020-0190Article

Loops in combinator-based compilersWAND, M.Information and control. 1983, Vol 57, Num 2-3, pp 148-164, issn 0019-9958Article

Strongest invariant functions; their use in the systematic analysis of while statementsMILI, A; DESHARNAIS, J; GAGNE, J.-P et al.Acta informatica. 1985, Vol 22, Num 1, pp 47-66, issn 0001-5903Article

Varieties of weakest liberal preconditionsMORRIS, J. M.Information processing letters. 1987, Vol 25, Num 3, pp 207-210, issn 0020-0190Article

Well-founded induction and the invariance theorem for loopsMORRIS, J. M.Information processing letters. 1989, Vol 32, Num 3, pp 155-158, issn 0020-0190Article

Data dependence profiling for speculative optimizationsCHEN, Tong; LIN, Jin; DAI, Xiaoru et al.Lecture notes in computer science. 2004, pp 57-72, issn 0302-9743, isbn 3-540-21297-3, 16 p.Conference Paper

Dynamic processor self-scheduling for general parallel nested loopsZHIXI FANG; PEIYI TANG; PEN-CHUNG YEW et al.IEEE transactions on computers. 1990, Vol 39, Num 7, pp 919-929, issn 0018-9340, 11 p.Article

Loop-dead optimizationSHAW, Sachin; KUMAR, Pawan.ACM SIGPLAN notices. 2005, Vol 40, Num 2, pp 33-40, issn 1523-2867, 8 p.Article

Loop squashing transformations for amorphous slicingLIN HU; HARMAN, Mark; HIERONS, Robert M et al.Working conference on reverse engineering. 2004, pp 152-160, isbn 0-7695-2243-2, 1Vol, 9 p.Conference Paper

Using loops in genetic programming for a twc class binary image classification problemXIANG LI; CIESIELSKI, Vic.Lecture notes in computer science. 2004, pp 898-909, issn 0302-9743, isbn 3-540-24059-4, 12 p.Conference Paper

Minimizing register requirements of a modulo schedule via optimum stage schedulingEICHENBERGER, A. E; DAVIDSON, E. S; ABRAHAM, S. G et al.International journal of parallel programming. 1996, Vol 24, Num 2, pp 103-132, issn 0885-7458Article

Performance-oriented synchronisation migration in a DOACROSS loopHWANG, R.-Y.IEE proceedings. Computers and digital techniques. 1996, Vol 143, Num 4, pp 224-231, issn 1350-2387Article

Compiler algorithms for synchronizationMIDKIFF, S. P; PADUA, D. A.IEEE transactions on computers. 1987, Vol 36, Num 12, pp 1485-1495, issn 0018-9340Article

On simple programs with primitive conditional statementsIBARRA, O. H; ROSIER, L. E.Information and control. 1985, Vol 65, Num 1, pp 42-62, issn 0019-9958Article

Periodic polyhedraMEISTER, Benoit.Lecture notes in computer science. 2004, pp 134-149, issn 0302-9743, isbn 3-540-21297-3, 16 p.Conference Paper

Automatic loop transformations and parallelization for JavaARTIGAS, Pedro V; GUPTA, Manish; MIKIFF, Samuel P et al.Parallel processing letters. 2000, Vol 10, Num 2-3, pp 153-164, issn 0129-6264Conference Paper

  • Page / 11