<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article"><front><journal-meta><journal-id journal-id-type="publisher-id">INFORMATICA</journal-id><journal-title-group><journal-title>Informatica</journal-title></journal-title-group><issn pub-type="epub">0868-4952</issn><issn pub-type="ppub">0868-4952</issn><publisher><publisher-name>VU</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">INF9103</article-id><article-id pub-id-type="doi">10.3233/INF-1998-9103</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>Data Dependence in Nested Loops in the Structural Blanks Approach to Programming with Recurrences<xref ref-type="fn" rid="fn1"><sup>✩</sup></xref></article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Čyras</surname><given-names>Vytautas</given-names></name><email xlink:href="mailto:Vytautas.Cyras@maf.vu.lt">Vytautas.Cyras@maf.vu.lt</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/><xref ref-type="aff" rid="j_INFORMATICA_aff_001"/></contrib><aff id="j_INFORMATICA_aff_000">Department of Informatics, Vilnius University, Naugarduko 24, 2600 Vilnius, Lithuania</aff><aff id="j_INFORMATICA_aff_001">Institute of Mathematics and Informatics, 2600 Vilnius, Akademijos 4, Lithuania</aff></contrib-group><author-notes><fn id="fn1"><label><sup>✩</sup></label><p>The research was supported in part by the Research Council of Norway under the Nordic–Baltic scholarship programme, and in part by the University of Bergen.</p></fn></author-notes><pub-date pub-type="epub"><day>01</day><month>01</month><year>1998</year></pub-date><volume>9</volume><issue>1</issue><fpage>21</fpage><lpage>50</lpage><history><date date-type="received"><day>01</day><month>01</month><year>1998</year></date></history><abstract><p>In this paper we examine data dependence in a nested loop programs which are obtained by inserting one loop program into another. This is viewed as the composition of structural modules (S-modules) in the structural blanks (SB) approach. SB is a method for expressing computations based on recurrence relations. It is built on top of traditional programming languages like Fortran or Pascal. SB aims at supporting the transformational development and reuse of program modules that have complex data dependence patterns and provides an architectural framework for software packages.</p></abstract><kwd-group><label>Keywords</label><kwd>recurrence relation</kwd><kwd>data dependence graph</kwd><kwd>composition of loop programs</kwd><kwd>data dependence in loops</kwd></kwd-group></article-meta></front></article>