[{"data":1,"prerenderedAt":1090},["ShallowReactive",2],{"global-navigation":3,"page-\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fmiscellaneous-msc\u002Fmsc01-f":31,"surround-\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fmiscellaneous-msc\u002Fmsc01-f":903,"sidebar-sei-cert-fortran-coding-standard":912},[4,8],{"title":5,"path":6,"_path":6,"fromAppConfig":7},"Home","\u002F",true,{"title":9,"path":10,"children":11,"_path":30,"fromAppConfig":7},"Coding Standards","\u002Fcoding-standards\u002F",[12,15,18,21,24,27],{"title":13,"path":14},"Android Coding Standard","\u002Fandroid-secure-coding-standard\u002F",{"title":16,"path":17},"C Coding Standard","\u002Fsei-cert-c-coding-standard\u002F",{"title":19,"path":20},"C++ Coding Standard","\u002Fsei-cert-cpp-coding-standard\u002F",{"title":22,"path":23},"Fortran Coding Standard","\u002Fsei-cert-fortran-coding-standard\u002F",{"title":25,"path":26},"Java Coding Standard","\u002Fsei-cert-oracle-coding-standard-for-java\u002F",{"title":28,"path":29},"Perl Coding Standard","\u002Fsei-cert-perl-coding-standard\u002F","\u002Fcoding-standards",{"id":32,"title":33,"body":34,"description":44,"extension":897,"meta":898,"navigation":7,"path":899,"seo":900,"stem":901,"__hash__":902},"content\u002F9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F12.miscellaneous-msc\u002F2.msc01-f.md","MSC01-F. Avoid using legacy or obsolescent Fortran constructs",{"type":35,"value":36,"toc":886},"minimark",[37,41,45,48,78,81,86,89,155,159,162,269,274,280,402,406,412,470,473,476,566,569,576,726,730,745,808,811,815,826,848,852,882],[38,39,33],"h1",{"id":40},"msc01-f-avoid-using-legacy-or-obsolescent-fortran-constructs",[42,43,44],"p",{},"Programmers shall avoid using features identified as \"deleted\" or \"obsolescent\" by the Fortran standard, as well as legacy constructs that reduce clarity, maintainability, or compiler optimization potential.",[42,46,47],{},"Modern Fortran standard classifies legacy features into two categories:",[49,50,51,64],"ol",{},[52,53,54,55,59,60,63],"li",{},"Deleted features: Redundant or removed constructs that are no longer standard-conforming (e.g., ",[56,57,58],"code",{},"PAUSE"," , ",[56,61,62],{},"ASSIGN"," ).",[52,65,66,67,70,71,74,75,63],{},"Obsolescent features: Redundant constructs for which safer or clearer alternatives exist (e.g., ",[56,68,69],{},"COMMON"," blocks, ",[56,72,73],{},"EQUIVALENCE"," , arithmetic ",[56,76,77],{},"IF",[42,79,80],{},"Relying on these features increases the risk of errors, reduces portability, and can inhibit compiler optimizations.",[82,83,85],"h3",{"id":84},"deleted-features","Deleted Features",[42,87,88],{},"These constructs are no longer part of the Fortran standard and are not permitted in strictly conforming modern code:",[90,91,92,109,115,124,129,135,141,148],"ul",{},[52,93,94,95,98,99,101,102,105,106,63],{},"Non-block ",[56,96,97],{},"DO"," loops (implicit ",[56,100,97],{}," without ",[56,103,104],{},"END DO"," or ",[56,107,108],{},"CONTINUE",[52,110,111,112,114],{},"Arithmetic ",[56,113,77],{}," .",[52,116,117,119,120,123],{},[56,118,62],{}," and assigned ",[56,121,122],{},"GO TO"," statements.",[52,125,126,128],{},[56,127,58],{}," statement.",[52,130,131,134],{},[56,132,133],{},"H"," edit descriptor.",[52,136,137,138,140],{},"Real and double precision ",[56,139,97],{}," loop control variables.",[52,142,143,144,147],{},"Branching to ",[56,145,146],{},"END IF"," from outside its block.",[52,149,150,151,154],{},"Assigned ",[56,152,153],{},"FORMAT"," specifier.",[82,156,158],{"id":157},"obsolescent-features","Obsolescent Features",[42,160,161],{},"These constructs are still supported by many compilers for backward compatibility, but are considered outdated and should be replaced with modern alternatives:",[90,163,164,185,199,216,235],{},[52,165,166,167],{},"Control flow\n",[90,168,169,176,182],{},[52,170,171,172,175],{},"Alternate return ( ",[56,173,174],{},"CALL sub(arg, 10, 20, ...)"," with numerical labels embedded).",[52,177,178,179,123],{},"Computed ",[56,180,181],{},"GOTO",[52,183,184],{},"Statement functions.",[52,186,187,188],{},"Data and data sharing\n",[90,189,190,195],{},[52,191,192,194],{},[56,193,69],{}," blocks.",[52,196,197,123],{},[56,198,73],{},[52,200,201,202],{},"Program structure\n",[90,203,204,210],{},[52,205,206,209],{},[56,207,208],{},"ENTRY"," statement for multiple entry points.",[52,211,212,215],{},[56,213,214],{},"BLOCK DATA"," program units.",[52,217,218,219],{},"Looping and branching\n",[90,220,221,229],{},[52,222,223,224,226,227,63],{},"Labeled ",[56,225,97],{}," loops (using numeric labels instead of structured ",[56,228,104],{},[52,230,231,234],{},[56,232,233],{},"FORALL"," construct and statement.",[52,236,237,238],{},"Legacy syntax and definitions\n",[90,239,240,250,256,259,262],{},[52,241,242,243,246,247,63],{},"Specific names for intrinsic procedures that duplicate generic functionality (e.g., ",[56,244,245],{},"DSIN"," vs ",[56,248,249],{},"SIN",[52,251,252,255],{},[56,253,254],{},"DATA"," statements interspersed within executable code (considered obsolescent; use initialization in declarations instead).",[52,257,258],{},"Assumed-length character functions (deprecated approach; prefer explicit length or modern procedures).",[52,260,261],{},"Fixed source form (classic column-based formatting).",[52,263,264,265,268],{},"The ",[56,266,267],{},"CHARACTER*length"," declaration syntax.",[270,271,273],"h2",{"id":272},"noncompliant-code-example","Noncompliant Code Example",[42,275,276,277,279],{},"In this noncompliant example, the arithmetic ",[56,278,77],{}," statement branches to one of three labels depending on whether an expression is negative, zero, or positive. This construct, common in early Fortran, obscures the control flow and makes the code difficult to read and maintain.",[281,282,284],"code-block",{"quality":283},"bad",[285,286,291],"pre",{"className":287,"code":288,"language":289,"meta":290,"style":290},"language-fortran shiki shiki-themes github-light-high-contrast github-dark-high-contrast monokai","program arithmetic_if\n  implicit none\n  integer :: i, x(10)\n    \n  i = 1\n  ! Noncompliant: Labeled loop with Arithmetic IF\n10 continue\n  x(i) = i * 10\n  i = i + 1\n  if (i - 11) 10, 20, 30\n\n20 continue\n  print *, \"Final X:\", x\n  stop\n\n30 continue\n  print *, \"Error: out of bounds\"\nend program arithmetic_if\n","fortran","",[56,292,293,301,307,313,319,325,331,337,343,349,355,361,367,373,379,384,390,396],{"__ignoreMap":290},[294,295,298],"span",{"class":296,"line":297},"line",1,[294,299,300],{},"program arithmetic_if\n",[294,302,304],{"class":296,"line":303},2,[294,305,306],{},"  implicit none\n",[294,308,310],{"class":296,"line":309},3,[294,311,312],{},"  integer :: i, x(10)\n",[294,314,316],{"class":296,"line":315},4,[294,317,318],{},"    \n",[294,320,322],{"class":296,"line":321},5,[294,323,324],{},"  i = 1\n",[294,326,328],{"class":296,"line":327},6,[294,329,330],{},"  ! Noncompliant: Labeled loop with Arithmetic IF\n",[294,332,334],{"class":296,"line":333},7,[294,335,336],{},"10 continue\n",[294,338,340],{"class":296,"line":339},8,[294,341,342],{},"  x(i) = i * 10\n",[294,344,346],{"class":296,"line":345},9,[294,347,348],{},"  i = i + 1\n",[294,350,352],{"class":296,"line":351},10,[294,353,354],{},"  if (i - 11) 10, 20, 30\n",[294,356,358],{"class":296,"line":357},11,[294,359,360],{"emptyLinePlaceholder":7},"\n",[294,362,364],{"class":296,"line":363},12,[294,365,366],{},"20 continue\n",[294,368,370],{"class":296,"line":369},13,[294,371,372],{},"  print *, \"Final X:\", x\n",[294,374,376],{"class":296,"line":375},14,[294,377,378],{},"  stop\n",[294,380,382],{"class":296,"line":381},15,[294,383,360],{"emptyLinePlaceholder":7},[294,385,387],{"class":296,"line":386},16,[294,388,389],{},"30 continue\n",[294,391,393],{"class":296,"line":392},17,[294,394,395],{},"  print *, \"Error: out of bounds\"\n",[294,397,399],{"class":296,"line":398},18,[294,400,401],{},"end program arithmetic_if\n",[270,403,405],{"id":404},"compliant-solution","Compliant Solution",[42,407,408,409,411],{},"In the compliant solution, the code shows a ",[56,410,97],{}," loop accessing an array strictly within its declared limits. The loop iteration space matches the array bounds, ensuring no out-of-range subscript occurs and preserving defined program behavior.",[281,413,415],{"quality":414},"good",[285,416,418],{"className":287,"code":417,"language":289,"meta":290,"style":290},"program compliant_without_arithmetic_if\n  implicit none\n  integer :: i, x(10)\n\n  ! Compliant: Modern DO loop with block IF logic implicit in bounds\n  do i = 1, 10\n    x(i) = i * 10\n  end do\n\n  print *, \"Final X:\", x\nend program compliant_without_arithmetic_if\n",[56,419,420,425,429,433,437,442,447,452,457,461,465],{"__ignoreMap":290},[294,421,422],{"class":296,"line":297},[294,423,424],{},"program compliant_without_arithmetic_if\n",[294,426,427],{"class":296,"line":303},[294,428,306],{},[294,430,431],{"class":296,"line":309},[294,432,312],{},[294,434,435],{"class":296,"line":315},[294,436,360],{"emptyLinePlaceholder":7},[294,438,439],{"class":296,"line":321},[294,440,441],{},"  ! Compliant: Modern DO loop with block IF logic implicit in bounds\n",[294,443,444],{"class":296,"line":327},[294,445,446],{},"  do i = 1, 10\n",[294,448,449],{"class":296,"line":333},[294,450,451],{},"    x(i) = i * 10\n",[294,453,454],{"class":296,"line":339},[294,455,456],{},"  end do\n",[294,458,459],{"class":296,"line":345},[294,460,360],{"emptyLinePlaceholder":7},[294,462,463],{"class":296,"line":351},[294,464,372],{},[294,466,467],{"class":296,"line":357},[294,468,469],{},"end program compliant_without_arithmetic_if\n",[270,471,273],{"id":472},"noncompliant-code-example-1",[42,474,475],{},"In this noncompliant example, alternative returns allow a subroutine to control the execution flow of the calling program by branching to labels passed as arguments. This is an obsolete feature that results in unstructured control flow.",[281,477,478],{"quality":283},[285,479,481],{"className":287,"code":480,"language":289,"meta":290,"style":290},"subroutine check_status(val, *, *)\n  integer, intent(in) :: val\n  if (val \u003C 0) return 1\n  if (val == 0) return 2\nend subroutine check_status\n\nprogram alternative_return\n    integer :: v = -1\n    ! Noncompliant: Passing labels (*10, *20) as arguments\n    call check_status(v, *10, *20)\n    print *, \"Positive\"\n    goto 30\n10  print * , \"Negative\"\n    goto 30\n20  print *, \"Zero\"\n30  continue\nend program alternative_return\n",[56,482,483,488,493,498,503,508,512,517,522,527,532,537,542,547,551,556,561],{"__ignoreMap":290},[294,484,485],{"class":296,"line":297},[294,486,487],{},"subroutine check_status(val, *, *)\n",[294,489,490],{"class":296,"line":303},[294,491,492],{},"  integer, intent(in) :: val\n",[294,494,495],{"class":296,"line":309},[294,496,497],{},"  if (val \u003C 0) return 1\n",[294,499,500],{"class":296,"line":315},[294,501,502],{},"  if (val == 0) return 2\n",[294,504,505],{"class":296,"line":321},[294,506,507],{},"end subroutine check_status\n",[294,509,510],{"class":296,"line":327},[294,511,360],{"emptyLinePlaceholder":7},[294,513,514],{"class":296,"line":333},[294,515,516],{},"program alternative_return\n",[294,518,519],{"class":296,"line":339},[294,520,521],{},"    integer :: v = -1\n",[294,523,524],{"class":296,"line":345},[294,525,526],{},"    ! Noncompliant: Passing labels (*10, *20) as arguments\n",[294,528,529],{"class":296,"line":351},[294,530,531],{},"    call check_status(v, *10, *20)\n",[294,533,534],{"class":296,"line":357},[294,535,536],{},"    print *, \"Positive\"\n",[294,538,539],{"class":296,"line":363},[294,540,541],{},"    goto 30\n",[294,543,544],{"class":296,"line":369},[294,545,546],{},"10  print * , \"Negative\"\n",[294,548,549],{"class":296,"line":375},[294,550,541],{},[294,552,553],{"class":296,"line":381},[294,554,555],{},"20  print *, \"Zero\"\n",[294,557,558],{"class":296,"line":386},[294,559,560],{},"30  continue\n",[294,562,563],{"class":296,"line":392},[294,564,565],{},"end program alternative_return\n",[270,567,405],{"id":568},"compliant-solution-1",[42,570,571,572,575],{},"In the compliant solution, the code returns an integer status code, and the calling program uses a ",[56,573,574],{},"SELECT CASE"," construct to handle control flow. This decouples the subroutine from the caller's line numbers and keeps the control flow logic within the caller.",[281,577,578],{"quality":414},[285,579,581],{"className":287,"code":580,"language":289,"meta":290,"style":290},"subroutine check_status(val, status)\n  integer, intent(in) :: val\n  integer, intent(out) :: status\n\n  if (val \u003C 0) then\n    status = 1\n  else if (val == 0) then\n    status = 2 \n  else\n    status = 0\n end if\nend subroutine check_status\n\nprogram compliant_without_alternative_return\n  integer :: v = -1, code\n\n  call check_status(v, code)\n\n  ! Compliant: Structured handling of return status\n  select case (code)\n  case (1)\n    print *, \"Negative\"\n  case (2)\n    print *, \"Zero\"\n  case default\n    print *, \"Positive\"\n  end select\nend program compliant_without_alternative_return\n",[56,582,583,588,592,597,601,606,611,616,621,626,631,636,640,644,649,654,658,663,667,673,679,685,691,697,703,709,714,720],{"__ignoreMap":290},[294,584,585],{"class":296,"line":297},[294,586,587],{},"subroutine check_status(val, status)\n",[294,589,590],{"class":296,"line":303},[294,591,492],{},[294,593,594],{"class":296,"line":309},[294,595,596],{},"  integer, intent(out) :: status\n",[294,598,599],{"class":296,"line":315},[294,600,360],{"emptyLinePlaceholder":7},[294,602,603],{"class":296,"line":321},[294,604,605],{},"  if (val \u003C 0) then\n",[294,607,608],{"class":296,"line":327},[294,609,610],{},"    status = 1\n",[294,612,613],{"class":296,"line":333},[294,614,615],{},"  else if (val == 0) then\n",[294,617,618],{"class":296,"line":339},[294,619,620],{},"    status = 2 \n",[294,622,623],{"class":296,"line":345},[294,624,625],{},"  else\n",[294,627,628],{"class":296,"line":351},[294,629,630],{},"    status = 0\n",[294,632,633],{"class":296,"line":357},[294,634,635],{}," end if\n",[294,637,638],{"class":296,"line":363},[294,639,507],{},[294,641,642],{"class":296,"line":369},[294,643,360],{"emptyLinePlaceholder":7},[294,645,646],{"class":296,"line":375},[294,647,648],{},"program compliant_without_alternative_return\n",[294,650,651],{"class":296,"line":381},[294,652,653],{},"  integer :: v = -1, code\n",[294,655,656],{"class":296,"line":386},[294,657,360],{"emptyLinePlaceholder":7},[294,659,660],{"class":296,"line":392},[294,661,662],{},"  call check_status(v, code)\n",[294,664,665],{"class":296,"line":398},[294,666,360],{"emptyLinePlaceholder":7},[294,668,670],{"class":296,"line":669},19,[294,671,672],{},"  ! Compliant: Structured handling of return status\n",[294,674,676],{"class":296,"line":675},20,[294,677,678],{},"  select case (code)\n",[294,680,682],{"class":296,"line":681},21,[294,683,684],{},"  case (1)\n",[294,686,688],{"class":296,"line":687},22,[294,689,690],{},"    print *, \"Negative\"\n",[294,692,694],{"class":296,"line":693},23,[294,695,696],{},"  case (2)\n",[294,698,700],{"class":296,"line":699},24,[294,701,702],{},"    print *, \"Zero\"\n",[294,704,706],{"class":296,"line":705},25,[294,707,708],{},"  case default\n",[294,710,712],{"class":296,"line":711},26,[294,713,536],{},[294,715,717],{"class":296,"line":716},27,[294,718,719],{},"  end select\n",[294,721,723],{"class":296,"line":722},28,[294,724,725],{},"end program compliant_without_alternative_return\n",[270,727,729],{"id":728},"risk-assessment","Risk Assessment",[42,731,732,733,736,737,739,740,74,742,744],{},"Legacy constructs often rely on implicit behaviors (like storage association in ",[56,734,735],{},"EQUIVALENTE"," and ",[56,738,69],{}," ) or unstructured jumps (like ",[56,741,122],{},[56,743,77],{}," ). These features prevent modern compilers from performing rigorous type checking, vectorization, and parallelization. They also significantly increase the cognitive load required to maintain the code.",[746,747,748,776],"table",{},[749,750,751],"thead",{},[752,753,754,758,761,764,767,770,773],"tr",{},[755,756,757],"th",{},"Rule",[755,759,760],{},"Severity",[755,762,763],{},"Likelihood",[755,765,766],{},"Detectable",[755,768,769],{},"Repairable",[755,771,772],{},"Priority",[755,774,775],{},"Level",[777,778,779],"tbody",{},[752,780,781,785,788,791,794,797,803],{},[782,783,784],"td",{},"MSC01-F",[782,786,787],{},"Medium",[782,789,790],{},"likely",[782,792,793],{},"Yes",[782,795,796],{},"No",[782,798,799],{},[800,801,802],"strong",{},"P12",[782,804,805],{},[800,806,807],{},"L1",[809,810],"hr",{},[270,812,814],{"id":813},"bibliography","Bibliography",[42,816,817,818,825],{},"[ ",[819,820,824],"a",{"href":821,"rel":822},"https:\u002F\u002Fwww.intel.com\u002Fcontent\u002Fwww\u002Fus\u002Fen\u002Fdocs\u002Ffortran-compiler\u002Fdeveloper-guide-reference\u002F2025-3\u002Fdeleted-and-obsolescent-language-features.html",[823],"nofollow","Intel Fortran Compiler"," ]",[42,827,828,835,836,835,842],{},[819,829,831],{"href":830},"\u002Fsei-cert-c-coding-standard\u002Frules\u002Fpreprocessor-pre\u002Fpre30-c",[832,833],"img",{"src":834},"attachments\u002F629047320\u002F638779631.png"," ",[819,837,839],{"href":838},"\u002Fsei-cert-c-coding-standard\u002Frules\u002Fpreprocessor-pre\u002F",[832,840],{"src":841},"attachments\u002F629047320\u002F638779632.png",[819,843,845],{"href":844},"\u002Fsei-cert-fortran-coding-standard\u002Ftypes-typ\u002Ftyp01-f",[832,846],{"src":847},"attachments\u002F629047320\u002F638779633.png",[270,849,851],{"id":850},"attachments","Attachments:",[853,854,858],"div",{"className":855,"align":857},[856],"greybox","left",[42,859,860,835,863,866,867,870,835,872,866,875,877,835,879,866],{},[832,861],{"alt":290,"src":862},"images\u002Ficons\u002Fbullet_blue.gif",[819,864,865],{"href":834},"button_arrow_left.png"," (image\u002Fpng)",[868,869],"br",{},[832,871],{"alt":290,"src":862},[819,873,874],{"href":841},"button_arrow_up.png",[868,876],{},[832,878],{"alt":290,"src":862},[819,880,881],{"href":847},"button_arrow_right.png",[883,884,885],"style",{},"html .default .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}html .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}html .dark .shiki span {color: var(--shiki-dark);background: var(--shiki-dark-bg);font-style: var(--shiki-dark-font-style);font-weight: var(--shiki-dark-font-weight);text-decoration: var(--shiki-dark-text-decoration);}html.dark .shiki span {color: var(--shiki-dark);background: var(--shiki-dark-bg);font-style: var(--shiki-dark-font-style);font-weight: var(--shiki-dark-font-weight);text-decoration: var(--shiki-dark-text-decoration);}html .sepia .shiki span {color: var(--shiki-sepia);background: var(--shiki-sepia-bg);font-style: var(--shiki-sepia-font-style);font-weight: var(--shiki-sepia-font-weight);text-decoration: var(--shiki-sepia-text-decoration);}html.sepia .shiki span {color: var(--shiki-sepia);background: var(--shiki-sepia-bg);font-style: var(--shiki-sepia-font-style);font-weight: var(--shiki-sepia-font-weight);text-decoration: var(--shiki-sepia-text-decoration);}",{"title":290,"searchDepth":303,"depth":303,"links":887},[888,889,890,891,892,893,894,895,896],{"id":84,"depth":309,"text":85},{"id":157,"depth":309,"text":158},{"id":272,"depth":303,"text":273},{"id":404,"depth":303,"text":405},{"id":472,"depth":303,"text":273},{"id":568,"depth":303,"text":405},{"id":728,"depth":303,"text":729},{"id":813,"depth":303,"text":814},{"id":850,"depth":303,"text":851},"md",{},"\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fmiscellaneous-msc\u002Fmsc01-f",{"title":33,"description":44},"9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F12.miscellaneous-msc\u002F2.msc01-f","ihIGTOHxTdUcKdH7gsq9oz7oO99MAQKaN_uz00criwI",[904,908],{"title":905,"path":906,"stem":907,"children":-1},"Miscellaneous (MSC)","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fmiscellaneous-msc","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F12.miscellaneous-msc\u002F1.index",{"title":909,"path":910,"stem":911,"children":-1},"MSC02-F. Beware of compiler-specific extensions","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fmiscellaneous-msc\u002Fmsc02-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F12.miscellaneous-msc\u002F3.msc02-f",[913],{"title":914,"path":915,"stem":916,"children":917},"SEI CERT Fortran Coding Standard","\u002Fsei-cert-fortran-coding-standard","9.sei-cert-fortran-coding-standard\u002F01.index",[918,919,931,1086],{"title":914,"path":915,"stem":916},{"title":920,"path":921,"stem":922,"children":923},"Front Matter","\u002Fsei-cert-fortran-coding-standard\u002Ffront-matter","9.sei-cert-fortran-coding-standard\u002F02.front-matter\u002F1.index",[924,925],{"title":920,"path":921,"stem":922},{"title":926,"path":927,"stem":928,"children":929},"Introduction","\u002Fsei-cert-fortran-coding-standard\u002Ffront-matter\u002Fintroduction","9.sei-cert-fortran-coding-standard\u002F02.front-matter\u002F2.introduction\u002F01.index",[930],{"title":926,"path":927,"stem":928},{"title":932,"path":933,"stem":934,"children":935},"Guidelines","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F01.index",[936,937,959,973,999,1009,1019,1028,1046,1064],{"title":932,"path":933,"stem":934},{"title":938,"path":939,"stem":940,"children":941},"Arrays (ARR)","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Farrays-arr","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F02.arrays-arr\u002F1.index",[942,943,947,951,955],{"title":938,"path":939,"stem":940},{"title":944,"path":945,"stem":946},"ARR01-F. Do not use out-of-bounds arrays subscripts","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Farrays-arr\u002Farr01-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F02.arrays-arr\u002F2.arr01-f",{"title":948,"path":949,"stem":950},"ARR02-F. Declare array dummy arguments as assumed-shape","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Farrays-arr\u002Farr02-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F02.arrays-arr\u002F3.arr02-f",{"title":952,"path":953,"stem":954},"ARR03-F. Specify array bounds when copying data to device memory","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Farrays-arr\u002Farr03-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F02.arrays-arr\u002F4.arr03-f",{"title":956,"path":957,"stem":958},"ARR04-F. Ensure arrays ranges mapped to devices cover all accessed elements","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Farrays-arr\u002Farr04-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F02.arrays-arr\u002F5.arr04-f",{"title":960,"path":961,"stem":962,"children":963},"Attribute Declarations and Specifications (ADS)","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fattribute-declarations-and-specifications-ads","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F03.attribute-declarations-and-specifications-ads\u002F1.index",[964,965,969],{"title":960,"path":961,"stem":962},{"title":966,"path":967,"stem":968},"ADS01-F. Explicitly declare pure procedures","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fattribute-declarations-and-specifications-ads\u002Fads01-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F03.attribute-declarations-and-specifications-ads\u002F2.ads01-f",{"title":970,"path":971,"stem":972},"ADS02-F. Separate initialization from declaration to avoid implicit variable persistence","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fattribute-declarations-and-specifications-ads\u002Fads02-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F03.attribute-declarations-and-specifications-ads\u002F2.ads02-f",{"title":974,"path":975,"stem":976,"children":977},"Concurrency (CON)","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fconcurrency-con","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F04.concurrency-con\u002F1.index",[978,979,983,987,991,995],{"title":974,"path":975,"stem":976},{"title":980,"path":981,"stem":982},"CON01-F. Explicitly declare OpenMP data-sharing attributes for all variables","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fconcurrency-con\u002Fcon01-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F04.concurrency-con\u002F2.con01-f",{"title":984,"path":985,"stem":986},"CON02-F. Protect reduction variables in multithreaded code","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fconcurrency-con\u002Fcon02-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F04.concurrency-con\u002F3.con02-f",{"title":988,"path":989,"stem":990},"CON03-F. Protect multithreading recurrences to avoid data races","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fconcurrency-con\u002Fcon03-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F04.concurrency-con\u002F4.con03-f",{"title":992,"path":993,"stem":994},"CON04-F. Do not use out-of-dimension subscripts in multithreaded code","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fconcurrency-con\u002Fcon04-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F04.concurrency-con\u002F5.con04-f",{"title":996,"path":997,"stem":998},"CON05-F. Ensure correct OpenMP datascoping of variables in parallel regions","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fconcurrency-con\u002Fcon05-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F04.concurrency-con\u002F6.con05-f",{"title":1000,"path":1001,"stem":1002,"children":1003},"Exceptions and IEEE Arithmetic (EIA)","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fexceptions-and-ieee-arithmetic-eia","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F05.exceptions-and-ieee-arithmetic-eia\u002F1.index",[1004,1005],{"title":1000,"path":1001,"stem":1002},{"title":1006,"path":1007,"stem":1008},"EIA01-F. Enforce evaluation order in floating-point expressions","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fexceptions-and-ieee-arithmetic-eia\u002Feia01-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F05.exceptions-and-ieee-arithmetic-eia\u002F2.eia01-f",{"title":1010,"path":1011,"stem":1012,"children":1013},"Expressions and Assignment (EXA)","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fexpressions-and-assignment-exa","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F07.expressions-and-assignment-exa\u002F1.index",[1014,1015],{"title":1010,"path":1011,"stem":1012},{"title":1016,"path":1017,"stem":1018},"EXA01-F. Do not read uninitialized memory","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fexpressions-and-assignment-exa\u002Fexa01-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F07.expressions-and-assignment-exa\u002F2.exa01-f",{"title":905,"path":906,"stem":907,"children":1020},[1021,1022,1023,1024],{"title":905,"path":906,"stem":907},{"title":33,"path":899,"stem":901},{"title":909,"path":910,"stem":911},{"title":1025,"path":1026,"stem":1027},"MSC03-F. Do not depend on undefined behavior","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fmiscellaneous-msc\u002Fmsc03-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F12.miscellaneous-msc\u002F4.msc03-f",{"title":1029,"path":1030,"stem":1031,"children":1032},"Procedures (PRC)","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fprocedures-prc","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F13.procedures-prc\u002F1.index",[1033,1034,1038,1042],{"title":1029,"path":1030,"stem":1031},{"title":1035,"path":1036,"stem":1037},"PRC01-F. Disable the implicit declaration of procedures","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fprocedures-prc\u002Fprc01-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F13.procedures-prc\u002F2.prc01-f",{"title":1039,"path":1040,"stem":1041},"PRC02-F. Avoid implicit interfaces by using module procedures","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fprocedures-prc\u002Fprc02-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F13.procedures-prc\u002F3.prc02-f",{"title":1043,"path":1044,"stem":1045},"PRC03-F. Declare the intent for all dummy arguments","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fprocedures-prc\u002Fprc03-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F13.procedures-prc\u002F4.prc03-f",{"title":1047,"path":1048,"stem":1049,"children":1050},"Scope, Association, and Definition (SAD)","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fscope-association-and-definition-sad","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F15.scope-association-and-definition-sad\u002F1.index",[1051,1052,1056,1060],{"title":1047,"path":1048,"stem":1049},{"title":1053,"path":1054,"stem":1055},"SAD02-F. Minimize imported module entities using the ONLY clause","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fscope-association-and-definition-sad\u002Fsad02-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F15.scope-association-and-definition-sad\u002F2.sad02-f",{"title":1057,"path":1058,"stem":1059},"SAD03-F. Replace common block with modules for safer data encapsulation","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fscope-association-and-definition-sad\u002Fsad03-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F15.scope-association-and-definition-sad\u002F3.sad03-f",{"title":1061,"path":1062,"stem":1063},"Limit the scope of variables and procedures","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Fscope-association-and-definition-sad\u002Flimit-the-scope-of-variables-and-procedures","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F15.scope-association-and-definition-sad\u002F4.limit-the-scope-of-variables-and-procedures",{"title":1065,"path":1066,"stem":1067,"children":1068},"Types (TYP)","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Ftypes-typ","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F16.types-typ\u002F1.index",[1069,1070,1074,1078,1082],{"title":1065,"path":1066,"stem":1067},{"title":1071,"path":1072,"stem":1073},"TYP01-F. Use Intrinsic Assignment for Character Entities","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Ftypes-typ\u002Ftyp01-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F16.types-typ\u002F2.typ01-f",{"title":1075,"path":1076,"stem":1077},"TYP02-F. Prohibit implicit typing in all program units","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Ftypes-typ\u002Ftyp02-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F16.types-typ\u002F3.typ02-f",{"title":1079,"path":1080,"stem":1081},"TYP03-F. Ensure intrinsic function arguments match intended precision","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Ftypes-typ\u002Ftyp03-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F16.types-typ\u002F4.typ03-f",{"title":1083,"path":1084,"stem":1085},"TYP04-F. Centralize kind definitions to ensure consistent precision","\u002Fsei-cert-fortran-coding-standard\u002Fguidelines\u002Ftypes-typ\u002Ftyp04-f","9.sei-cert-fortran-coding-standard\u002F04.guidelines\u002F16.types-typ\u002F5.typ04-f",{"title":1087,"path":1088,"stem":1089},"Acknowledgments","\u002Fsei-cert-fortran-coding-standard\u002Facknowledgements","9.sei-cert-fortran-coding-standard\u002Facknowledgements",1783713877470]