Index: /papers/FDL2012/FDL2012.aux =================================================================== --- /papers/FDL2012/FDL2012.aux (revision 48) +++ /papers/FDL2012/FDL2012.aux (revision 48) @@ -0,0 +1,67 @@ +\relax +\providecommand\HyperFirstAtBeginDocument{\AtBeginDocument} +\HyperFirstAtBeginDocument{\ifx\hyper@anchor\@undefined +\global\let\oldcontentsline\contentsline +\gdef\contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}} +\global\let\oldnewlabel\newlabel +\gdef\newlabel#1#2{\newlabelxx{#1}#2} +\gdef\newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}} +\AtEndDocument{\ifx\hyper@anchor\@undefined +\let\contentsline\oldcontentsline +\let\newlabel\oldnewlabel +\fi} +\fi} +\global\let\hyper@last\relax +\gdef\HyperFirstAtBeginDocument#1{#1} +\providecommand\HyField@AuxAddToFields[1]{} +\catcode`:\active +\catcode`;\active +\catcode`!\active +\catcode`?\active +\citation{GrumbergLong91assume_guarantee} +\citation{HQR98assume_guarantee} +\select@language{american} +\@writefile{toc}{\select@language{american}} +\@writefile{lof}{\select@language{american}} +\@writefile{lot}{\select@language{american}} +\@writefile{toc}{\contentsline {section}{\numberline {1} Introduction}{1}{section.1}} +\@writefile{toc}{\contentsline {subsection}{\numberline {1.1} Related Works}{1}{subsection.1.1}} +\citation{GrafSaidi97abstract_construct} +\citation{clarke00cegar} +\citation{XieBrowne03composition_soft} +\citation{PMT02compositional_MC} +\citation{SNBE06property_based} +\citation{microsoft04SLAM} +\citation{berkeley07BLAST} +\citation{Kroening_al07vcegar} +\citation{pwk2009-date} +\citation{Kunz_al11ipc_abs} +\citation{braunstein07ctl_abstraction} +\citation{bara08abs_composant} +\citation{clarke00cegar} +\citation{braunstein07ctl_abstraction} +\@writefile{toc}{\contentsline {section}{\numberline {2} Our Framework}{2}{section.2}} +\@writefile{toc}{\contentsline {subsection}{\numberline {2.1} AKS generation from CTL Properties}{2}{subsection.2.1}} +\citation{braunstein07ctl_abstraction} +\citation{bara08abs_composant} +\citation{ucberkeley96vis} +\@writefile{toc}{\contentsline {subsection}{\numberline {2.2} CEGAR Loop}{3}{subsection.2.2}} +\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Verification Process }}{3}{figure.1}} +\newlabel{cegar}{{1}{3}{Verification Process\relax }{figure.1}{}} +\@writefile{toc}{\contentsline {section}{\numberline {3} Abstraction Generation and Refinement}{3}{section.3}} +\@writefile{toc}{\contentsline {subsection}{\numberline {3.1} Generalities}{3}{subsection.3.1}} +\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.1.1} Refinement}{4}{subsubsection.3.1.1}} +\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.1.2} The Counterexample}{4}{subsubsection.3.1.2}} +\@writefile{toc}{\contentsline {subsection}{\numberline {3.2} Pre-processing and pertinency ordering of properties}{4}{subsection.3.2}} +\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Example of weighting}}{5}{figure.2}} +\newlabel{DepGraphWeight}{{2}{5}{Example of weighting\relax }{figure.2}{}} +\@writefile{toc}{\contentsline {subsection}{\numberline {3.3} Initial abstraction generation}{5}{subsection.3.3}} +\@writefile{toc}{\contentsline {subsection}{\numberline {3.4} Abstraction refinement}{5}{subsection.3.4}} +\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces Kripke Structure of counterexample $\sigma _i$, $K(\sigma _i)$}}{6}{figure.3}} +\newlabel{AKSNegCex}{{3}{6}{Kripke Structure of counterexample $\sigma _i$, $K(\sigma _i)$\relax }{figure.3}{}} +\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces Kripke Structure of counterexample $\sigma _i$, $K(\sigma _i)$}}{6}{figure.4}} +\newlabel{AKSNegCex}{{4}{6}{Kripke Structure of counterexample $\sigma _i$, $K(\sigma _i)$\relax }{figure.4}{}} +\@writefile{toc}{\contentsline {section}{\numberline {4} Experimental results}{6}{section.4}} +\@writefile{toc}{\contentsline {section}{\numberline {5} Conclusion and Future Works}{6}{section.5}} +\bibstyle{IEEEbib} +\bibdata{myBib} Index: /papers/FDL2012/FDL2012.log =================================================================== --- /papers/FDL2012/FDL2012.log (revision 48) +++ /papers/FDL2012/FDL2012.log (revision 48) @@ -0,0 +1,1450 @@ +This is pdfTeX, Version 3.1415926-2.3-1.40.12 (TeX Live 2011) (format=pdflatex 2012.2.26) 5 MAR 2012 16:54 +entering extended mode + restricted \write18 enabled. + %&-line parsing enabled. +**FDL2012.tex +(./FDL2012.tex +LaTeX2e <2011/06/27> +Babel and hyphenation patterns for english, dumylang, nohyphenation, ge +rman-x-2011-07-01, ngerman-x-2011-07-01, afrikaans, ancientgreek, ibycus, arabi +c, armenian, basque, bulgarian, catalan, pinyin, coptic, croatian, czech, danis +h, dutch, ukenglish, usenglishmax, esperanto, estonian, ethiopic, farsi, finnis +h, french, galician, german, ngerman, swissgerman, monogreek, greek, hungarian, + icelandic, assamese, bengali, gujarati, hindi, kannada, malayalam, marathi, or +iya, panjabi, tamil, telugu, indonesian, interlingua, irish, italian, kurmanji, + lao, latin, latvian, lithuanian, mongolian, mongolianlmc, bokmal, nynorsk, pol +ish, portuguese, romanian, russian, sanskrit, serbian, serbianc, slovak, sloven +ian, spanish, swedish, turkish, turkmen, ukrainian, uppersorbian, welsh, polish +, russian, ukrainian, esperanto, italian, welsh, coptic, slovenian, basque, ger +man, ngerman, swissgerman, latin, pinyin, uppersorbian, estonian, turkish, germ +an-x-2011-07-01, ngerman-x-2011-07-01, portuguese, lao, indonesian, finnish, cr +oatian, monogreek, greek, dutch, bulgarian, romanian, irish, swedish, danish, k +urmanji, catalan, slovak, ancientgreek, ibycus, icelandic, ukenglish, usenglish +max, bokmal, nynorsk, spanish, mongolian, mongolianlmc, czech, hungarian, afrik +aans, galician, french, armenian, serbian, serbianc, interlingua, loaded. +(/usr/share/texlive/texmf-dist/tex/latex/base/article.cls +Document Class: article 2007/10/19 v1.4h Standard LaTeX document class +(/usr/share/texlive/texmf-dist/tex/latex/base/size10.clo +File: size10.clo 2007/10/19 v1.4h Standard LaTeX file (size option) +) +\c@part=\count79 +\c@section=\count80 +\c@subsection=\count81 +\c@subsubsection=\count82 +\c@paragraph=\count83 +\c@subparagraph=\count84 +\c@figure=\count85 +\c@table=\count86 +\abovecaptionskip=\skip41 +\belowcaptionskip=\skip42 +\bibindent=\dimen102 +) (./spconf.sty) +(/usr/share/texlive/texmf-dist/tex/latex/cmap/cmap.sty +Package: cmap 2008/03/06 v1.0h CMap support: searchable PDF +) +(/usr/share/texlive/texmf-dist/tex/latex/base/inputenc.sty +Package: inputenc 2008/03/30 v1.1d Input encoding file +\inpenc@prehook=\toks14 +\inpenc@posthook=\toks15 + +(/usr/share/texlive/texmf-dist/tex/latex/base/utf8.def +File: utf8.def 2008/04/05 v1.1m UTF-8 support for inputenc +Now handling font encoding OML ... +... no UTF-8 mapping file for font encoding OML +Now handling font encoding T1 ... +... processing UTF-8 mapping file for font encoding T1 + +(/usr/share/texlive/texmf-dist/tex/latex/base/t1enc.dfu +File: t1enc.dfu 2008/04/05 v1.1m UTF-8 support for inputenc + defining Unicode char U+00A1 (decimal 161) + defining Unicode char U+00A3 (decimal 163) + defining Unicode char U+00AB (decimal 171) + defining Unicode char U+00BB (decimal 187) + defining Unicode char U+00BF (decimal 191) + defining Unicode char U+00C0 (decimal 192) + defining Unicode char U+00C1 (decimal 193) + defining Unicode char U+00C2 (decimal 194) + defining Unicode char U+00C3 (decimal 195) + defining Unicode char U+00C4 (decimal 196) + defining Unicode char U+00C5 (decimal 197) + defining Unicode char U+00C6 (decimal 198) + defining Unicode char U+00C7 (decimal 199) + defining Unicode char U+00C8 (decimal 200) + defining Unicode char U+00C9 (decimal 201) + defining Unicode char U+00CA (decimal 202) + defining Unicode char U+00CB (decimal 203) + defining Unicode char U+00CC (decimal 204) + defining Unicode char U+00CD (decimal 205) + defining Unicode char U+00CE (decimal 206) + defining Unicode char U+00CF (decimal 207) + defining Unicode char U+00D0 (decimal 208) + defining Unicode char U+00D1 (decimal 209) + defining Unicode char U+00D2 (decimal 210) + defining Unicode char U+00D3 (decimal 211) + defining Unicode char U+00D4 (decimal 212) + defining Unicode char U+00D5 (decimal 213) + defining Unicode char U+00D6 (decimal 214) + defining Unicode char U+00D8 (decimal 216) + defining Unicode char U+00D9 (decimal 217) + defining Unicode char U+00DA (decimal 218) + defining Unicode char U+00DB (decimal 219) + defining Unicode char U+00DC (decimal 220) + defining Unicode char U+00DD (decimal 221) + defining Unicode char U+00DE (decimal 222) + defining Unicode char U+00DF (decimal 223) + defining Unicode char U+00E0 (decimal 224) + defining Unicode char U+00E1 (decimal 225) + defining Unicode char U+00E2 (decimal 226) + defining Unicode char U+00E3 (decimal 227) + defining Unicode char U+00E4 (decimal 228) + defining Unicode char U+00E5 (decimal 229) + defining Unicode char U+00E6 (decimal 230) + defining Unicode char U+00E7 (decimal 231) + defining Unicode char U+00E8 (decimal 232) + defining Unicode char U+00E9 (decimal 233) + defining Unicode char U+00EA (decimal 234) + defining Unicode char U+00EB (decimal 235) + defining Unicode char U+00EC (decimal 236) + defining Unicode char U+00ED (decimal 237) + defining Unicode char U+00EE (decimal 238) + defining Unicode char U+00EF (decimal 239) + defining Unicode char U+00F0 (decimal 240) + defining Unicode char U+00F1 (decimal 241) + defining Unicode char U+00F2 (decimal 242) + defining Unicode char U+00F3 (decimal 243) + defining Unicode char U+00F4 (decimal 244) + defining Unicode char U+00F5 (decimal 245) + defining Unicode char U+00F6 (decimal 246) + defining Unicode char U+00F8 (decimal 248) + defining Unicode char U+00F9 (decimal 249) + defining Unicode char U+00FA (decimal 250) + defining Unicode char U+00FB (decimal 251) + defining Unicode char U+00FC (decimal 252) + defining Unicode char U+00FD (decimal 253) + defining Unicode char U+00FE (decimal 254) + defining Unicode char U+00FF (decimal 255) + defining Unicode char U+0102 (decimal 258) + defining Unicode char U+0103 (decimal 259) + defining Unicode char U+0104 (decimal 260) + defining Unicode char U+0105 (decimal 261) + defining Unicode char U+0106 (decimal 262) + defining Unicode char U+0107 (decimal 263) + defining Unicode char U+010C (decimal 268) + defining Unicode char U+010D (decimal 269) + defining Unicode char U+010E (decimal 270) + defining Unicode char U+010F (decimal 271) + defining Unicode char U+0110 (decimal 272) + defining Unicode char U+0111 (decimal 273) + defining Unicode char U+0118 (decimal 280) + defining Unicode char U+0119 (decimal 281) + defining Unicode char U+011A (decimal 282) + defining Unicode char U+011B (decimal 283) + defining Unicode char U+011E (decimal 286) + defining Unicode char U+011F (decimal 287) + defining Unicode char U+0130 (decimal 304) + defining Unicode char U+0131 (decimal 305) + defining Unicode char U+0132 (decimal 306) + defining Unicode char U+0133 (decimal 307) + defining Unicode char U+0139 (decimal 313) + defining Unicode char U+013A (decimal 314) + defining Unicode char U+013D (decimal 317) + defining Unicode char U+013E (decimal 318) + defining Unicode char U+0141 (decimal 321) + defining Unicode char U+0142 (decimal 322) + defining Unicode char U+0143 (decimal 323) + defining Unicode char U+0144 (decimal 324) + defining Unicode char U+0147 (decimal 327) + defining Unicode char U+0148 (decimal 328) + defining Unicode char U+014A (decimal 330) + defining Unicode char U+014B (decimal 331) + defining Unicode char U+0150 (decimal 336) + defining Unicode char U+0151 (decimal 337) + defining Unicode char U+0152 (decimal 338) + defining Unicode char U+0153 (decimal 339) + defining Unicode char U+0154 (decimal 340) + defining Unicode char U+0155 (decimal 341) + defining Unicode char U+0158 (decimal 344) + defining Unicode char U+0159 (decimal 345) + defining Unicode char U+015A (decimal 346) + defining Unicode char U+015B (decimal 347) + defining Unicode char U+015E (decimal 350) + defining Unicode char U+015F (decimal 351) + defining Unicode char U+0160 (decimal 352) + defining Unicode char U+0161 (decimal 353) + defining Unicode char U+0162 (decimal 354) + defining Unicode char U+0163 (decimal 355) + defining Unicode char U+0164 (decimal 356) + defining Unicode char U+0165 (decimal 357) + defining Unicode char U+016E (decimal 366) + defining Unicode char U+016F (decimal 367) + defining Unicode char U+0170 (decimal 368) + defining Unicode char U+0171 (decimal 369) + defining Unicode char U+0178 (decimal 376) + defining Unicode char U+0179 (decimal 377) + defining Unicode char U+017A (decimal 378) + defining Unicode char U+017B (decimal 379) + defining Unicode char U+017C (decimal 380) + defining Unicode char U+017D (decimal 381) + defining Unicode char U+017E (decimal 382) + defining Unicode char U+200C (decimal 8204) + defining Unicode char U+2013 (decimal 8211) + defining Unicode char U+2014 (decimal 8212) + defining Unicode char U+2018 (decimal 8216) + defining Unicode char U+2019 (decimal 8217) + defining Unicode char U+201A (decimal 8218) + defining Unicode char U+201C (decimal 8220) + defining Unicode char U+201D (decimal 8221) + defining Unicode char U+201E (decimal 8222) + defining Unicode char U+2030 (decimal 8240) + defining Unicode char U+2031 (decimal 8241) + defining Unicode char U+2039 (decimal 8249) + defining Unicode char U+203A (decimal 8250) + defining Unicode char U+2423 (decimal 9251) +) +Now handling font encoding OT1 ... +... processing UTF-8 mapping file for font encoding OT1 + +(/usr/share/texlive/texmf-dist/tex/latex/base/ot1enc.dfu +File: ot1enc.dfu 2008/04/05 v1.1m UTF-8 support for inputenc + defining Unicode char U+00A1 (decimal 161) + defining Unicode char U+00A3 (decimal 163) + defining Unicode char U+00B8 (decimal 184) + defining Unicode char U+00BF (decimal 191) + defining Unicode char U+00C5 (decimal 197) + defining Unicode char U+00C6 (decimal 198) + defining Unicode char U+00D8 (decimal 216) + defining Unicode char U+00DF (decimal 223) + defining Unicode char U+00E6 (decimal 230) + defining Unicode char U+00EC (decimal 236) + defining Unicode char U+00ED (decimal 237) + defining Unicode char U+00EE (decimal 238) + defining Unicode char U+00EF (decimal 239) + defining Unicode char U+00F8 (decimal 248) + defining Unicode char U+0131 (decimal 305) + defining Unicode char U+0141 (decimal 321) + defining Unicode char U+0142 (decimal 322) + defining Unicode char U+0152 (decimal 338) + defining Unicode char U+0153 (decimal 339) + defining Unicode char U+2013 (decimal 8211) + defining Unicode char U+2014 (decimal 8212) + defining Unicode char U+2018 (decimal 8216) + defining Unicode char U+2019 (decimal 8217) + defining Unicode char U+201C (decimal 8220) + defining Unicode char U+201D (decimal 8221) +) +Now handling font encoding OMS ... +... processing UTF-8 mapping file for font encoding OMS + +(/usr/share/texlive/texmf-dist/tex/latex/base/omsenc.dfu +File: omsenc.dfu 2008/04/05 v1.1m UTF-8 support for inputenc + defining Unicode char U+00A7 (decimal 167) + defining Unicode char U+00B6 (decimal 182) + defining Unicode char U+00B7 (decimal 183) + defining Unicode char U+2020 (decimal 8224) + defining Unicode char U+2021 (decimal 8225) + defining Unicode char U+2022 (decimal 8226) +) +Now handling font encoding OMX ... +... no UTF-8 mapping file for font encoding OMX +Now handling font encoding U ... +... no UTF-8 mapping file for font encoding U + defining Unicode char U+00A9 (decimal 169) + defining Unicode char U+00AA (decimal 170) + defining Unicode char U+00AE (decimal 174) + defining Unicode char U+00BA (decimal 186) + defining Unicode char U+02C6 (decimal 710) + defining Unicode char U+02DC (decimal 732) + defining Unicode char U+200C (decimal 8204) + defining Unicode char U+2026 (decimal 8230) + defining Unicode char U+2122 (decimal 8482) + defining Unicode char U+2423 (decimal 9251) +)) +(/usr/share/texlive/texmf-dist/tex/latex/base/fontenc.sty +Package: fontenc 2005/09/27 v1.99g Standard LaTeX package + +(/usr/share/texlive/texmf-dist/tex/latex/base/t1enc.def +File: t1enc.def 2005/09/27 v1.99g Standard LaTeX file +LaTeX Font Info: Redeclaring font encoding T1 on input line 43. +)<>) +(/usr/share/texlive/texmf-dist/tex/latex/lm/lmodern.sty +Package: lmodern 2009/10/30 v1.6 Latin Modern Fonts +LaTeX Font Info: Overwriting symbol font `operators' in version `normal' +(Font) OT1/cmr/m/n --> OT1/lmr/m/n on input line 22. +LaTeX Font Info: Overwriting symbol font `letters' in version `normal' +(Font) OML/cmm/m/it --> OML/lmm/m/it on input line 23. +LaTeX Font Info: Overwriting symbol font `symbols' in version `normal' +(Font) OMS/cmsy/m/n --> OMS/lmsy/m/n on input line 24. +LaTeX Font Info: Overwriting symbol font `largesymbols' in version `normal' +(Font) OMX/cmex/m/n --> OMX/lmex/m/n on input line 25. +LaTeX Font Info: Overwriting symbol font `operators' in version `bold' +(Font) OT1/cmr/bx/n --> OT1/lmr/bx/n on input line 26. +LaTeX Font Info: Overwriting symbol font `letters' in version `bold' +(Font) OML/cmm/b/it --> OML/lmm/b/it on input line 27. +LaTeX Font Info: Overwriting symbol font `symbols' in version `bold' +(Font) OMS/cmsy/b/n --> OMS/lmsy/b/n on input line 28. +LaTeX Font Info: Overwriting symbol font `largesymbols' in version `bold' +(Font) OMX/cmex/m/n --> OMX/lmex/m/n on input line 29. +LaTeX Font Info: Overwriting math alphabet `\mathbf' in version `normal' +(Font) OT1/cmr/bx/n --> OT1/lmr/bx/n on input line 31. +LaTeX Font Info: Overwriting math alphabet `\mathsf' in version `normal' +(Font) OT1/cmss/m/n --> OT1/lmss/m/n on input line 32. +LaTeX Font Info: Overwriting math alphabet `\mathit' in version `normal' +(Font) OT1/cmr/m/it --> OT1/lmr/m/it on input line 33. +LaTeX Font Info: Overwriting math alphabet `\mathtt' in version `normal' +(Font) OT1/cmtt/m/n --> OT1/lmtt/m/n on input line 34. +LaTeX Font Info: Overwriting math alphabet `\mathbf' in version `bold' +(Font) OT1/cmr/bx/n --> OT1/lmr/bx/n on input line 35. +LaTeX Font Info: Overwriting math alphabet `\mathsf' in version `bold' +(Font) OT1/cmss/bx/n --> OT1/lmss/bx/n on input line 36. +LaTeX Font Info: Overwriting math alphabet `\mathit' in version `bold' +(Font) OT1/cmr/bx/it --> OT1/lmr/bx/it on input line 37. +LaTeX Font Info: Overwriting math alphabet `\mathtt' in version `bold' +(Font) OT1/cmtt/m/n --> OT1/lmtt/m/n on input line 38. +) +(/usr/share/texlive/texmf-dist/tex/latex/base/textcomp.sty +Package: textcomp 2005/09/27 v1.99g Standard LaTeX package +Package textcomp Info: Sub-encoding information: +(textcomp) 5 = only ISO-Adobe without \textcurrency +(textcomp) 4 = 5 + \texteuro +(textcomp) 3 = 4 + \textohm +(textcomp) 2 = 3 + \textestimated + \textcurrency +(textcomp) 1 = TS1 - \textcircled - \t +(textcomp) 0 = TS1 (full) +(textcomp) Font families with sub-encoding setting implement +(textcomp) only a restricted character set as indicated. +(textcomp) Family '?' is the default used for unknown fonts. +(textcomp) See the documentation for details. +Package textcomp Info: Setting ? sub-encoding to TS1/1 on input line 71. + +(/usr/share/texlive/texmf-dist/tex/latex/base/ts1enc.def +File: ts1enc.def 2001/06/05 v3.0e (jk/car/fm) Standard LaTeX file +Now handling font encoding TS1 ... +... processing UTF-8 mapping file for font encoding TS1 + +(/usr/share/texlive/texmf-dist/tex/latex/base/ts1enc.dfu +File: ts1enc.dfu 2008/04/05 v1.1m UTF-8 support for inputenc + defining Unicode char U+00A2 (decimal 162) + defining Unicode char U+00A3 (decimal 163) + defining Unicode char U+00A4 (decimal 164) + defining Unicode char U+00A5 (decimal 165) + defining Unicode char U+00A6 (decimal 166) + defining Unicode char U+00A7 (decimal 167) + defining Unicode char U+00A8 (decimal 168) + defining Unicode char U+00A9 (decimal 169) + defining Unicode char U+00AA (decimal 170) + defining Unicode char U+00AC (decimal 172) + defining Unicode char U+00AE (decimal 174) + defining Unicode char U+00AF (decimal 175) + defining Unicode char U+00B0 (decimal 176) + defining Unicode char U+00B1 (decimal 177) + defining Unicode char U+00B2 (decimal 178) + defining Unicode char U+00B3 (decimal 179) + defining Unicode char U+00B4 (decimal 180) + defining Unicode char U+00B5 (decimal 181) + defining Unicode char U+00B6 (decimal 182) + defining Unicode char U+00B7 (decimal 183) + defining Unicode char U+00B9 (decimal 185) + defining Unicode char U+00BA (decimal 186) + defining Unicode char U+00BC (decimal 188) + defining Unicode char U+00BD (decimal 189) + defining Unicode char U+00BE (decimal 190) + defining Unicode char U+00D7 (decimal 215) + defining Unicode char U+00F7 (decimal 247) + defining Unicode char U+0192 (decimal 402) + defining Unicode char U+02C7 (decimal 711) + defining Unicode char U+02D8 (decimal 728) + defining Unicode char U+02DD (decimal 733) + defining Unicode char U+0E3F (decimal 3647) + defining Unicode char U+2016 (decimal 8214) + defining Unicode char U+2020 (decimal 8224) + defining Unicode char U+2021 (decimal 8225) + defining Unicode char U+2022 (decimal 8226) + defining Unicode char U+2030 (decimal 8240) + defining Unicode char U+2031 (decimal 8241) + defining Unicode char U+203B (decimal 8251) + defining Unicode char U+203D (decimal 8253) + defining Unicode char U+2044 (decimal 8260) + defining Unicode char U+204E (decimal 8270) + defining Unicode char U+2052 (decimal 8274) + defining Unicode char U+20A1 (decimal 8353) + defining Unicode char U+20A4 (decimal 8356) + defining Unicode char U+20A6 (decimal 8358) + defining Unicode char U+20A9 (decimal 8361) + defining Unicode char U+20AB (decimal 8363) + defining Unicode char U+20AC (decimal 8364) + defining Unicode char U+20B1 (decimal 8369) + defining Unicode char U+2103 (decimal 8451) + defining Unicode char U+2116 (decimal 8470) + defining Unicode char U+2117 (decimal 8471) + defining Unicode char U+211E (decimal 8478) + defining Unicode char U+2120 (decimal 8480) + defining Unicode char U+2122 (decimal 8482) + defining Unicode char U+2126 (decimal 8486) + defining Unicode char U+2127 (decimal 8487) + defining Unicode char U+212E (decimal 8494) + defining Unicode char U+2190 (decimal 8592) + defining Unicode char U+2191 (decimal 8593) + defining Unicode char U+2192 (decimal 8594) + defining Unicode char U+2193 (decimal 8595) + defining Unicode char U+2329 (decimal 9001) + defining Unicode char U+232A (decimal 9002) + defining Unicode char U+2422 (decimal 9250) + defining Unicode char U+25E6 (decimal 9702) + defining Unicode char U+25EF (decimal 9711) + defining Unicode char U+266A (decimal 9834) +)) +LaTeX Info: Redefining \oldstylenums on input line 266. +Package textcomp Info: Setting cmr sub-encoding to TS1/0 on input line 281. +Package textcomp Info: Setting cmss sub-encoding to TS1/0 on input line 282. +Package textcomp Info: Setting cmtt sub-encoding to TS1/0 on input line 283. +Package textcomp Info: Setting cmvtt sub-encoding to TS1/0 on input line 284. +Package textcomp Info: Setting cmbr sub-encoding to TS1/0 on input line 285. +Package textcomp Info: Setting cmtl sub-encoding to TS1/0 on input line 286. +Package textcomp Info: Setting ccr sub-encoding to TS1/0 on input line 287. +Package textcomp Info: Setting ptm sub-encoding to TS1/4 on input line 288. +Package textcomp Info: Setting pcr sub-encoding to TS1/4 on input line 289. +Package textcomp Info: Setting phv sub-encoding to TS1/4 on input line 290. +Package textcomp Info: Setting ppl sub-encoding to TS1/3 on input line 291. +Package textcomp Info: Setting pag sub-encoding to TS1/4 on input line 292. +Package textcomp Info: Setting pbk sub-encoding to TS1/4 on input line 293. +Package textcomp Info: Setting pnc sub-encoding to TS1/4 on input line 294. +Package textcomp Info: Setting pzc sub-encoding to TS1/4 on input line 295. +Package textcomp Info: Setting bch sub-encoding to TS1/4 on input line 296. +Package textcomp Info: Setting put sub-encoding to TS1/5 on input line 297. +Package textcomp Info: Setting uag sub-encoding to TS1/5 on input line 298. +Package textcomp Info: Setting ugq sub-encoding to TS1/5 on input line 299. +Package textcomp Info: Setting ul8 sub-encoding to TS1/4 on input line 300. +Package textcomp Info: Setting ul9 sub-encoding to TS1/4 on input line 301. +Package textcomp Info: Setting augie sub-encoding to TS1/5 on input line 302. +Package textcomp Info: Setting dayrom sub-encoding to TS1/3 on input line 303. +Package textcomp Info: Setting dayroms sub-encoding to TS1/3 on input line 304. + +Package textcomp Info: Setting pxr sub-encoding to TS1/0 on input line 305. +Package textcomp Info: Setting pxss sub-encoding to TS1/0 on input line 306. +Package textcomp Info: Setting pxtt sub-encoding to TS1/0 on input line 307. +Package textcomp Info: Setting txr sub-encoding to TS1/0 on input line 308. +Package textcomp Info: Setting txss sub-encoding to TS1/0 on input line 309. +Package textcomp Info: Setting txtt sub-encoding to TS1/0 on input line 310. +Package textcomp Info: Setting lmr sub-encoding to TS1/0 on input line 311. +Package textcomp Info: Setting lmdh sub-encoding to TS1/0 on input line 312. +Package textcomp Info: Setting lmss sub-encoding to TS1/0 on input line 313. +Package textcomp Info: Setting lmssq sub-encoding to TS1/0 on input line 314. +Package textcomp Info: Setting lmvtt sub-encoding to TS1/0 on input line 315. +Package textcomp Info: Setting qhv sub-encoding to TS1/0 on input line 316. +Package textcomp Info: Setting qag sub-encoding to TS1/0 on input line 317. +Package textcomp Info: Setting qbk sub-encoding to TS1/0 on input line 318. +Package textcomp Info: Setting qcr sub-encoding to TS1/0 on input line 319. +Package textcomp Info: Setting qcs sub-encoding to TS1/0 on input line 320. +Package textcomp Info: Setting qpl sub-encoding to TS1/0 on input line 321. +Package textcomp Info: Setting qtm sub-encoding to TS1/0 on input line 322. +Package textcomp Info: Setting qzc sub-encoding to TS1/0 on input line 323. +Package textcomp Info: Setting qhvc sub-encoding to TS1/0 on input line 324. +Package textcomp Info: Setting futs sub-encoding to TS1/4 on input line 325. +Package textcomp Info: Setting futx sub-encoding to TS1/4 on input line 326. +Package textcomp Info: Setting futj sub-encoding to TS1/4 on input line 327. +Package textcomp Info: Setting hlh sub-encoding to TS1/3 on input line 328. +Package textcomp Info: Setting hls sub-encoding to TS1/3 on input line 329. +Package textcomp Info: Setting hlst sub-encoding to TS1/3 on input line 330. +Package textcomp Info: Setting hlct sub-encoding to TS1/5 on input line 331. +Package textcomp Info: Setting hlx sub-encoding to TS1/5 on input line 332. +Package textcomp Info: Setting hlce sub-encoding to TS1/5 on input line 333. +Package textcomp Info: Setting hlcn sub-encoding to TS1/5 on input line 334. +Package textcomp Info: Setting hlcw sub-encoding to TS1/5 on input line 335. +Package textcomp Info: Setting hlcf sub-encoding to TS1/5 on input line 336. +Package textcomp Info: Setting pplx sub-encoding to TS1/3 on input line 337. +Package textcomp Info: Setting pplj sub-encoding to TS1/3 on input line 338. +Package textcomp Info: Setting ptmx sub-encoding to TS1/4 on input line 339. +Package textcomp Info: Setting ptmj sub-encoding to TS1/4 on input line 340. +) +(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsmath.sty +Package: amsmath 2000/07/18 v2.13 AMS math features +\@mathmargin=\skip43 + +For additional information on amsmath, use the `?' option. +(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amstext.sty +Package: amstext 2000/06/29 v2.01 + +(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsgen.sty +File: amsgen.sty 1999/11/30 v2.0 +\@emptytoks=\toks16 +\ex@=\dimen103 +)) +(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsbsy.sty +Package: amsbsy 1999/11/29 v1.2d +\pmbraise@=\dimen104 +) +(/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsopn.sty +Package: amsopn 1999/12/14 v2.01 operator names +) +\inf@bad=\count87 +LaTeX Info: Redefining \frac on input line 211. +\uproot@=\count88 +\leftroot@=\count89 +LaTeX Info: Redefining \overline on input line 307. +\classnum@=\count90 +\DOTSCASE@=\count91 +LaTeX Info: Redefining \ldots on input line 379. +LaTeX Info: Redefining \dots on input line 382. +LaTeX Info: Redefining \cdots on input line 467. +\Mathstrutbox@=\box26 +\strutbox@=\box27 +\big@size=\dimen105 +LaTeX Font Info: Redeclaring font encoding OML on input line 567. +LaTeX Font Info: Redeclaring font encoding OMS on input line 568. +\macc@depth=\count92 +\c@MaxMatrixCols=\count93 +\dotsspace@=\muskip10 +\c@parentequation=\count94 +\dspbrk@lvl=\count95 +\tag@help=\toks17 +\row@=\count96 +\column@=\count97 +\maxfields@=\count98 +\andhelp@=\toks18 +\eqnshift@=\dimen106 +\alignsep@=\dimen107 +\tagshift@=\dimen108 +\tagwidth@=\dimen109 +\totwidth@=\dimen110 +\lineht@=\dimen111 +\@envbody=\toks19 +\multlinegap=\skip44 +\multlinetaggap=\skip45 +\mathdisplay@stack=\toks20 +LaTeX Info: Redefining \[ on input line 2666. +LaTeX Info: Redefining \] on input line 2667. +) +(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amssymb.sty +Package: amssymb 2009/06/22 v3.00 + +(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amsfonts.sty +Package: amsfonts 2009/06/22 v3.00 Basic AMSFonts support +\symAMSa=\mathgroup4 +\symAMSb=\mathgroup5 +LaTeX Font Info: Overwriting math alphabet `\mathfrak' in version `bold' +(Font) U/euf/m/n --> U/euf/b/n on input line 96. +)) +(/usr/share/texlive/texmf-dist/tex/latex/bbm-macros/bbm.sty +Package: bbm 1999/03/15 V 1.2 provides fonts for set symbols - TH +LaTeX Font Info: Overwriting math alphabet `\mathbbm' in version `bold' +(Font) U/bbm/m/n --> U/bbm/bx/n on input line 33. +LaTeX Font Info: Overwriting math alphabet `\mathbbmss' in version `bold' +(Font) U/bbmss/m/n --> U/bbmss/bx/n on input line 35. +) +(/usr/share/texlive/texmf-dist/tex/latex/bbold/bbold.sty +Package: bbold 1994/04/06 Bbold symbol package +LaTeX Font Info: Redeclaring math alphabet \mathbb on input line 42. +) +(/usr/share/texlive/texmf-dist/tex/latex/amscls/amsthm.sty +Package: amsthm 2009/07/02 v2.20.1 +\thm@style=\toks21 +\thm@bodyfont=\toks22 +\thm@headfont=\toks23 +\thm@notefont=\toks24 +\thm@headpunct=\toks25 +\thm@preskip=\skip46 +\thm@postskip=\skip47 +\thm@headsep=\skip48 +\dth@everypar=\toks26 +) +(/usr/share/texlive/texmf-dist/tex/latex/tools/array.sty +Package: array 2008/09/09 v2.4c Tabular extension package (FMi) +\col@sep=\dimen112 +\extrarowheight=\dimen113 +\NC@list=\toks27 +\extratabsurround=\skip49 +\backup@length=\skip50 +) +(/usr/share/texlive/texmf-dist/tex/latex/tools/verbatim.sty +Package: verbatim 2003/08/22 v1.5q LaTeX2e package for verbatim enhancements +\every@verbatim=\toks28 +\verbatim@line=\toks29 +\verbatim@in@stream=\read1 +) +(/usr/share/texlive/texmf-dist/tex/latex/hyperref/hyperref.sty +Package: hyperref 2011/10/01 v6.82j Hypertext links for LaTeX + +(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-hyperref.sty +Package: hobsub-hyperref 2011/04/23 v1.4 Bundle oberdiek, subset hyperref (HO) + +(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-generic.sty +Package: hobsub-generic 2011/04/23 v1.4 Bundle oberdiek, subset generic (HO) +Package: hobsub 2011/04/23 v1.4 Subsetting bundle oberdiek (HO) +Package: infwarerr 2010/04/08 v1.3 Providing info/warning/message (HO) +Package: ltxcmds 2011/04/18 v1.20 LaTeX kernel commands for general use (HO) +Package: ifluatex 2010/03/01 v1.3 Provides the ifluatex switch (HO) +Package ifluatex Info: LuaTeX not detected. +Package: ifvtex 2010/03/01 v1.5 Switches for detecting VTeX and its modes (HO) +Package ifvtex Info: VTeX not detected. +Package: intcalc 2007/09/27 v1.1 Expandable integer calculations (HO) +Package: ifpdf 2011/01/30 v2.3 Provides the ifpdf switch (HO) +Package ifpdf Info: pdfTeX in PDF mode is detected. +Package: etexcmds 2011/02/16 v1.5 Prefix for e-TeX command names (HO) +Package etexcmds Info: Could not find \expanded. +(etexcmds) That can mean that you are not using pdfTeX 1.50 or +(etexcmds) that some package has redefined \expanded. +(etexcmds) In the latter case, load this package earlier. +Package: kvsetkeys 2011/04/07 v1.13 Key value parser (HO) +Package: kvdefinekeys 2011/04/07 v1.3 Defining keys (HO) +Package: pdftexcmds 2011/04/22 v0.16 Utilities of pdfTeX for LuaTeX (HO) +Package pdftexcmds Info: LuaTeX not detected. +Package pdftexcmds Info: \pdf@primitive is available. +Package pdftexcmds Info: \pdf@ifprimitive is available. +Package pdftexcmds Info: \pdfdraftmode found. +Package: pdfescape 2011/04/04 v1.12 Provides string conversions (HO) +Package: bigintcalc 2011/01/30 v1.2 Expandable big integer calculations (HO) +Package: bitset 2011/01/30 v1.1 Data type bit set (HO) +Package: uniquecounter 2011/01/30 v1.2 Provides unlimited unique counter (HO) +) +Package hobsub Info: Skipping package `hobsub' (already loaded). +Package: letltxmacro 2010/09/02 v1.4 Let assignment for LaTeX macros (HO) +Package: hopatch 2011/01/30 v1.0 Wrapper for package hooks (HO) +Package: xcolor-patch 2011/01/30 xcolor patch +Package: atveryend 2011/04/23 v1.7 Hooks at very end of document (HO) +Package: atbegshi 2011/01/30 v1.15 At begin shipout hook (HO) +Package: refcount 2010/12/01 v3.2 Data extraction from references (HO) +Package: hycolor 2011/01/30 v1.7 Color options of hyperref/bookmark (HO) +) +(/usr/share/texlive/texmf-dist/tex/latex/graphics/keyval.sty +Package: keyval 1999/03/16 v1.13 key=value parser (DPC) +\KV@toks@=\toks30 +) +(/usr/share/texlive/texmf-dist/tex/generic/ifxetex/ifxetex.sty +Package: ifxetex 2010/09/12 v0.6 Provides ifxetex conditional +) +(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/kvoptions.sty +Package: kvoptions 2010/12/23 v3.10 Keyval support for LaTeX options (HO) +) +\@linkdim=\dimen114 +\Hy@linkcounter=\count99 +\Hy@pagecounter=\count100 + +(/usr/share/texlive/texmf-dist/tex/latex/hyperref/pd1enc.def +File: pd1enc.def 2011/10/01 v6.82j Hyperref: PDFDocEncoding definition (HO) +Now handling font encoding PD1 ... +... no UTF-8 mapping file for font encoding PD1 +) +\Hy@SavedSpaceFactor=\count101 + +(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/hyperref.cfg +File: hyperref.cfg 2002/06/06 v1.2 hyperref configuration of TeXLive +) +Package hyperref Info: Hyper figures OFF on input line 4046. +Package hyperref Info: Link nesting OFF on input line 4051. +Package hyperref Info: Hyper index ON on input line 4054. +Package hyperref Info: Plain pages OFF on input line 4061. +Package hyperref Info: Backreferencing OFF on input line 4066. +Package hyperref Info: Implicit mode ON; LaTeX internals redefined. +Package hyperref Info: Bookmarks ON on input line 4284. +\c@Hy@tempcnt=\count102 + +(/usr/share/texlive/texmf-dist/tex/latex/url/url.sty +\Urlmuskip=\muskip11 +Package: url 2006/04/12 ver 3.3 Verb mode for urls, etc. +) +LaTeX Info: Redefining \url on input line 4637. +\Fld@menulength=\count103 +\Field@Width=\dimen115 +\Fld@charsize=\dimen116 +Package hyperref Info: Hyper figures OFF on input line 5723. +Package hyperref Info: Link nesting OFF on input line 5728. +Package hyperref Info: Hyper index ON on input line 5731. +Package hyperref Info: backreferencing OFF on input line 5738. +Package hyperref Info: Link coloring OFF on input line 5743. +Package hyperref Info: Link coloring with OCG OFF on input line 5748. +Package hyperref Info: PDF/A mode OFF on input line 5753. +LaTeX Info: Redefining \ref on input line 5793. +LaTeX Info: Redefining \pageref on input line 5797. +\Hy@abspage=\count104 +\c@Item=\count105 +\c@Hfootnote=\count106 +) + +Package hyperref Message: Driver (autodetected): hpdftex. + +(/usr/share/texlive/texmf-dist/tex/latex/hyperref/hpdftex.def +File: hpdftex.def 2011/10/01 v6.82j Hyperref driver for pdfTeX +\Fld@listcount=\count107 +\c@bookmark@seq@number=\count108 + +(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/rerunfilecheck.sty +Package: rerunfilecheck 2011/04/15 v1.7 Rerun checks for auxiliary files (HO) +Package uniquecounter Info: New unique counter `rerunfilecheck' on input line 2 +82. +) +\Hy@SectionHShift=\skip51 +) +(/usr/share/texlive/texmf-dist/tex/latex/booktabs/booktabs.sty +Package: booktabs 2005/04/14 v1.61803 publication quality tables +\heavyrulewidth=\dimen117 +\lightrulewidth=\dimen118 +\cmidrulewidth=\dimen119 +\belowrulesep=\dimen120 +\belowbottomsep=\dimen121 +\aboverulesep=\dimen122 +\abovetopsep=\dimen123 +\cmidrulesep=\dimen124 +\cmidrulekern=\dimen125 +\defaultaddspace=\dimen126 +\@cmidla=\count109 +\@cmidlb=\count110 +\@aboverulesep=\dimen127 +\@belowrulesep=\dimen128 +\@thisruleclass=\count111 +\@lastruleclass=\count112 +\@thisrulewidth=\dimen129 +) +(/usr/share/texlive/texmf-dist/tex/latex/graphics/graphicx.sty +Package: graphicx 1999/02/16 v1.0f Enhanced LaTeX Graphics (DPC,SPQR) + +(/usr/share/texlive/texmf-dist/tex/latex/graphics/graphics.sty +Package: graphics 2009/02/05 v1.0o Standard LaTeX Graphics (DPC,SPQR) + +(/usr/share/texlive/texmf-dist/tex/latex/graphics/trig.sty +Package: trig 1999/03/16 v1.09 sin cos tan (DPC) +) +(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/graphics.cfg +File: graphics.cfg 2010/04/23 v1.9 graphics configuration of TeX Live +) +Package graphics Info: Driver file: pdftex.def on input line 91. + +(/usr/share/texlive/texmf-dist/tex/latex/pdftex-def/pdftex.def +File: pdftex.def 2011/05/27 v0.06d Graphics/color for pdfTeX +\Gread@gobject=\count113 +)) +\Gin@req@height=\dimen130 +\Gin@req@width=\dimen131 +) +(/usr/share/texlive/texmf-dist/tex/latex/pgf/frontendlayer/tikz.sty +(/usr/share/texlive/texmf-dist/tex/latex/pgf/basiclayer/pgf.sty +(/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgfrcs.sty +(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-common.tex +\pgfutil@everybye=\toks31 +) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-latex.def +\pgfutil@abb=\box28 + +(/usr/share/texlive/texmf-dist/tex/latex/ms/everyshi.sty +Package: everyshi 2001/05/15 v3.00 EveryShipout Package (MS) +)) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfrcs.code.tex +Package: pgfrcs 2010/10/25 v2.10 (rcs-revision 1.24) +)) +Package: pgf 2008/01/15 v2.10 (rcs-revision 1.12) + +(/usr/share/texlive/texmf-dist/tex/latex/pgf/basiclayer/pgfcore.sty +(/usr/share/texlive/texmf-dist/tex/latex/pgf/systemlayer/pgfsys.sty +(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys.code.tex +Package: pgfsys 2010/06/30 v2.10 (rcs-revision 1.37) + +(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeys.code.tex +\pgfkeys@pathtoks=\toks32 +\pgfkeys@temptoks=\toks33 + +(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeysfiltered.code.t +ex +\pgfkeys@tmptoks=\toks34 +)) +\pgf@x=\dimen132 +\pgf@y=\dimen133 +\pgf@xa=\dimen134 +\pgf@ya=\dimen135 +\pgf@xb=\dimen136 +\pgf@yb=\dimen137 +\pgf@xc=\dimen138 +\pgf@yc=\dimen139 +\w@pgf@writea=\write3 +\r@pgf@reada=\read2 +\c@pgf@counta=\count114 +\c@pgf@countb=\count115 +\c@pgf@countc=\count116 +\c@pgf@countd=\count117 + (/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgf.cfg +File: pgf.cfg 2008/05/14 (rcs-revision 1.7) +) +Package pgfsys Info: Driver file for pgf: pgfsys-pdftex.def on input line 900. + +(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys-pdftex.def +File: pgfsys-pdftex.def 2009/05/22 (rcs-revision 1.26) + +(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsys-common-pdf.de +f +File: pgfsys-common-pdf.def 2008/05/19 (rcs-revision 1.10) +))) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsyssoftpath.code. +tex +File: pgfsyssoftpath.code.tex 2008/07/18 (rcs-revision 1.7) +\pgfsyssoftpath@smallbuffer@items=\count118 +\pgfsyssoftpath@bigbuffer@items=\count119 +) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/systemlayer/pgfsysprotocol.code. +tex +File: pgfsysprotocol.code.tex 2006/10/16 (rcs-revision 1.4) +)) (/usr/share/texlive/texmf-dist/tex/latex/xcolor/xcolor.sty +Package: xcolor 2007/01/21 v2.11 LaTeX color extensions (UK) + +(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/color.cfg +File: color.cfg 2007/01/18 v1.5 color configuration of teTeX/TeXLive +) +Package xcolor Info: Driver file: pdftex.def on input line 225. +Package xcolor Info: Model `cmy' substituted by `cmy0' on input line 1337. +Package xcolor Info: Model `hsb' substituted by `rgb' on input line 1341. +Package xcolor Info: Model `RGB' extended on input line 1353. +Package xcolor Info: Model `HTML' substituted by `rgb' on input line 1355. +Package xcolor Info: Model `Hsb' substituted by `hsb' on input line 1356. +Package xcolor Info: Model `tHsb' substituted by `hsb' on input line 1357. +Package xcolor Info: Model `HSB' substituted by `hsb' on input line 1358. +Package xcolor Info: Model `Gray' substituted by `gray' on input line 1359. +Package xcolor Info: Model `wave' substituted by `hsb' on input line 1360. +) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcore.code.tex +Package: pgfcore 2010/04/11 v2.10 (rcs-revision 1.7) + +(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex +(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathcalc.code.tex +(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathutil.code.tex) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathparser.code.tex +\pgfmath@dimen=\dimen140 +\pgfmath@count=\count120 +\pgfmath@box=\box29 +\pgfmath@toks=\toks35 +\pgfmath@stack@operand=\toks36 +\pgfmath@stack@operation=\toks37 +) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.code.tex +(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.basic.code +.tex) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.trigonomet +ric.code.tex) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.random.cod +e.tex) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.comparison +.code.tex) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.base.code. +tex) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.round.code +.tex) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.misc.code. +tex))) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfloat.code.tex +\c@pgfmathroundto@lastzeros=\count121 +)) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepoints.code.te +x +File: pgfcorepoints.code.tex 2010/04/09 (rcs-revision 1.20) +\pgf@picminx=\dimen141 +\pgf@picmaxx=\dimen142 +\pgf@picminy=\dimen143 +\pgf@picmaxy=\dimen144 +\pgf@pathminx=\dimen145 +\pgf@pathmaxx=\dimen146 +\pgf@pathminy=\dimen147 +\pgf@pathmaxy=\dimen148 +\pgf@xx=\dimen149 +\pgf@xy=\dimen150 +\pgf@yx=\dimen151 +\pgf@yy=\dimen152 +\pgf@zx=\dimen153 +\pgf@zy=\dimen154 +) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathconstruct. +code.tex +File: pgfcorepathconstruct.code.tex 2010/08/03 (rcs-revision 1.24) +\pgf@path@lastx=\dimen155 +\pgf@path@lasty=\dimen156 +) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathusage.code +.tex +File: pgfcorepathusage.code.tex 2008/04/22 (rcs-revision 1.12) +\pgf@shorten@end@additional=\dimen157 +\pgf@shorten@start@additional=\dimen158 +) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorescopes.code.te +x +File: pgfcorescopes.code.tex 2010/09/08 (rcs-revision 1.34) +\pgfpic=\box30 +\pgf@hbox=\box31 +\pgf@layerbox@main=\box32 +\pgf@picture@serial@count=\count122 +) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoregraphicstate.c +ode.tex +File: pgfcoregraphicstate.code.tex 2008/04/22 (rcs-revision 1.9) +\pgflinewidth=\dimen159 +) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoretransformation +s.code.tex +File: pgfcoretransformations.code.tex 2009/06/10 (rcs-revision 1.11) +\pgf@pt@x=\dimen160 +\pgf@pt@y=\dimen161 +\pgf@pt@temp=\dimen162 +) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorequick.code.tex +File: pgfcorequick.code.tex 2008/10/09 (rcs-revision 1.3) +) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreobjects.code.t +ex +File: pgfcoreobjects.code.tex 2006/10/11 (rcs-revision 1.2) +) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepathprocessing +.code.tex +File: pgfcorepathprocessing.code.tex 2008/10/09 (rcs-revision 1.8) +) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorearrows.code.te +x +File: pgfcorearrows.code.tex 2008/04/23 (rcs-revision 1.11) +) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreshade.code.tex +File: pgfcoreshade.code.tex 2008/11/23 (rcs-revision 1.13) +\pgf@max=\dimen163 +\pgf@sys@shading@range@num=\count123 +) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreimage.code.tex +File: pgfcoreimage.code.tex 2010/03/25 (rcs-revision 1.16) + +(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoreexternal.code. +tex +File: pgfcoreexternal.code.tex 2010/09/01 (rcs-revision 1.17) +\pgfexternal@startupbox=\box33 +)) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorelayers.code.te +x +File: pgfcorelayers.code.tex 2010/08/27 (rcs-revision 1.2) +) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcoretransparency.c +ode.tex +File: pgfcoretransparency.code.tex 2008/01/17 (rcs-revision 1.2) +) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/basiclayer/pgfcorepatterns.code. +tex +File: pgfcorepatterns.code.tex 2009/07/02 (rcs-revision 1.3) +))) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmoduleshapes.code.tex +File: pgfmoduleshapes.code.tex 2010/09/09 (rcs-revision 1.13) +\pgfnodeparttextbox=\box34 +) (/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmoduleplot.code.tex +File: pgfmoduleplot.code.tex 2010/10/22 (rcs-revision 1.8) +) +(/usr/share/texlive/texmf-dist/tex/latex/pgf/compatibility/pgfcomp-version-0-65 +.sty +Package: pgfcomp-version-0-65 2007/07/03 v2.10 (rcs-revision 1.7) +\pgf@nodesepstart=\dimen164 +\pgf@nodesepend=\dimen165 +) +(/usr/share/texlive/texmf-dist/tex/latex/pgf/compatibility/pgfcomp-version-1-18 +.sty +Package: pgfcomp-version-1-18 2007/07/23 v2.10 (rcs-revision 1.1) +)) (/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgffor.sty +(/usr/share/texlive/texmf-dist/tex/latex/pgf/utilities/pgfkeys.sty +(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeys.code.tex)) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/utilities/pgffor.code.tex +Package: pgffor 2010/03/23 v2.10 (rcs-revision 1.18) +\pgffor@iter=\dimen166 +\pgffor@skip=\dimen167 +\pgffor@stack=\toks38 +\pgffor@toks=\toks39 +)) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/tikz.code.tex +Package: tikz 2010/10/13 v2.10 (rcs-revision 1.76) + +(/usr/share/texlive/texmf-dist/tex/generic/pgf/libraries/pgflibraryplothandlers +.code.tex +File: pgflibraryplothandlers.code.tex 2010/05/31 v2.10 (rcs-revision 1.15) +\pgf@plot@mark@count=\count124 +\pgfplotmarksize=\dimen168 +) +\tikz@lastx=\dimen169 +\tikz@lasty=\dimen170 +\tikz@lastxsaved=\dimen171 +\tikz@lastysaved=\dimen172 +\tikzleveldistance=\dimen173 +\tikzsiblingdistance=\dimen174 +\tikz@figbox=\box35 +\tikz@tempbox=\box36 +\tikztreelevel=\count125 +\tikznumberofchildren=\count126 +\tikznumberofcurrentchild=\count127 +\tikz@fig@count=\count128 + +(/usr/share/texlive/texmf-dist/tex/generic/pgf/modules/pgfmodulematrix.code.tex +File: pgfmodulematrix.code.tex 2010/08/24 (rcs-revision 1.4) +\pgfmatrixcurrentrow=\count129 +\pgfmatrixcurrentcolumn=\count130 +\pgf@matrix@numberofcolumns=\count131 +) +\tikz@expandcount=\count132 + +(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik +zlibrarytopaths.code.tex +File: tikzlibrarytopaths.code.tex 2008/06/17 v2.10 (rcs-revision 1.2) +))) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik +zlibraryarrows.code.tex +File: tikzlibraryarrows.code.tex 2008/01/09 v2.10 (rcs-revision 1.1) + +(/usr/share/texlive/texmf-dist/tex/generic/pgf/libraries/pgflibraryarrows.code. +tex +File: pgflibraryarrows.code.tex 2008/10/27 v2.10 (rcs-revision 1.9) +\arrowsize=\dimen175 +)) +(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik +zlibraryautomata.code.tex +File: tikzlibraryautomata.code.tex 2008/07/14 v2.10 (rcs-revision 1.3) + +(/usr/share/texlive/texmf-dist/tex/generic/pgf/frontendlayer/tikz/libraries/tik +zlibraryshapes.multipart.code.tex +File: tikzlibraryshapes.multipart.code.tex 2008/01/09 v2.10 (rcs-revision 1.1) + +(/usr/share/texlive/texmf-dist/tex/generic/pgf/libraries/shapes/pgflibraryshape +s.multipart.code.tex +File: pgflibraryshapes.multipart.code.tex 2010/01/07 v2.10 (rcs-revision 1.2) +\pgfnodepartlowerbox=\box37 +\pgfnodeparttwobox=\box38 +\pgfnodepartthreebox=\box39 +\pgfnodepartfourbox=\box40 +\pgfnodeparttwentybox=\box41 +\pgfnodepartnineteenbox=\box42 +\pgfnodeparteighteenbox=\box43 +\pgfnodepartseventeenbox=\box44 +\pgfnodepartsixteenbox=\box45 +\pgfnodepartfifteenbox=\box46 +\pgfnodepartfourteenbox=\box47 +\pgfnodepartthirteenbox=\box48 +\pgfnodeparttwelvebox=\box49 +\pgfnodepartelevenbox=\box50 +\pgfnodeparttenbox=\box51 +\pgfnodepartninebox=\box52 +\pgfnodeparteightbox=\box53 +\pgfnodepartsevenbox=\box54 +\pgfnodepartsixbox=\box55 +\pgfnodepartfivebox=\box56 +))) +(/usr/share/texlive/texmf-dist/tex/generic/babel/babel.sty +Package: babel 2008/07/08 v3.8m The Babel package + +(/usr/share/texlive/texmf-dist/tex/generic/babel/frenchb.ldf +Language: frenchb 2009/03/16 v2.3d French support from the babel system + +(/usr/share/texlive/texmf-dist/tex/generic/babel/babel.def +File: babel.def 2008/07/08 v3.8m Babel common definitions +\babel@savecnt=\count133 +\U@D=\dimen176 +) +Package babel Info: Making : an active character on input line 120. +Package babel Info: Making ; an active character on input line 121. +Package babel Info: Making ! an active character on input line 122. +Package babel Info: Making ? an active character on input line 123. +\FB@Mht=\dimen177 +\std@mcc=\count134 +\dec@mcc=\count135 +\parindentFFN=\dimen178 + +************************************* +* Local config file frenchb.cfg used +* +(/usr/share/texlive/texmf-dist/tex/generic/babel/frenchb.cfg)) +(/usr/share/texlive/texmf-dist/tex/generic/babel/english.ldf +Language: english 2005/03/30 v3.3o English support from the babel system +\l@canadian = a dialect from \language\l@american +\l@australian = a dialect from \language\l@british +\l@newzealand = a dialect from \language\l@british +)) +(/usr/share/texlive/texmf-dist/tex/latex/carlisle/scalefnt.sty) +(/usr/share/texlive/texmf-dist/tex/latex/microtype/microtype.sty +Package: microtype 2010/01/10 v2.4 Micro-typography with pdfTeX (RS) +\MT@toks=\toks40 +\MT@count=\count136 +LaTeX Info: Redefining \lsstyle on input line 1597. +LaTeX Info: Redefining \lslig on input line 1597. +\MT@outer@space=\skip52 +LaTeX Info: Redefining \textls on input line 1605. +\MT@outer@kern=\dimen179 +LaTeX Info: Redefining \textmicrotypecontext on input line 2156. +Package microtype Info: Loading configuration file microtype.cfg. + +(/usr/share/texlive/texmf-dist/tex/latex/microtype/microtype.cfg +File: microtype.cfg 2010/01/10 v2.4 microtype main configuration file (RS) +)) +\c@definition=\count137 +\c@property=\count138 + +(./FDL2012.aux + +LaTeX Warning: Label `AKSNegCex' multiply defined. + +) +\openout1 = `FDL2012.aux'. + +LaTeX Font Info: Checking defaults for OML/cmm/m/it on input line 38. +LaTeX Font Info: ... okay on input line 38. +LaTeX Font Info: Checking defaults for T1/cmr/m/n on input line 38. +LaTeX Font Info: ... okay on input line 38. +LaTeX Font Info: Checking defaults for OT1/cmr/m/n on input line 38. +LaTeX Font Info: ... okay on input line 38. +LaTeX Font Info: Checking defaults for OMS/cmsy/m/n on input line 38. +LaTeX Font Info: ... okay on input line 38. +LaTeX Font Info: Checking defaults for OMX/cmex/m/n on input line 38. +LaTeX Font Info: ... okay on input line 38. +LaTeX Font Info: Checking defaults for U/cmr/m/n on input line 38. +LaTeX Font Info: ... okay on input line 38. +LaTeX Font Info: Checking defaults for TS1/cmr/m/n on input line 38. +LaTeX Font Info: Try loading font information for TS1+cmr on input line 38. + (/usr/share/texlive/texmf-dist/tex/latex/base/ts1cmr.fd +File: ts1cmr.fd 1999/05/25 v2.5h Standard LaTeX font definitions +) +LaTeX Font Info: ... okay on input line 38. +LaTeX Font Info: Checking defaults for PD1/pdf/m/n on input line 38. +LaTeX Font Info: ... okay on input line 38. +LaTeX Font Info: Try loading font information for T1+lmr on input line 38. + +(/usr/share/texlive/texmf-dist/tex/latex/lm/t1lmr.fd +File: t1lmr.fd 2009/10/30 v1.6 Font defs for Latin Modern +) +\AtBeginShipoutBox=\box57 +Package hyperref Info: Link coloring OFF on input line 38. + +(/usr/share/texlive/texmf-dist/tex/latex/hyperref/nameref.sty +Package: nameref 2010/04/30 v2.40 Cross-referencing by name of section + +(/usr/share/texlive/texmf-dist/tex/generic/oberdiek/gettitlestring.sty +Package: gettitlestring 2010/12/03 v1.4 Cleanup title references (HO) +) +\c@section@level=\count139 +) +LaTeX Info: Redefining \ref on input line 38. +LaTeX Info: Redefining \pageref on input line 38. +LaTeX Info: Redefining \nameref on input line 38. + +(./FDL2012.out) (./FDL2012.out) +\@outlinefile=\write4 +\openout4 = `FDL2012.out'. + + +(/usr/share/texlive/texmf-dist/tex/context/base/supp-pdf.mkii +[Loading MPS to PDF converter (version 2006.09.02).] +\scratchcounter=\count140 +\scratchdimen=\dimen180 +\scratchbox=\box58 +\nofMPsegments=\count141 +\nofMParguments=\count142 +\everyMPshowfont=\toks41 +\MPscratchCnt=\count143 +\MPscratchDim=\dimen181 +\MPnumerator=\count144 +\makeMPintoPDFobject=\count145 +\everyMPtoPDFconversion=\toks42 +) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/epstopdf-base.sty +Package: epstopdf-base 2010/02/09 v2.5 Base part for package epstopdf + +(/usr/share/texlive/texmf-dist/tex/latex/oberdiek/grfext.sty +Package: grfext 2010/08/19 v1.1 Managing graphics extensions (HO) +) +Package grfext Info: Graphics extension search list: +(grfext) [.png,.pdf,.jpg,.mps,.jpeg,.jbig2,.jb2,.PNG,.PDF,.JPG,.JPE +G,.JBIG2,.JB2,.eps] +(grfext) \AppendGraphicsExtensions on input line 452. + +(/usr/share/texlive/texmf-dist/tex/latex/latexconfig/epstopdf-sys.cfg +File: epstopdf-sys.cfg 2010/07/13 v1.3 Configuration of (r)epstopdf for TeX Liv +e +)) +ABD: EveryShipout initializing macros +LaTeX Info: Redefining \degres on input line 38. + + +Package frenchb.ldf Warning: The definition of \@makecaption has been changed, +(frenchb.ldf) frenchb will NOT customise it; +(frenchb.ldf) reported on input line 38. + +LaTeX Info: Redefining \dots on input line 38. +LaTeX Info: Redefining \up on input line 38. +LaTeX Info: Redefining \microtypecontext on input line 38. +Package microtype Info: Generating PDF output. +Package microtype Info: Character protrusion enabled (level 2). +Package microtype Info: Using default protrusion set `alltext'. +Package microtype Info: Automatic font expansion enabled (level 2), +(microtype) stretch: 20, shrink: 20, step: 1, non-selected. +Package microtype Info: Using default expansion set `basictext'. +Package microtype Info: No tracking. +Package microtype Info: No adjustment of interword spacing. +Package microtype Info: Adjustment of character kerning enabled. +Package microtype Info: Using default kerning set `alltext'. +Package microtype Info: Redefining babel's language switching commands. +Package microtype Info: Switching off French babel's active characters (:;!?). +(/usr/share/texlive/texmf-dist/tex/latex/microtype/mt-cmr.cfg +File: mt-cmr.cfg 2009/11/09 v2.0 microtype config. file: Computer Modern Roman +(RS) +) +LaTeX Font Info: Try loading font information for OT1+lmr on input line 42. + +(/usr/share/texlive/texmf-dist/tex/latex/lm/ot1lmr.fd +File: ot1lmr.fd 2009/10/30 v1.6 Font defs for Latin Modern +)<> +LaTeX Font Info: Try loading font information for OML+lmm on input line 42. + +(/usr/share/texlive/texmf-dist/tex/latex/lm/omllmm.fd +File: omllmm.fd 2009/10/30 v1.6 Font defs for Latin Modern +) +LaTeX Font Info: Try loading font information for OMS+lmsy on input line 42. + + +(/usr/share/texlive/texmf-dist/tex/latex/lm/omslmsy.fd +File: omslmsy.fd 2009/10/30 v1.6 Font defs for Latin Modern +) +LaTeX Font Info: Try loading font information for OMX+lmex on input line 42. + + +(/usr/share/texlive/texmf-dist/tex/latex/lm/omxlmex.fd +File: omxlmex.fd 2009/10/30 v1.6 Font defs for Latin Modern +) +LaTeX Font Info: External font `lmex10' loaded for size +(Font) <12> on input line 42. +LaTeX Font Info: External font `lmex10' loaded for size +(Font) <8> on input line 42. +LaTeX Font Info: External font `lmex10' loaded for size +(Font) <6> on input line 42. +LaTeX Font Info: Try loading font information for U+msa on input line 42. + +(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsa.fd +File: umsa.fd 2009/06/22 v3.00 AMS symbols A +) +(/usr/share/texlive/texmf-dist/tex/latex/microtype/mt-msa.cfg +File: mt-msa.cfg 2006/02/04 v1.1 microtype config. file: AMS symbols (a) (RS) +) +LaTeX Font Info: Try loading font information for U+msb on input line 42. + +(/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsb.fd +File: umsb.fd 2009/06/22 v3.00 AMS symbols B +) +(/usr/share/texlive/texmf-dist/tex/latex/microtype/mt-msb.cfg +File: mt-msb.cfg 2005/06/01 v1.0 microtype config. file: AMS symbols (b) (RS) +) +LaTeX Font Info: External font `lmex10' loaded for size +(Font) <10> on input line 73. +LaTeX Font Info: External font `lmex10' loaded for size +(Font) <7> on input line 73. +LaTeX Font Info: External font `lmex10' loaded for size +(Font) <5> on input line 73. + + +LaTeX Warning: Citation `GrumbergLong91assume_guarantee' on page 1 undefined on + input line 73. + + +LaTeX Warning: Citation `HQR98assume_guarantee' on page 1 undefined on input li +ne 73. + +[1{/usr/share/texlive/texmf/fonts/map/pdftex/updmap/pdftex.map} + + + +] + +LaTeX Warning: Citation `GrafSaidi97abstract_construct' on page 2 undefined on +input line 77. + + +LaTeX Warning: Citation `clarke00cegar' on page 2 undefined on input line 80. + + +Overfull \hbox (1.1072pt too wide) in paragraph at lines 80--81 +[]\T1/lmr/m/n/10 (-20) A few years later, an in-ter-est-ing abstraction-refinem +ent + [] + + +LaTeX Warning: Citation `XieBrowne03composition_soft' on page 2 undefined on in +put line 82. + + +LaTeX Warning: Citation `PMT02compositional_MC' on page 2 undefined on input li +ne 85. + + +LaTeX Warning: Citation `SNBE06property_based' on page 2 undefined on input lin +e 89. + + +LaTeX Warning: Citation `microsoft04SLAM' on page 2 undefined on input line 92. + + + +LaTeX Warning: Citation `berkeley07BLAST' on page 2 undefined on input line 92. + + + +LaTeX Warning: Citation `Kroening_al07vcegar' on page 2 undefined on input line + 92. + + +LaTeX Warning: Citation `pwk2009-date' on page 2 undefined on input line 95. + + +LaTeX Warning: Citation `Kunz_al11ipc_abs' on page 2 undefined on input line 95 +. + + +LaTeX Warning: Citation `braunstein07ctl_abstraction' on page 2 undefined on in +put line 98. + + +LaTeX Warning: Citation `bara08abs_composant' on page 2 undefined on input line + 98. + + +LaTeX Warning: Citation `clarke00cegar' on page 2 undefined on input line 104. + + +LaTeX Warning: Citation `braunstein07ctl_abstraction' on page 2 undefined on in +put line 108. + +LaTeX Font Info: Try loading font information for TS1+lmr on input line 114. + +(/usr/share/texlive/texmf-dist/tex/latex/lm/ts1lmr.fd +File: ts1lmr.fd 2009/10/30 v1.6 Font defs for Latin Modern +) [2] +LaTeX Font Info: Try loading font information for U+bbold on input line 144. + + +(/usr/share/texlive/texmf-dist/tex/latex/bbold/Ubbold.fd) + +File: our_CEGAR_Loop_Enhanced_2S_PNG.png Graphic file (type png) + + +Package pdftex.def Info: our_CEGAR_Loop_Enhanced_2S_PNG.png used on input line +182. +(pdftex.def) Requested size: 238.64096pt x 119.69688pt. + + +LaTeX Warning: Citation `braunstein07ctl_abstraction' on page 3 undefined on in +put line 190. + + +LaTeX Warning: Citation `bara08abs_composant' on page 3 undefined on input line + 190. + + +LaTeX Warning: Citation `ucberkeley96vis' on page 3 undefined on input line 192 +. + +[3 <./our_CEGAR_Loop_Enhanced_2S_PNG.png>] +Underfull \hbox (badness 10000) in paragraph at lines 224--230 + + [] + + +Underfull \hbox (badness 10000) in paragraph at lines 224--230 + + [] + + +Underfull \hbox (badness 10000) in paragraph at lines 224--230 + + [] + + +Underfull \hbox (badness 10000) in paragraph at lines 238--241 + + [] + + +Underfull \hbox (badness 10000) in paragraph at lines 238--241 + + [] + + +Overfull \hbox (0.81122pt too wide) in paragraph at lines 244--245 +[]\T1/lmr/m/it/10 (-20) If $\OMS/lmsy/m/n/10 8\OML/lmm/m/it/10 k$ \T1/lmr/m/it/ +10 (-20) we have $[] \OMS/lmsy/m/n/10 ^^R \OML/lmm/m/it/10 V[]$ \T1/lmr/m/it/10 + (-20) and $\OMS/lmsy/m/n/10 8\OML/lmm/m/it/10 v[] \OMS/lmsy/m/n/10 2 []\OML/lm +m/m/it/10 ; s[]\OMS/lmsy/m/n/10 j[] \OT1/lmr/m/n/10 (-20) = + [] + + +Overfull \hbox (3.01537pt too wide) in paragraph at lines 261--264 +\OML/lmm/m/it/10 max\OT1/lmr/m/n/10 (-20) (\OML/lmm/m/it/10 depth\OT1/lmr/m/n/1 +0 (-20) (\OML/lmm/m/it/10 Gv[]\OT1/lmr/m/n/10 (-20) )\OML/lmm/m/it/10 ; depth\O +T1/lmr/m/n/10 (-20) (\OML/lmm/m/it/10 Gv[]\OT1/lmr/m/n/10 (-20) )\OML/lmm/m/it/ +10 ; :::; depth\OT1/lmr/m/n/10 (-20) (\OML/lmm/m/it/10 Gv[]\OT1/lmr/m/n/10 (-20 +) )\OML/lmm/m/it/10 ; :::;$ + [] + +[4] +Underfull \hbox (badness 10000) in paragraph at lines 296--297 + + [] + + +File: Dependency_graph_weight_PNG.png Graphic file (type png) + + +Package pdftex.def Info: Dependency_graph_weight_PNG.png used on input line 319 +. +(pdftex.def) Requested size: 112.16878pt x 167.12395pt. + +Underfull \hbox (badness 10000) in paragraph at lines 344--345 + + [] + +[5 <./Dependency_graph_weight_PNG.png>] +Overfull \hbox (11.93875pt too wide) in paragraph at lines 357--358 +[]$\OML/lmm/m/it/10 S[] \OT1/lmr/m/n/10 (-20) = \OMS/lmsy/m/n/10 f\OML/lmm/m/it +/10 s[]; s[]; s[]; :::; s[]; s[]; :::; s[]\OMS/lmsy/m/n/10 g$ + [] + + +File: K_sigma_i_S_PNG.png Graphic file (type png) + + +Package pdftex.def Info: K_sigma_i_S_PNG.png used on input line 380. +(pdftex.def) Requested size: 33.12366pt x 213.79822pt. + + +LaTeX Warning: `!h' float specifier changed to `!ht'. + + +Underfull \hbox (badness 10000) in paragraph at lines 420--421 + + [] + + +Underfull \hbox (badness 10000) in paragraph at lines 436--437 + + [] + +[6 <./K_sigma_i_S_PNG.png>] +No file FDL2012.bbl. +Package atveryend Info: Empty hook `BeforeClearDocument' on input line 462. +[7 + +] +Package atveryend Info: Empty hook `AfterLastShipout' on input line 462. + (./FDL2012.aux) +Package atveryend Info: Executing hook `AtVeryEndDocument' on input line 462. +Package atveryend Info: Executing hook `AtEndAfterFileList' on input line 462. +Package rerunfilecheck Info: File `FDL2012.out' has not changed. +(rerunfilecheck) Checksum: BA9407F3BD913632A2377663C2D85E5A;965. + + +LaTeX Warning: There were undefined references. + + +LaTeX Warning: There were multiply-defined labels. + + ) +Here is how much of TeX's memory you used: + 18496 strings out of 492508 + 332773 string characters out of 3115493 + 452738 words of memory out of 3000000 + 21197 multiletter control sequences out of 15000+200000 + 69857 words of font info for 127 fonts, out of 3000000 for 9000 + 1648 hyphenation exceptions out of 8191 + 56i,10n,68p,951b,935s stack positions out of 5000i,500n,10000p,200000b,50000s +{/usr/share/texlive/texmf-dist/fonts/enc/dvips/lm/lm-ts1.enc}{/usr/share/texl +ive/texmf-dist/fonts/enc/dvips/lm/lm-mathsy.enc}{/usr/share/texlive/texmf-dist/ +fonts/enc/dvips/lm/lm-rm.enc}{/usr/share/texlive/texmf-dist/fonts/enc/dvips/lm/ +lm-mathit.enc}{/usr/share/texlive/texmf-dist/fonts/enc/dvips/lm/lm-ec.enc}{/usr +/share/texlive/texmf-dist/fonts/enc/dvips/lm/lm-mathex.enc} +!pdfTeX error: pdflatex (file bbold10.pfb): cannot open Type 1 font file for re +ading + ==> Fatal error occurred, no output PDF file produced! Index: /papers/FDL2012/FDL2012.out =================================================================== --- /papers/FDL2012/FDL2012.out (revision 48) +++ /papers/FDL2012/FDL2012.out (revision 48) @@ -0,0 +1,14 @@ +\BOOKMARK [1][-]{section.1}{ Introduction}{}% 1 +\BOOKMARK [2][-]{subsection.1.1}{ Related Works}{section.1}% 2 +\BOOKMARK [1][-]{section.2}{ Our Framework}{}% 3 +\BOOKMARK [2][-]{subsection.2.1}{ AKS generation from CTL Properties}{section.2}% 4 +\BOOKMARK [2][-]{subsection.2.2}{ CEGAR Loop}{section.2}% 5 +\BOOKMARK [1][-]{section.3}{ Abstraction Generation and Refinement}{}% 6 +\BOOKMARK [2][-]{subsection.3.1}{ Generalities}{section.3}% 7 +\BOOKMARK [3][-]{subsubsection.3.1.1}{ Refinement}{subsection.3.1}% 8 +\BOOKMARK [3][-]{subsubsection.3.1.2}{ The Counterexample}{subsection.3.1}% 9 +\BOOKMARK [2][-]{subsection.3.2}{ Pre-processing and pertinency ordering of properties}{section.3}% 10 +\BOOKMARK [2][-]{subsection.3.3}{ Initial abstraction generation}{section.3}% 11 +\BOOKMARK [2][-]{subsection.3.4}{ Abstraction refinement}{section.3}% 12 +\BOOKMARK [1][-]{section.4}{ Experimental results}{}% 13 +\BOOKMARK [1][-]{section.5}{ Conclusion and Future Works}{}% 14 Index: /papers/FDL2012/FDL2012.tex =================================================================== --- /papers/FDL2012/FDL2012.tex (revision 48) +++ /papers/FDL2012/FDL2012.tex (revision 48) @@ -0,0 +1,462 @@ + \documentclass{article} + + \usepackage{spconf} +\usepackage{cmap} +\usepackage[utf8]{inputenc} +\usepackage[T1]{fontenc} +\usepackage{lmodern} +\usepackage{textcomp} +\usepackage{amsmath} +\usepackage{amssymb} +\usepackage{amsfonts} +\usepackage{bbm} +\usepackage{bbold} +\usepackage{amsthm} +\usepackage{array} +\usepackage{verbatim} +\usepackage{hyperref} +\usepackage{booktabs} +\usepackage{graphicx} +\usepackage{tikz} +\usepackage{pgf} +\usetikzlibrary{arrows,automata} +\usepackage[francais, american]{babel} +\usepackage[babel=true,kerning=true]{microtype} + +\newtheorem{definition}{Definition} +\newtheorem{property}{Property} + + + \title{ Compositional System Verification: Exploiting components' verified properties in the abstraction-refinement process} + \name{Syed Hussein S. ALWI, Emmanuelle ENCRENAZ and C\'{e}cile BRAUNSTEIN} +% \thanks{This work was supported by...}} + \address{Universit\'{e} Pierre et Marie Curie Paris 6, \\ + LIP6-SOC (CNRS UMR 7606), \\ + 4, place Jussieu, \\ + 75005 Paris, FRANCE. } + +\begin{document} + % OPTIONAL --> \ninept <-- OPTIONAL, for nine pt only + +\maketitle + +\begin{abstract} +Embedded systems are usually composed of several components and in practice, these components generally have been independently verified to ensure that they respect their specifications before being integrated into a larger system. Therefore, we would like to exploit the specification (i.e. verified CTL properties) of the components in the objective of verifying a global property of the system. A complete concrete system may not be directly verifiable due to the state explosion problem, thus abstraction and eventually refinement process are required. In this paper, we propose a technique to select properties in order to generate a good abstraction and reduce refinement iterations. We have tested this technique on a set of benchmarks which shows that our approach is promising in comparison to other abstraction-refinement techniques. +\end{abstract} + +\begin{keywords} +Compositional verification, CTL properties, CEGAR, model-checking +\end{keywords} + + +%\def\abstract{\begin{center} +%{\bf ABSTRACT\vspace{-.5em}\vspace{0pt}} +%\end{center}} +%\def\endabstract{\par} + +\section{Introduction} + +The embedded systems correspond to the integration into the same electronic circuit, a huge number of complex functionalities performed by several heterogenous components. Current SoC (System on Chips) contain multiple processors executing numerous cooperating tasks, specialized co-processors (for particular data treatment or communication purposes), Radio-Frequency components, etc. These systems are usually submitted to safety and robustness requirements. Depending on their application domains, their failure may induce serious damages. Generally failures on these systems are unacceptable and have to be avoided. + + +Therefore, it is important to ensure, during their design phase, their correctness with respect to their specifications. Errors found late in the design of these systems is a major problem for electronic circuit designers and programmers as it may delay getting a new product to the market or cause failure of some critical devices that are already in use. System verification, indeed, guarantees a certain level of quality in terms of safety and reliabilty while reducing financial risk. + + +The main challenge in model checking is dealing with the state space combinatorial explosion phenomenon. Systems with many components that can interact with each other or systems with data structure that can assume many different values will increase the number of state transition possibilities at a particular instance. In such cases, the number of global states will grow exponentially in function of the complexity of the system and unfortunately may surpasses our computation capacity. + + +In this research we would like to contribute in the improvement of the model-checking technique through the combination of the compositional method and the abstraction-refinement procedure which would allow the verification of complex structured systems and cope with the state space explosion phenomenon. Till now, compositional analysis and abstraction-refinement procedure have been essentially explored seperately, hence the desire to investigate the potential of the combination of these two techniques. The research will lead to a proposal of a development and verification process based on association of several components. + + +\subsection{Related Works} + +We are inspired by the compositional strategy is based on the assume-guarantee reasoning where assumptions are made on other components of the systems when verifying one component. In other words, we show that a component $C_1$ guarantees certain properties $P_1$ on the hypothesis that component $C_2$ provides certain properties $P_2$ and vice-versa for $C_2$. If that's the case, then we can claim that the composition of $C_1$ and $C_2$, both executed in parallel and may interact with each other, guarantees the properties $P_1$ and $P_2$ unconditionally. Several works have manipulated this technique notably in \cite{GrumbergLong91assume_guarantee} where Grumberg and Long described the methodology using a subset of CTL in their framework and later in \cite{HQR98assume_guarantee} where Herzinger and al. presented their successful implementations and case study regarding this approach. + + + +A strategy to overcome the state explosion problem is by abstraction. A method for the construction of an abstract state graph of an arbitrary system automatically was proposed by Graf and Saidi \cite{GrafSaidi97abstract_construct} using Pvs theorem prover. Here, the abstract states are generated from the valuations of a set of predicates on the concrete variables. The construction approach is automatic and incremental. + + +A few years later, an interesting abstraction-refinement methodology called counterexample-guided abstraction refinement (CEGAR) was proposed by Clarke and al. \cite{clarke00cegar}. The abstraction was done by generating an abstract model of the system by considering only the variables that possibly have a role in verifying a particular property. In this technique, the counterexample provided by the model-checker in case of failure is used to refine the system. + +There have been works related to this PhD research domain in the recent years, for example, Xie and Browne have proposed a method for software verification based on composistion of several components \cite{XieBrowne03composition_soft}. Their main objective is developing components that could be reused with certitude that their behaviors will always respect their specification when associated in a proper composition. Therefore, temporal properties of the software are specified, verified and packaged with the component for possible reuse. The implementation of this approach on software have been succesful and the application of the assume-guarantee reasoning has considerably reduced the model checking complexity. + + +In another research, Peng, Mokhtari and Tahar have presented a possible implementation of assume-guarantee approach where the specification are in ACTL \cite{PMT02compositional_MC}. Moreover, they managed to perform the synthetisation of the ACTL formulas into Verilog HDL behavior level program. The synthesized program can be used to check properties that the system's components must guarantee. + + + +In 2006, Hans Eveking and al. introduced a technique of normalizing properties and transforming those normalized properties into an executable design description \cite{SNBE06property_based}. The generation of abstraction from PSL/Sugar specification language could then be used in the verification process to speed up the operation. This technique also allows the tests of specifications without having to build an implementation first. + + +Several tools using counterexample-guided abstraction refinement technique have been developed such as SLAM, a software model-checker by Microsoft Research \cite{microsoft04SLAM}, BLAST (Berkeley Lazy Abstraction Software Verification Tool), a software model-checker for C programs \cite{berkeley07BLAST} and VCEGAR (Verilog Counterexample Guided Abstraction Refinement), a hardware model-checker which performs verification at the RTL (Register Transfer Language) level \cite{Kroening_al07vcegar}. + + +Recently, an approach based on abstraction refinement technique has been proposed by Kroening and al. to strengthen properties in a finite state system specification \cite{pwk2009-date}. The method, which fundamentally relies on the notion of vacuity, generally produces shorter and stronger properties. In 2011, the electronic design automation group of University of Kaiserslautern suggested a method to formally verify low-level software in conjunction with the hardware by exploiting the Interval Property Checking (IPC) with abstraction technique \cite{Kunz_al11ipc_abs}. This method improves the robustness of interval property checking when proving long global interval properties of embedded systems. + + +Nevertheless, LIP6 has proposed a method to build abstractions of components into AKS (Abstract Kripke Structure), based on the set of the properties (CTL) each component verifies in 2007 \cite{braunstein07ctl_abstraction}. The method is actually a tentative to associate compositional and abstraction-refinement verification techniques. The generations of AKS from CTL formula have been successfully automated \cite{bara08abs_composant}. These work will be the base of the techniques in this paper. + + + +\section{Our Framework} + +The model-checking technique used in this research is based on the Counterexample-guided Abstraction Refinement (CEGAR) methodology \cite{clarke00cegar}. We would like to verify whether a concrete model, $M$ presumedly huge sized and might consist of several components, satisfies a global property $\varphi$. Due to state space combinatorial explosion phenomenon that occurs when verifying huge and complex systems, an abstraction or approximation of the concrete model has to be done in order to be able to verify the system with model-checking techniques. + +\subsection{AKS generation from CTL Properties} + +Assume that we have an abstract Kripke structure (AKS) representing the abstract model $\widehat{M}$ of the concrete model of the system M with regard to the property to be verified, $\varphi$. The abstraction method is based on the work described in \cite{ braunstein07ctl_abstraction}. The AKS used is a 6-tuple, \\ $\widehat{M} =(\widehat{AP}, \widehat{S}, \widehat{S}_0, \widehat{L}, \widehat{R}, \widehat{F})$ which is defined as follows: + +\begin{definition} +An abstract Kripke structure,\\ $\widehat{M} =(\widehat{AP}, \widehat{S}, \widehat{S}_0, \widehat{L}, \widehat{R}, \widehat{F})$ is a 6-tuple consisting of : + +\begin{itemize} +\item { $\widehat{AP}$ : a finite set of atomic propositions} +\item { $\widehat{S}$ : a finite set of states} +\item { $\widehat{S}_0 \subseteq \widehat{S}$ : a set of initial states} +\item { $\widehat{L} : \widehat{S} \rightarrow 2^{Lit}$ : a labeling function which labels each state with the set of atomic propositions true in that state. Lit is a set of literals such that $Lit = AP \cup \{\bar{p} | p \in AP \}$. With this labeling definition, an atomic proposition in a state can have 4 different values as detailed below:} + \begin{itemize} + \item {$ p \notin \widehat{L}(s) \wedge \bar{p} \notin \widehat{L}(s) : p $\emph{ is \textbf{unknown} in} s } + \item {$ p \notin \widehat{L}(s) \wedge \bar{p} \in \widehat{L}(s) : p $\emph{ is \textbf{false} in} s} + \item {$ p \in \widehat{L}(s) \wedge \bar{p} \notin \widehat{L}(s) : p $\emph{ is \textbf{true} in} s} + \item {$ p \in \widehat{L}(s) \wedge \bar{p} \in \widehat{L}(s) : p $\emph{ is \textbf{inconsistent} in} s} + \end{itemize} +\item { $\widehat{R} \subseteq \widehat{S} \times \widehat{S}$ : a transition relation where $ \forall s \in \widehat{S}, \exists s' \in \widehat{S}$ such that $(s,s') \in \widehat{R}$ } +\item { $\widehat{F}$ : a set of fairness constraints } +\end{itemize} +\end{definition} +%\bigskip + + +As the abstract model $\widehat{M}$ is generated from the conjunction of verified properties of the components in the concrete model $M$, it can be seen as the composition of the AKS of each property. +%\bigskip + +\begin{definition} +Let $C_j$ be a component of the concrete model $M$ and $\varphi_{j}^k$ is a CTL formula describing a satisfied property of component $C_j$. Let $AKS (\varphi_{C_j^k})$ the AKS generated from $\varphi_j^k$. We have $\forall j \in [1,n]$ and $\forall k \in [1,m]$: + +\begin{itemize} +\item{$ \widehat{C}_j = AKS (\varphi_{C_j^1}) ~||~ AKS (\varphi_{C_j^2} ) ~||~...~||~ AKS (\varphi_{C_j^k}) ~||$\\ $ ...~||~ AKS (\varphi_{C_j^m}) $} +\item{$ \widehat{M} = \widehat{C}_1 ~||~ \widehat{C}_2 ~||~ ... ~||~ \widehat{C}_j ~||~... ~||~ \widehat{C}_n $} +\item{$ V_{\widehat{C}_j} \subseteq V_{C_j}$ (with $V_{\widehat{C}_j}$ and $V_{C_j}$ are variables of $\widehat{C}_j$ and $C_j$ respectively.)} +\end{itemize} + +\hspace*{3mm}with :\\ +\hspace*{5mm}- $ n \in \mathbb{N} $ : the number of components in the model \\ +\hspace*{5mm}- $ m \in \mathbb{N} $ : the number of selected verified properties of a component + +\end{definition} +%\bigskip + + +\begin{definition} +The property to be verified, $\varphi$ is an ACTL formula. ACTL formulas are CTL formulas with only universal path quantifiers: AX, AF, AG and AU. +\end{definition} +%\bigskip + + + +\subsection{CEGAR Loop} + +In CEGAR loop methodology, in order to verify a global property $\varphi$ on a concrete model $M$, an abstraction of the concrete model $\widehat{M}$ is generated and tested in the model-checker. As the abstract model is an upper-approximation of the concrete model and we have restrained our verification to ACTL properties only, if $\varphi$ hold on the the abstract model then we are certain that it holds in the concrete model as well. However, if $\varphi$ doesn't hold in the abstract model then we can't conclude anything regarding the concrete model until the counterexample, $\sigma$ given by the model-checker has been analysed. +%\bigskip + +\begin{definition} +Given $\widehat{M} = (\widehat{AP}, \widehat{S}, \widehat{S}_0, \widehat{L}, \widehat{R}, \widehat{F})$ an abstract model of a concrete model, $M$ and $\varphi$, a global property to be verified on $M$, the model-checking result can be interpreted as follows: + +\begin{itemize} +\item{$\widehat{M} \vDash \varphi \Rightarrow M \vDash \varphi$ : verification completed } +\item{$\widehat{M} \nvDash \varphi$ and $\exists \sigma$ : counterexample analysis required in order to determine whether $M \nvDash \varphi$ or $\widehat{M}$ is too coarse. } +\end{itemize} +\end{definition} + +%\bigskip +We can conclude that the property $\varphi$ doesn't hold in the concrete model $M$ if the counterexample path is possible in M. Otherwise the abstract model at step $i : \widehat{M}_i$, has to be refined if $\widehat{M}_i \nvDash \varphi$ and the counterexample obtained during model-checking was proven to be \emph{spurious}. + + +%\medskip + +\begin{figure}[h!] +% \centering +% \includegraphics[width=1.2\textwidth]{our_CEGAR_Loop_Enhanced_2S_PNG} +% \hspace*{-5mm} + \includegraphics{our_CEGAR_Loop_Enhanced_2S_PNG} + \caption{\label{cegar} Verification Process } +\end{figure} + +%Dans la figure~\ref{étiquette} page~\pageref{étiquette}, 
 + +\bigskip + +As mention earlier, in our verification methodology, we have a concrete model which consists of several components and each component comes with its specification or more precisely, properties that hold in the component. Given a global property $\varphi$, the property to be verified by the composition of the concrete components model, an abstract model is generated by selecting some of the properties of the components which are relevant to $\varphi$. The generation of an abstract model in the form of AKS from CTL formulas, based on the works of Braunstein \cite{braunstein07ctl_abstraction}, has been successfully implemented by Bara \cite{bara08abs_composant}. + +In the case where model-checking failed, the counterexample given by the model- checker \cite{ucberkeley96vis} has to be analysed. We use a SATSolver to check whether the counterexample is spurious or not. When a counterexample is proved to be spurious, we proceed to the refinement phase. + + +\section{Abstraction Generation and Refinement} + +\subsection{Generalities} + +We suppose that our concrete model is a composition of several components and each component has been previously verified. Hence, we have a set of verified properties for each component of the concrete model. The main idea of this technique is that we would like to make use of these properties to generate a better abstract model. Properties of the components that appear to be related to the global property to be verified, $\phi$ are selected to generate the abstract model $\widehat{M}_i$. This method is particularly interesting as it gives a possibility to converge quicker to an abstract model that is sufficient to satisfy the global property $\phi$. + +\subsubsection{Refinement} +The model-checker provides a counterexample when a property failed during model-checking. The counterexample can be \emph{spurious} which means that the path is impossible in the concrete model $M$ or the counterexample is real which implies that $M \nvDash \phi $.When a counterexample is found to be spurious, it means that the current abstract model $\widehat{M}_i$ is too coarse and has to be refined. In this section, we will discuss about the refinement technique based on the integration of more verified properties of the concrete model's components in the abstract model to be generated. Moreover, the refinement step from $\widehat{M}_i$ to $\widehat{M}_{i+1}$ has to be conservative and respects the properties below: + +%\medskip + +\begin{property} +All $\widehat{M}_i$ generated are upper-approximations of $M$. Furthermore, we guarantee that $\widehat{M}_{i+1} \sqsubseteq \widehat{M}_i$. +\end{property} +%\bigskip +\begin{property} +$\sigma_i$ is a counterexample of $\widehat{M}_i$ and $\sigma_i$ is not a counterexample of $\widehat{M}_{i+1}$. +\end{property} + +%\bigskip +%\newpage + +\subsubsection{The Counterexample} + + +The counterexample at a refinement step $i$, $\sigma_i$ is a path in the abstract model $\widehat{M}_i$ which dissatisfy $\phi$. In the counterexample given by the model-checker, the variables' value in each states are boolean. +%\medskip + +\begin{definition} +\textbf{\emph{The counterexample $\sigma_i$ :}} \\ +\\ +Let $\widehat{M}_i =(\widehat{AP}_i, \widehat{S}_i, \widehat{S}_{0i}, \widehat{L}_i, \widehat{R}_i, \widehat{F}_i)$ and let the length of the counterexample, $|\sigma_i| = n$: $ \sigma_i = \langle s_{\bar{a}i,0}, s_{\bar{a}i,1}, s_{\bar{a}i,2}, ... , s_{\bar{a}i,k},$ $s_{\bar{a}i,k+1}, ... , s_{\bar{a}i,n}\rangle $ with $ \forall k \in [0,n-1], ~s_{\bar{a}i,k} \subseteq s_{i,k} \in \widehat{S}_i, ~s_{\bar{a}i,0} \subseteq s_{i,0} \in \widehat{S}_{0i}$ and $(s_{i,k}, s_{i,k+1}) \in \widehat{R}_i$. \\ +Furthermore, for each state in $\sigma_i$ we have $s_{\bar{a}i,k} = \langle v_{\bar{a}i,k}^1, v_{\bar{a}i,k}^2, ... , v_{\bar{a}i,k}^p, ... , v_{\bar{a}i,k}^q \rangle$, $\forall p \in [1,q], ~v_{\bar{a}i,k}^p \in \widehat{V}_{i,k}$ with $\widehat{V}_{i,k} \in 2^q$. \\ +\\ +(\emph{\underline{Note} :} In AKS $\widehat{M}_i$, the variables are actually 3-valued : $\widehat{V}_{i,k} \in 3^q$. We differenciate the 3-valued variables $v_{i,k}^p$ from boolean variables with $v_{\bar{a}i,k}^p$.)\\ + +%\medskip + +\end{definition} + +%\bigskip + +\begin{definition} +\textbf{\emph{Spurious counterexample :}} \\ +\\ +Let $\sigma_c = \langle s_{c,0}, s_{c,1}, s_{c,2}, ... , s_{c,k}, s_{c,k+1}, ... , s_{c,n}\rangle$ a path of length $n$ in the concrete model $M$ and in each state of $\sigma_c$ we have $s_{c,k} = \langle v_{c,k}^1, v_{c,k}^2, ... , v_{c,k}^{p'}, ... , v_{c,k}^{q'} \rangle$ with $\forall p' \in [1,q'], ~v_{i,k}^{p'} \in V_{c,k}$ and $V_{c,k} \in 2^{q'}$.\\ + +\smallskip + +If $\forall k$ we have $\widehat{V}_{i,k} \subseteq V_{c,k}$ and $\forall v_{\bar{a}i,k} \in \widehat{V}_{i,k}, ~s_{i,k}|_{v_{\bar{a}i,k}} = s_{c,k}|_{v_{c,k}} $ then $M \nvDash \phi$ else $\sigma_i$ is \emph{spurious}. + +\end{definition} + + + +\subsection{Pre-processing and pertinency ordering of properties} + +Before generating an abstract model to verify a global property $\phi$, the verified properties of all the components in the concrete model are ordered according to their pertinency in comparison to a global property $\phi$. In order to do so, the variable dependency of the variables present in global property $\phi$ has to be analysed. After this point, we refer to the variables present in the global property $\phi$ as \emph{primary variables}. + +%\bigskip + +The ordering of the properties will be based on the variable dependency graph. The variables in the model are weighted according to their dependency level \emph{vis-à-vis} primary variables and the properties will be weighted according to the sum of the weights of the variables present in it. We have decided to allocate a supplementary weight for variables which are present at the interface of a component whereas variables which do not interfere in the obtention of a primary variable will be weighted 0. Here is how we proceed: + + +\begin{enumerate} + +\item {\emph{Establishment of primary variables' dependency and maximum graph depth}\\ +Each primary variable will be examined and their dependency graph is elobarated. The maximum graph depth among the primary variable dependency graphs will be identified and used to calibrate the weight of all the variables related to the global property. +Given the primary variables of $\phi$, $V_{\phi} = \langle v_{\phi_0}, v_{\phi_1}, ... , v_{\phi_k}, ... , v_{\phi_n} \rangle$ and $G{\_v_{\phi_k}}$ the dependency graph of primary variable $v_{\phi_k}$, we have the maximum graph depth $max_{d} = max(depth(Gv_{\phi_0}), depth(Gv_{\phi_1}), ... , depth(Gv_{\phi_k}), ... ,$\\$ depth(Gv_{\phi_n})) $. + +} + +\item {\emph{Weight allocation for each variables} \\ +Let's suppose $max_d$ is the maximum dependency graph depth calculated and $p$ is the unit weight. We allocate the variable weight as follows: +\begin{itemize} +\item{All the variables at degree $max_d$ of every dependency graph will be allocated the weight of $p$.} + \\ \hspace*{20mm} $Wv_{max_d} = p$ +\item{All the variables at degree $max_d - 1$ of every dependency graph will be allocated the weight of $2Wv_{max_d}$.} +\\ \hspace*{20mm} $Wv_{max_d - 1} = 2Wv_{max_d}$ +\item{...} +\item{All the variables at degree $1$ of every dependency graph will be allocated the weight of $2Wv_{2}$.} + \\ \hspace*{20mm} $Wv_{1} = 2Wv_{2}$ +\item{All the variables at degree $0$ (i.e. the primary variables) will be allocated the weight of $10Wv_{1}$.} + \\ \hspace*{20mm} $Wv_{0} = 10Wv_{1}$ +\end{itemize} + +We can see here that the primary variables are given a considerable ponderation due to their pertinency \emph{vis-à-vis} global property. Furthermore, we will allocate a supplementary weight of $3Wv_{1}$ to variables at the interface of a component as they are the variables which assure the connection between the components if there is at least one variable in the dependency graph established in the previous step in the property. All other non-related variables have a weight equals to $0$. +} + + +\item {\emph{Ordering of the properties} \\ +Properties will be ordered according to the sum of the weight of the variables in it. Therefore, given a property $\varphi_i$ which contains $n+1$ variables, $V_{\varphi_i} = \langle v_{\varphi_{i0}}, v_{\varphi_{i1}}, ... , v_{\varphi_{ik}}, ... , v_{\varphi_{in}} \rangle$, the weight of $\varphi_i$ , $W_{\varphi_i} = \sum_{k=0}^{n} Wv_{\varphi_{ik}}$ . +After this stage, we will check all the properties with weight $>0$ and allocate a supplementary weight of $3Wv_{1}$ for every variable at the interface present in the propery. After this process, the final weight of a property is obtained and the properties will be ordered in a list with the weight decreasing (the heaviest first). We will refer to the ordered list of properties related to the global property $\phi$ as $L_\phi$. + + +} + +\end{enumerate} + +%\bigskip + +\emph{\underline{Example:}} \\ + +For example, if a global property $\phi$ consists of 3 variables: $ p, q, r $ where: +\begin{itemize} +\item{$p$ is dependent of $a$ and $b$} +\item{$b$ is dependent of $c$} +\item{$q$ is dependent of $x$} +\item{$r$ is independent} +\end{itemize} + +Example with unit weight= 50. +The primary variables: $p$, $q$ and $r$ are weighted $100x10=1000$ each. \\ +The secondary level variables : $a$, $b$ and $x$ are weighted $50x2=100$ each. \\ +The tertiary level variable $c$ is weighted $50$. \\ +The weight of a non-related variable is $0$. + +So each verified properties available pertinency will be evaluated by adding the weights of all the variables in it. It is definitely not an exact pertinency calculation of properties but provides a good indicator of their possible impact on the global property. + +\bigskip +\begin{figure}[h!] + \centering +% \includegraphics[width=1.2\textwidth]{Dependency_graph_weight_PNG} +% \hspace*{-15mm} + \includegraphics{Dependency_graph_weight_PNG} + \caption{\label{DepGraphWeight} Example of weighting} +\end{figure} + +%Dans la figure~\ref{étiquette} page~\pageref{étiquette}, 
 + + + +After this pre-processing phase, we will have a list of properties $L_\phi $ ordered according to their pertinency in comparison to the global property. + + + + +\subsection{Initial abstraction generation} + +In the initial abstraction generation, all primary variables have to be represented. Therefore the first element(s) in the list where the primary variables are present will be used to generate the initial abstraction, $\widehat{M}_0$ and we will verify the satisfiability of the global property $\phi$ on this abstract model. If the model-checking failed and the counterexample given is found to be spurious, we will then proceed with the refinement process. + + + +\subsection{Abstraction refinement} + +The refinement process from $\widehat{M}_i$ to $\widehat{M}_{i+1}$ can be seperated into 2 steps: + +\begin{enumerate} + +\item {\emph{\underline{Step 1:}} \\ + +As we would like to ensure the elimination of the counterexample previously found, we filter out properties that don't have an impact on the counterexample $\sigma_i$ thus won't eliminate it. In order to reach this obective, a Kripke Structure of the counterexample $\sigma_i$, $K(\sigma_i)$ is generated. $K(\sigma_i)$ is a succession of states corresponding to the counterexample path which dissatisfies the global property $\phi$. + +\bigskip + +\begin{definition} +\textbf{\emph{The counterexample $\sigma_i$ Kripke Structure $K(\sigma_i)$ :}} \\ +Let a counterexample of length $n$, $ \sigma_i = \langle s_{\bar{a}i,0}, s_{\bar{a}i,1},\\ s_{\bar{a}i,2}, ... , s_{\bar{a}i,k}, s_{\bar{a}i,k+1}, ... , s_{\bar{a}i,n}\rangle $ with $ \forall k \in [0,n-1]$, we have \\ +$K(\sigma_i) = (AP_{\sigma_i}, S_{\sigma_i}, S_{0\sigma_i}, L_{\sigma_i}, R_{\sigma_i})$ a 5-tuple consisting of : + +\begin{itemize} +\item { $AP_{\sigma_i}$ : a finite set of atomic propositions which corresponds to the variables in the abstract model $\widehat{V}_{i}$ } +\item { $S_{\sigma_i} = \{s_{\bar{a}i,0}, s_{\bar{a}i,1}, s_{\bar{a}i,2}, ... , s_{\bar{a}i,k}, s_{\bar{a}i,k+1}, ... , s_{\bar{a}i,n}\}$} +\item { $S_{0\sigma_i} = \{s_{\bar{a}i,0}\}$} +\item { $L_{\sigma_i}$ : $S_{\sigma_i} \rightarrow 2^{AP_{\sigma_i}}$ : a labeling function which labels each state with the set of atomic propositions true in that state. } +\item { $R_{\sigma_i}$ = $ (s_{\bar{a}i,k}, s_{\bar{a}i,k+1})$ } +\end{itemize} +\end{definition} + +%\bigskip +All the properties available are then model-checked on $K(\sigma_i)$. + +If: +\begin{itemize} +\item {\textbf{$K(\sigma_i) \vDash \varphi \Rightarrow \varphi $ will not eliminate $\sigma_i$}} +\item {\textbf{$K(\sigma_i) \nvDash \varphi \Rightarrow \varphi $ will eliminate $\sigma_i$}} +\end{itemize} + +%\bigskip + + +\begin{figure}[h!] + \centering +% \includegraphics[width=1.2\textwidth]{K_sigma_i_S_PNG} +% \hspace*{-15mm} + \includegraphics{K_sigma_i_S_PNG} + \caption{\label{AKSNegCex} Kripke Structure of counterexample $\sigma_i$, $K(\sigma_i)$} +\end{figure} + +%Dans la figure~\ref{étiquette} page~\pageref{étiquette}, 
 + +%\bigskip + + +\begin{figure}[h!] + \centering + +\begin{tikzpicture}[->,>=stealth',shorten >=1.5pt,auto,node distance=1.8cm, + thick] + \tikzstyle{every state}=[fill=none,draw=blue,text=black] + + \node[initial,state] (A) {$s_{\bar{a}i,0}$}; + \node[state] (B) [below of=A] {$s_{\bar{a}i,1}$}; + + \node[state] (C) [below of=B] {$s_{\bar{a}i,k}$}; + + \node[state] (D) [below of=C] {$s_{\bar{a}i,n-1}$}; + \node[state] (E) [below of=D] {$s_{\bar{a}i,n}$}; + + \path (A) edge node {} (B) + (B) edge node {} (C) + (C) edge node {} (D) + (D) edge node {} (E); + +\end{tikzpicture} + + \caption{\label{AKSNegCex} Kripke Structure of counterexample $\sigma_i$, $K(\sigma_i)$} +\end{figure} + + +Therefore all properties that are satisfied won't be chosen to be integrated in the next step of refinement. At this stage, we already have a list of potential properties that will definitely eliminate the current counterexample $\sigma_i$ and might converge the abstract model towards a model sufficient to verify the global property $\phi$. + +} +%\bigskip + +\item {\emph{\underline{Step 2:}} \\ + +The property at the top of the list (not yet selected and excluding the properties which are satisfied by $K(\sigma_i)$) is selected to be integrated in the generation of $\widehat{M}_{i+1}$. +%\bigskip + +} +\end{enumerate} + +$\widehat{M}_{i+1}$ is model-checked and the refinement process is repeated until the model satisfies the global property or there is no property left to be integrated in next abstraction. + + + + + +\section{Experimental results} + + Work in progress... \\ + + + + +\section{Conclusion and Future Works} + +%\section*{Drawbacks} + +We have presented a new strategy in the abstraction generation and refinement which is well adapted for compositional embedded systems. This verification technique is compatible and suits well in the natural development process of complex systems. Our preliminary experimental results shows an interesting performance in terms duration of abstraction generation and the number of refinement iteration. Futhermore, this technique enables us to overcome repetitive counterexamples due to the presence of cycles in the system's graph. + +Nevertheless, in order to function well, this refinement technique requires a complete specification of every components of the concrete model. Futhermore, it may be possible that none of the properties available is capable of eliminating the counterexample which probably due to the fact that the specification is not complete or counterexample given is provoqued by the composition of components. In this case, other refinement techniques such as the refinement by eliminating the counterexample only techniques should be considered. We are currently investigating other complementary techniques to overcome these particular cases. + + + +%\begin{thebibliography} + \ninept +% <-- OPTIONAL, for nine pt only +%\bibliographystyle{plain} +\bibliographystyle{IEEEbib} +\bibliography{myBib} + +%\end{thebibliography} + + + +\end{document} Index: /papers/FDL2012/IEEEbib.bst =================================================================== --- /papers/FDL2012/IEEEbib.bst (revision 48) +++ /papers/FDL2012/IEEEbib.bst (revision 48) @@ -0,0 +1,1021 @@ +%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% IEEE.bst %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% +% Bibliography Syle file for articles according to IEEE instructions +% balemi@aut.ee.ethz.ch <22-JUN-93> +% modified from unsrt.bib. Contributions by Richard H. Roy + +ENTRY + { address + author + booktitle + chapter + edition + editor + howpublished + institution + journal + key + month + note + number + organization + pages + publisher + school + series + title + type + volume + year + } + {} + { label } + +INTEGERS { output.state before.all mid.sentence after.sentence after.block } + +FUNCTION {init.state.consts} +{ #0 'before.all := + #1 'mid.sentence := + #2 'after.sentence := + #3 'after.block := +} + +STRINGS { s t } + +FUNCTION {output.nonnull} +{ 's := + output.state mid.sentence = + { ", " * write$ } + { output.state after.block = +% next line commented out by rhr and changed to write comma +% { add.period$ write$ + { ", " * write$ + newline$ + "\newblock " write$ + } + { output.state before.all = + 'write$ + { add.period$ " " * write$ } + if$ + } + if$ + mid.sentence 'output.state := + } + if$ + s +} + +FUNCTION {output} +{ duplicate$ empty$ + 'pop$ + 'output.nonnull + if$ +} + +FUNCTION {output.check} +{ 't := + duplicate$ empty$ + { pop$ "empty " t * " in " * cite$ * warning$ } + 'output.nonnull + if$ +} + +FUNCTION {output.bibitem} +{ newline$ + "\bibitem{" write$ + cite$ write$ + "}" write$ + newline$ + "" + before.all 'output.state := +} + +FUNCTION {fin.entry} +{ add.period$ + write$ + newline$ +} + +% 5/24/89 rhr +% modified fin.entry function - prints note field after body of entry +%FUNCTION {fin.entry} +%{ add.period$ +% note empty$ +% 'write$ +% { "\par\bgroup\parindent=0em " * annote * "\par\egroup " * write$ +% } +% if$ +% newline$ +%} + +FUNCTION {new.block} +{ output.state before.all = + 'skip$ + { after.block 'output.state := } + if$ +} + +% new block without terminating last block with a comma +FUNCTION {new.ncblock} +{ + write$ + newline$ + "\newblock " + before.all 'output.state := +} + +FUNCTION {new.nccont} +{ + write$ + " " + before.all 'output.state := +} + +FUNCTION {new.sentence} +{ output.state after.block = + 'skip$ + { output.state before.all = + 'skip$ + { after.sentence 'output.state := } + if$ + } + if$ +} + +FUNCTION {not} +{ { #0 } + { #1 } + if$ +} + +FUNCTION {and} +{ 'skip$ + { pop$ #0 } + if$ +} + +FUNCTION {or} +{ { pop$ #1 } + 'skip$ + if$ +} + +FUNCTION {new.block.checka} +{ empty$ + 'skip$ + 'new.block + if$ +} + +FUNCTION {new.block.checkb} +{ empty$ + swap$ empty$ + and + 'skip$ + 'new.block + if$ +} + +FUNCTION {new.sentence.checka} +{ empty$ + 'skip$ + 'new.sentence + if$ +} + +FUNCTION {new.sentence.checkb} +{ empty$ + swap$ empty$ + and + 'skip$ + 'new.sentence + if$ +} + +FUNCTION {field.or.null} +{ duplicate$ empty$ + { pop$ "" } + 'skip$ + if$ +} + +FUNCTION {emphasize} +{ duplicate$ empty$ + { pop$ "" } + { "{\em " swap$ * "}" * } + if$ +} + +FUNCTION {boldface} +{ duplicate$ empty$ + { pop$ "" } + { "{\bf " swap$ * "}" * } + if$ +} + +%FUNCTION {boldface} +%{ 's swap$ := +% s "" = +% { "" } +% { "{\bf " s * "}" * } +% if$ +%} +% +INTEGERS { nameptr namesleft numnames } + +FUNCTION {format.names} +{ 's := + #1 'nameptr := + s num.names$ 'numnames := + numnames 'namesleft := + { namesleft #0 > } + { s nameptr "{ff~}{vv~}{ll}{, jj}" format.name$ 't := + nameptr #1 > + { namesleft #1 > + { ", " * t * } + { numnames #2 > + { "," * } + 'skip$ + if$ + t "others" = + { " et~al." * } + { " and " * t * } + if$ + } + if$ + } + 't + if$ + nameptr #1 + 'nameptr := + namesleft #1 - 'namesleft := + } + while$ +} + +FUNCTION {format.authors} +{ author empty$ + { "" } + { author format.names } + if$ +} + +FUNCTION {format.editors} +{ editor empty$ + { "" } + { editor format.names + editor num.names$ #1 > + { ", Eds." * } + { ", Ed." * } + if$ + } + if$ +} + +FUNCTION {format.title} +{ title empty$ + { "" } + { "``" title "t" change.case$ * } + if$ +} + +FUNCTION {n.dashify} +{ 't := + "" + { t empty$ not } + { t #1 #1 substring$ "-" = + { t #1 #2 substring$ "--" = not + { "--" * + t #2 global.max$ substring$ 't := + } + { { t #1 #1 substring$ "-" = } + { "-" * + t #2 global.max$ substring$ 't := + } + while$ + } + if$ + } + { t #1 #1 substring$ * + t #2 global.max$ substring$ 't := + } + if$ + } + while$ +} + +FUNCTION {format.date} +{ year empty$ + { month empty$ + { "" } + { "there's a month but no year in " cite$ * warning$ + month + } + if$ + } + { month empty$ + 'year + { month " " * year * } + if$ + } + if$ +} + +% FUNCTION {format.date} +% { year empty$ +% 'year +% { " " year * } +% if$ +% } + +FUNCTION {format.btitle} +{ title emphasize +} + +FUNCTION {tie.or.space.connect} +{ duplicate$ text.length$ #3 < + { "~" } + { " " } + if$ + swap$ * * +} + +FUNCTION {either.or.check} +{ empty$ + 'pop$ + { "can't use both " swap$ * " fields in " * cite$ * warning$ } + if$ +} + +FUNCTION {format.bvolume} +{ volume empty$ + { "" } + { "vol." volume tie.or.space.connect + series empty$ + 'skip$ + { " of " * series emphasize * } + if$ + "volume and number" number either.or.check + } + if$ +} + +FUNCTION {format.number.series} +{ volume empty$ + { number empty$ + { series field.or.null } + { output.state mid.sentence = + { "number" } + { "Number" } + if$ + number tie.or.space.connect + series empty$ + { "there's a number but no series in " cite$ * warning$ } + { " in " * series * } + if$ + } + if$ + } + { "" } + if$ +} + +FUNCTION {format.edition} +{ edition empty$ + { "" } + { output.state mid.sentence = + { edition "l" change.case$ " edition" * } + { edition "t" change.case$ " edition" * } + if$ + } + if$ +} + +INTEGERS { multiresult } + +FUNCTION {multi.page.check} +{ 't := + #0 'multiresult := + { multiresult not + t empty$ not + and + } + { t #1 #1 substring$ + duplicate$ "-" = + swap$ duplicate$ "," = + swap$ "+" = + or or + { #1 'multiresult := } + { t #2 global.max$ substring$ 't := } + if$ + } + while$ + multiresult +} + +FUNCTION {format.pages} +{ pages empty$ + { "" } + { pages multi.page.check + { "pp." pages n.dashify tie.or.space.connect } + { "p." pages tie.or.space.connect } + if$ + } + if$ +} + +FUNCTION {format.vol.num.pages} +{ +volume empty$ + {"" } + {"vol. " volume *} +if$ +number empty$ + 'skip$ + {", no. " number * *} +if$ +pages empty$ + 'skip$ + { duplicate$ empty$ + { pop$ format.pages } + { ", pp. " * pages n.dashify * } + if$ + } +if$ +} + +%FUNCTION {format.vol.num.pages} +%%boldface added 3/17/87 rhr +%{ volume field.or.null boldface +% number empty$ +% 'skip$ +% { "(" number * ")" * * +% volume empty$ +% { "there's a number but no volume in " cite$ * warning$ } +% 'skip$ +% if$ +% } +% if$ +% pages empty$ +% 'skip$ +% { duplicate$ empty$ +% { pop$ format.pages } +% { ":" * pages n.dashify * } +% if$ +% } +% if$ +%} + +FUNCTION {format.chapter.pages} +{ chapter empty$ + 'format.pages + { type empty$ + { "chapter" } + { type "l" change.case$ } + if$ + chapter tie.or.space.connect + pages empty$ + 'skip$ + { ", " * format.pages * } + if$ + } + if$ +} + +FUNCTION {format.in.ed.booktitle} +{ booktitle empty$ + { "" } + { editor empty$ + { "in " booktitle emphasize * } + { "in " booktitle emphasize * ", " * format.editors * } + if$ + } + if$ +} + +FUNCTION {empty.misc.check} +{ author empty$ title empty$ howpublished empty$ + month empty$ year empty$ note empty$ + and and and and and + { "all relevant fields are empty in " cite$ * warning$ } + 'skip$ + if$ +} + +FUNCTION {format.thesis.type} +{ type empty$ + 'skip$ + { pop$ + type "t" change.case$ + } + if$ +} + +FUNCTION {format.tr.number} +{ type empty$ + { "Tech. {R}ep." } + 'type + if$ + number empty$ + { "t" change.case$ } + { number tie.or.space.connect } + if$ +} + +FUNCTION {format.article.crossref} +{ key empty$ + { journal empty$ + { "need key or journal for " cite$ * " to crossref " * crossref * + warning$ + "" + } + { "In {\em " journal * "\/}" * } + if$ + } + { "In " key * } + if$ + " \cite{" * crossref * "}" * +} + +FUNCTION {format.crossref.editor} +{ editor #1 "{vv~}{ll}" format.name$ + editor num.names$ duplicate$ + #2 > + { pop$ " et~al." * } + { #2 < + 'skip$ + { editor #2 "{ff }{vv }{ll}{ jj}" format.name$ "others" = + { " et~al." * } + { " and " * editor #2 "{vv~}{ll}" format.name$ * } + if$ + } + if$ + } + if$ +} + +FUNCTION {format.book.crossref} +{ volume empty$ + { "empty volume in " cite$ * "'s crossref of " * crossref * warning$ + "In " + } + { "vol." volume tie.or.space.connect + " of " * + } + if$ + editor empty$ + editor field.or.null author field.or.null = + or + { key empty$ + { series empty$ + { "need editor, key, or series for " cite$ * " to crossref " * + crossref * warning$ + "" * + } + { "{\em " * series * "\/}" * } + if$ + } + { key * } + if$ + } + { format.crossref.editor * } + if$ + " \cite{" * crossref * "}" * +} + +FUNCTION {format.incoll.inproc.crossref} +{ editor empty$ + editor field.or.null author field.or.null = + or + { key empty$ + { booktitle empty$ + { "need editor, key, or booktitle for " cite$ * " to crossref " * + crossref * warning$ + "" + } + { "In {\em " booktitle * "\/}" * } + if$ + } + { "In " key * } + if$ + } + { "In " format.crossref.editor * } + if$ + " \cite{" * crossref * "}" * +} + +FUNCTION {article} +{ output.bibitem + format.authors "author" output.check + new.block + format.title ",''" * "title" output.check + new.ncblock + crossref missing$ + { journal emphasize "journal" output.check + format.vol.num.pages output + format.date "year" output.check + } + { format.article.crossref output.nonnull + format.pages output + } + if$ + new.block + note output + fin.entry +} + +FUNCTION {book} +{ output.bibitem + author empty$ + { format.editors "author and editor" output.check } + { format.authors output.nonnull + crossref missing$ + { "author and editor" editor either.or.check } + 'skip$ + if$ + } + if$ + new.block + format.btitle "title" output.check + crossref missing$ + { format.bvolume output + new.block + format.number.series output + new.sentence + publisher "publisher" output.check + address output + } + { new.block + format.book.crossref output.nonnull + } + if$ + format.edition output + format.date "year" output.check + new.block + note output + fin.entry +} + +FUNCTION {booklet} +{ output.bibitem + format.authors output + new.block + format.title ",''" * "title" output.check + new.nccont + howpublished address new.block.checkb + howpublished output + address output + format.date output + new.block + note output + fin.entry +} + +FUNCTION {inbook} +{ output.bibitem + author empty$ + { format.editors "author and editor" output.check } + { format.authors output.nonnull + crossref missing$ + { "author and editor" editor either.or.check } + 'skip$ + if$ + } + if$ + new.block + format.btitle "title" output.check + crossref missing$ + { format.bvolume output + format.chapter.pages "chapter and pages" output.check + new.block + format.number.series output + new.sentence + publisher "publisher" output.check + address output + } + { format.chapter.pages "chapter and pages" output.check + new.block + format.book.crossref output.nonnull + } + if$ + format.edition output + format.date "year" output.check + new.block + note output + fin.entry +} + +FUNCTION {incollection} +{ output.bibitem + format.authors "author" output.check + new.block + format.title ",''" * "title" output.check + new.ncblock + crossref missing$ + { format.in.ed.booktitle "booktitle" output.check + format.bvolume output + format.number.series output + format.chapter.pages output + new.sentence + publisher "publisher" output.check + address output + format.edition output + format.date "year" output.check + } + { format.incoll.inproc.crossref output.nonnull + format.chapter.pages output + } + if$ + new.block + note output + fin.entry +} + +FUNCTION {inproceedings} +{ output.bibitem + format.authors "author" output.check + new.block + format.title ",''" * "title" output.check + new.ncblock + crossref missing$ + { format.in.ed.booktitle "booktitle" output.check + address empty$ + { organization publisher new.sentence.checkb + organization output + format.date "year" output.check + } + { address output.nonnull + format.date "year" output.check + organization output + } + if$ + format.bvolume output + format.number.series output + format.pages output + publisher output + } + { format.incoll.inproc.crossref output.nonnull + format.pages output + } + if$ + new.block + note output + fin.entry +} + +FUNCTION {conference} { inproceedings } + +FUNCTION {manual} +{ output.bibitem + author empty$ + { organization empty$ + 'skip$ + { organization output.nonnull + address output + } + if$ + } + { format.authors output.nonnull } + if$ + new.block + format.btitle "title" output.check + author empty$ + { organization empty$ + { address new.block.checka + address output + } + 'skip$ + if$ + } + { organization address new.block.checkb + organization output + address output + } + if$ + format.edition output + format.date output + new.block + note output + fin.entry +} + +FUNCTION {mastersthesis} +{ output.bibitem + format.authors "author" output.check + new.block + format.title ",''" * "title" output.check + new.ncblock + "M.S. thesis" format.thesis.type output.nonnull + school "school" output.check + address output + format.date "year" output.check + new.block + note output + fin.entry +} + +FUNCTION {misc} +{ output.bibitem + format.authors output + title howpublished new.block.checkb + format.title ",''" * output + new.nccont + howpublished new.block.checka + howpublished output + format.date output + new.block + note output + fin.entry + empty.misc.check +} + +FUNCTION {phdthesis} +{ output.bibitem + format.authors "author" output.check + new.block + format.btitle "title" output.check + new.block + "Ph.D. thesis" format.thesis.type output.nonnull + school "school" output.check + address output + format.date "year" output.check + new.block + note output + fin.entry +} + +FUNCTION {proceedings} +{ output.bibitem + editor empty$ + { organization output } + { format.editors output.nonnull } + if$ + new.block + format.btitle "title" output.check + format.bvolume output + format.number.series output + address empty$ + { editor empty$ + { publisher new.sentence.checka } + { organization publisher new.sentence.checkb + organization output + } + if$ + publisher output + format.date "year" output.check + } + { address output.nonnull + format.date "year" output.check + new.sentence + editor empty$ + 'skip$ + { organization output } + if$ + publisher output + } + if$ + new.block + note output + fin.entry +} + +FUNCTION {techreport} +{ output.bibitem + format.authors "author" output.check + new.block + format.title ",''" * "title" output.check + new.ncblock + format.tr.number output.nonnull + institution "institution" output.check + address output + format.date "year" output.check + new.block + note output + fin.entry +} + +FUNCTION {unpublished} +{ output.bibitem + format.authors "author" output.check + new.block + format.title ",''" * "title" output.check + new.ncblock + note "note" output.check + format.date output + fin.entry +} + +FUNCTION {default.type} { misc } + +MACRO {jan} {"Jan."} + +MACRO {feb} {"Feb."} + +MACRO {mar} {"Mar."} + +MACRO {apr} {"Apr."} + +MACRO {may} {"May"} + +MACRO {jun} {"June"} + +MACRO {jul} {"July"} + +MACRO {aug} {"Aug."} + +MACRO {sep} {"Sept."} + +MACRO {oct} {"Oct."} + +MACRO {nov} {"Nov."} + +MACRO {dec} {"Dec."} + +MACRO {acmcs} {"ACM Computing Surveys"} + +MACRO {acta} {"Acta Informatica"} + +MACRO {cacm} {"Communications of the ACM"} + +MACRO {ibmjrd} {"IBM Journal of Research and Development"} + +MACRO {ibmsj} {"IBM Systems Journal"} + +MACRO {ieeese} {"IEEE Transactions on Software Engineering"} + +MACRO {ieeetc} {"IEEE Transactions on Computers"} + +MACRO {ieeetcad} + {"IEEE Transactions on Computer-Aided Design of Integrated Circuits"} + +MACRO {ipl} {"Information Processing Letters"} + +MACRO {jacm} {"Journal of the ACM"} + +MACRO {jcss} {"Journal of Computer and System Sciences"} + +MACRO {scp} {"Science of Computer Programming"} + +MACRO {sicomp} {"SIAM Journal on Computing"} + +MACRO {tocs} {"ACM Transactions on Computer Systems"} + +MACRO {tods} {"ACM Transactions on Database Systems"} + +MACRO {tog} {"ACM Transactions on Graphics"} + +MACRO {toms} {"ACM Transactions on Mathematical Software"} + +MACRO {toois} {"ACM Transactions on Office Information Systems"} + +MACRO {toplas} {"ACM Transactions on Programming Languages and Systems"} + +MACRO {tcs} {"Theoretical Computer Science"} + +READ + +STRINGS { longest.label } + +INTEGERS { number.label longest.label.width } + +FUNCTION {initialize.longest.label} +{ "" 'longest.label := + #1 'number.label := + #0 'longest.label.width := +} + +FUNCTION {longest.label.pass} +{ number.label int.to.str$ 'label := + number.label #1 + 'number.label := + label width$ longest.label.width > + { label 'longest.label := + label width$ 'longest.label.width := + } + 'skip$ + if$ +} + +EXECUTE {initialize.longest.label} + +ITERATE {longest.label.pass} + +FUNCTION {begin.bib} +{ preamble$ empty$ + 'skip$ + { preamble$ write$ newline$ } + if$ + "\begin{thebibliography}{" longest.label * "}" * write$ newline$ +} + +EXECUTE {begin.bib} + +EXECUTE {init.state.consts} + +ITERATE {call.type$} + +FUNCTION {end.bib} +{ newline$ + "\end{thebibliography}" write$ newline$ +} + +EXECUTE {end.bib} + +%%%%%%%%%%%%%%%%%%%%%%%%%%%%% End of IEEE.bst %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% Index: /papers/FDL2012/myBib.bib =================================================================== --- /papers/FDL2012/myBib.bib (revision 48) +++ /papers/FDL2012/myBib.bib (revision 48) @@ -0,0 +1,310 @@ +@article{ bryant92bdd, + author = "Randal E. Bryant", + title = "Symbolic {Boolean} Manipulation with Ordered Binary-Decision Diagrams", + journal = {ACM Computing Surveys}, + volume = 24, + number = 3, + pages = {293-318}, + year = 1992 +} + + +@article{ mcMillan93symbolic_mc, + author = "K. McMillan", + title = "{Symbolic Model-checking}", + journal = {Kluwer Academic Publisher}, + year = 1993 +} + + +@conference{ ClarkeEmerson81temporal_logic, + author = "E. M. Clarke and E. A. Emerson", + title = "Design and systhesis of synchronization skeletons using branching time temporal logic", + booktitle = "In Logic of Programs Workshop", + volume = 131, + address = "Yorktown Heights, New York", + year = 1981, + month = May, + publisher = "LNCS 131, Springer " +} + +@article{ ClarkeEmersonSistla86verif_temporal, + author = "E. M. Clarke and E. A. Emerson and A. P. Sistla", + title = "Automatic verification of finite-state concurrent systems using temporal logic specifications", + journal = "ACM Transactions on Programming Languages and Systems", + volume = 8, + number = 2, + pages = {244-263}, + year = 1986, + month = Apr +} + +@conference{ clarke00cegar, + author = "E. M. Clarke and O. Grumberg and S. Jha and Y. Lu and H. Veith", + title = "{Counterexample-guided Abstraction Refinement}", + booktitle = "Computer Aided Verification (CAV '00)", + address = "Chicago, IL", + year = 2000, + publisher = "Lecture Notes in Computer Science" +} + +@conference{ QuielleSifakis82spec_verif, + author = "J. P. Queille and J. Sifakis", + title = "Specification and verification of concurrent systems in CESAR", + booktitle = "In Proceedings of the 5th International Symposium on Programming", + volume = 137, + address = "Turin, Italy", + year = 1982, + month = April, + publisher = "LNCS 137, Springer " +} + + + +@conference{ BCCFZ04SMC_with_SAT, + author = "A. Biere and A. Cimatti and E. Clarke and M.Fujita and Y. Zhu", + title = "{ Symbolic Model Checking using SAT procedures instead of BDDs}", + booktitle = {Proceedings: Design Automation Conference (DAC '99)}, + pages = {317-320}, + year = 1999, + month = February, +} + + +@article{ ucberkeley96vis, + author = "The VIS Group", + title = "{VIS: A system for Verification and Synthesis}", + journal = {Springer Lecture Notes in Computer Science}, + volume = 1102, + number = 1102, + pages = {428-432}, + year = 1996 +} + + +@conference{ ucolorado04circus, + author = "H. S. Jin and M. Awedh and F. Somenzi", + title = "{CirCUs: A Satisfiablilty Solver Geared Towards Bounded Model Checking}", + booktitle = {16th Conference on Computer Aided Verification (CAV '04)}, + pages = {519-522}, + year = 2004, + month = Jul, + publisher = "LNCS 3114" +} + +@article{ clarke95counterexamples, + author = "E. M. Clarke and O. Grumberg and K. L. McMillan and X. Zhao", + title = "{Efficient Generation of Counterexamples and Witnesses in Symbolic Model Checking}", + journal = {32nd ACM/IEEE Design Automation Conference}, + year = 1995 +} + +@article{ braunstein07ctl_abstraction, + author = "C. Braunstein and E. Encrenaz", + title = "{Using CTL Formulae as Component Abstraction in a Design Verification Flow}", + journal = {ACSD IEEE Computer Society Press}, + pages = {80-89}, + year = 2007 +} + + +@article{ bara08abs_composant, + author = "A. Bara", + title = "{Abstraction de Composant pour la Vérification par Model-Checking}", + journal = {Mémoire de DiplÃŽme Universitaire OMP - LIP6-SOC}, + year = 2008 +} + + +@conference{ emma03ctl_ambigous, + author = "C. Roux and E. Encrenaz ", + title = "{CTL} may be ambigous when model-checking {Moore Machines} ", + booktitle = " IFIP WG 10.5 12th International Advance Research Working Conference on Correct Hardware Design and Verification Methods (CHARME)", + volume = 2860, + address = "Italy", + year = 2003, + month = Nov, + publisher = "Lecture Notes in Computer Science" +} + + +@conference{ XieBrowne03composition_soft, + author = "F. Xie and J.C. Browne ", + title = "{Verified Systems by Composition from Verified Components} ", + booktitle = " In ESEC/FSE 2003: Proceedings of the 11th ACM SIGSOFT Symposium on Foundations of Software Engineering Conference", + pages = {227-286}, + address = "Helsinki, Finland", + year = 2003, + publisher = "ACM Press" +} + + +@conference{ PMT02compositional_MC, + author = "H. Peng and Y. Mokhtari and S. Tahar ", + title = "{Environment Synthesis for Compositional Model Checking} ", + booktitle = "In ICCD’02 : Proceedings of the 20th International Conference on Computer Design", + pages = {70-75}, + address = "Freiburg, Germany", + year = 2002, + publisher = "IEEE Computer Society" +} + + +@conference{ SNBE06property_based, + author = "M. Schickel and V. Nimbler and M. Braun and H. Eveking ", + title = "{On Consistency and Completeness of Property-Sets: Exploiting the Property-Based Design Process} ", + booktitle = "In FDL’06: Proceedings of Forum on specification and Design Languages", + year = 2006 +} + + +@conference{ CiardoLS00mdd_async, + author = "G.Ciardo and G. LÃŒttgen and R. Siminiceanu", + title = "{ Efficient symbolic state-space construction for asynchronous systems} ", + booktitle = "In Proc. of ICATPN '2000", + volume = 1825, + pages = {103-122}, + year = 2000, + publisher = "Lecture Notes in Computer Science, Springer Verlag" +} + +@conference{ CTM05hdd, + author = "J-M. Couvreur and Y. Thierry-Mieg", + title = "{ Hierarchical Decision Diagrams to Exploit Model Structure} ", + booktitle = "In FORTE : Proceedings of the 25th IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems", + volume = 3731, + pages = {443-457}, + address = "Taipei, Taiwan", + year = 2005, + publisher = "Lecture Notes in Computer Science, Springer" +} + + +@conference{ HQR98assume_guarantee, + author = "T. A. Henzinger and S. Qadeer and S. K. Rajamani", + title = "{ You Assume, We Guarantee : Methodology and Case Studies} ", + booktitle = "CAV ’98 : Proceedings of the 10th International Conference on Computer Aided Verification", + volume = 1427, + pages = {440-451}, + address = "Vancouver, Canada", + year = 1998, + publisher = " Lecture Notes in Computer Science, Springer-Verlag" +} + + +@conference{ GrumbergLong91assume_guarantee, + author = " O. Grumberg and D. E. Long", + title = "{ Model Checking and Modular Verification} ", + booktitle = " In International Conference on Concurency Theory", + volume = 527, + pages = {250-263}, + year = 1991, + publisher = " Lecture Notes in Computer Science, Springer-Verlag" +} + + +@conference{ GrafSaidi97abstract_construct, + author = " S. Graf and H. Saïdi", + title = "{ Construction of Abstract State Graphs with PVS} ", + booktitle = " In CAV ’97: Proceedings of the 9th International Conference on Computer Aided Verification", + volume = 1254, + year = 1997, + publisher = " Lecture Notes in Computer Science, Springer" +} + + +@conference{ Burch_al91smc_part_transition, + author = " J. R. Burch and E. M. Clarke and D. E. Long", + title = "{ Symbolic Model Checking with Partitioned Transition Relations} ", + booktitle = "Proceedings of the 1991 International Conference on VLSI", + pages = {49-58}, + month = August, + year = 1991, +} + + +@conference{ Burch_al93smc_circuit_verif, + author = " J. R. Burch and E. M. Clarke and D. E. Long and K. L. Mcmillan and D.L. Dilli", + title = "{ Symbolic Model Checking for Sequential Circuit Verification} ", + booktitle = " IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems", + volume = {13(4)}, + pages = {401-424}, + year = 1993, +} + + +@conference{ Kroening_al07vcegar, + author = " Himanshu Jain and Daniel Kroening and Natasha Sharygina and Edmund Clarke", + title = "{ VCEGAR: Verilog CounterExample Guided Abstraction Refinement} ", + booktitle = " In 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)", + year = 2007, +} + + +@conference{ microsoft04SLAM, + author = " Thomas Ball and Byron Cook and Vladimir Levin and Sriram K. Rajamani", + title = "{ SLAM and Static Driver Verifier: Technology Transfer of Formal Methods inside Microsoft} ", + booktitle = " Fourth International Conference on Integrated Formal Methods (IFM 2004)", + volume = 2999, + pages = {1-20}, + year = 2004, + publisher = " Lecture Notes in Computer Science, Springer" +} + + +@conference{ berkeley07BLAST, + author = " Dirk Beyer and Thomas A. Henzinger and Ranjit Jhala and Rupak Majumdar", + title = "{ The Software Model Checker Blast: Applications to software engineering.} ", + booktitle = " International Journal on Software Tools for Technology Transfer", + volume = {9 (5-6)}, + pages = {505-525}, + year = 2007, +} + + +@inproceedings{pwk2009-date, + AUTHOR = { Mitra Purandare and Thomas Wahl and Daniel Kroening }, + TITLE = { Strengthening Properties using Abstraction Refinement }, + BOOKTITLE = { Proceedings of DATE 2009 }, + YEAR = { 2009 }, + PUBLISHER = { ACM }, + PAGES = { 1692--1697 }, +} + + +@conference{ Kunz_al11ipc_abs, + author = " Minh D. Nguyen and Markus Wedler and Dominik Stoffel and Wolfgang Kunz ", + title = "{ Formal Hardware/Software Co-Verification by Interval Property Checking with Abstraction}", + booktitle = "48th Proc. Design Automation Conference (DAC '11)", + address = "San Diego, USA", + year = 2011, +} + + +@book{ knuth94tex, + author = "Donald E. Knuth", + publisher = "Addison-Wesley", + title = "The {\TeX}book", + year = 1984, + isbn = "" +} + + +@misc{ patanshnik88bibtex, + author = "Oren Patashnik", + title = "Using {BibTeX}. {D}ocumentation for general {B}ib{\TeX} users", + year = 1988, + month = jan +} + + +@article{ etessami_yannakakis09recursive, + author = "Kousha Etassami and Mihalis Yannakakis", + title = "Recursive Markov chains, sto-chastic grammars, and monotone systems of nonlinear equations", + journal = {Journals of the ACM}, + volume = 56, + number = 1, + pages = {1-66}, + year = 2009 +} + Index: /papers/FDL2012/refs.bib =================================================================== --- /papers/FDL2012/refs.bib (revision 48) +++ /papers/FDL2012/refs.bib (revision 48) @@ -0,0 +1,10 @@ +@InProceedings{C2, + author = "Jones, C.D. and Smith, A.B. and Roberts, E.F.", + booktitle = "Proceedings Title", + organization = "IEEE", + year = "2003", + volume = "II", + pages = "803-806" +} + + Index: /papers/FDL2012/spconf.sty =================================================================== --- /papers/FDL2012/spconf.sty (revision 48) +++ /papers/FDL2012/spconf.sty (revision 48) @@ -0,0 +1,252 @@ +%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% +% +% File: spconf.sty (LaTeX Document style option "spconf") +% +% Usage: \documentclass{article} +% \usepackage{spconf} +% +% Or for LaTeX 2.09: +% Usage: \documentstyle[...,spconf,...]{article} +% +% Purpose: +% +% Style file for Signal Processing Society Conferences (ICASSP, ICIP). +% Features: +% - correct page size (175mm x 226mm) +% - twocolumn format +% - boldfaced, numbered, and centered section headings +% - correct subsection and subsubsection headings +% - use \title{xx} for title, will be typeset all uppercase +% - use \name{xx} for author name(s) only, will be typeset in italics +% - use \address{xx} for one address of all authors +% - use \twoauthors{author1}{address1}{author2}{address2} +% for two (or more) authors with two separate addresses +% - note: no need for \author nor \date +% - optional: can use \thanks{xx} within \name or \twoauthors, +% asterisk is not printed after name nor in footnote +% - optional: can use \sthanks{xx} after each name within \name or +% \twoauthors if different thanks for each author, +% footnote symbol will appear for each name and footnote +% - optional: use \ninept to typeset text in 9 pt; default is 10pt. +% +% Example of use for one or more authors at a common address and +% common support. For distinct support acknowledgments, +% use \sthanks{xx} after each name. +% +% \documentclass{article} +% \usepackage{spconf} +% \title{Title of the paper} +% \name{George P. Burdell and John Q. Professor +% \thanks{This work was supported by...}} +% \address{Common address, department \\ +% City, etc \\ +% optional e-mail address} +% +% \begin{document} +% OPTIONAL --> \ninept <-- OPTIONAL, for nine pt only +% \maketitle +% \begin{abstract} +% This is the abstract for my paper. +% \end{abstract} +% . +% Insert text of paper +% . +% \end{document} +% +% Example of use for two authors at two distinct addresses with only +% one support acknowledgment. For distinct support acknowledgments, +% use \sthanks{xx} after each name. +% +% \documentclass{article} +% \usepackage{spconf} +% \title{Title of the paper} +% \twoauthors{John Doe +% \thanks{This work was supported by...}} +% {Doe's address, department \\ +% City, etc \\ +% optional e-mail address} +% {Judy Smith} +% {Smith's address, department \\ +% City, etc \\ +% optional e-mail address} +% +% \begin{document} +% OPTIONAL --> \ninept <-- OPTIONAL, for nine pt only +% \maketitle +% \begin{abstract} +% This is the abstract for my paper. +% \end{abstract} +% . +% Insert text of paper +% . +% \end{document} +% +% Preprint Option (Only for preprints, not for submissions!): +% - can create a preprint titlepage footer by using the +% "preprint" option with the \usepackage{spconf} command +% - use \copyrightnotice{\copyright xx} for copyright information +% - use \toappear{To appear in xx} for publication name +% Example of preprint use: +% +% \documentclass{article} +% \usepackage[preprint]{spconf} +% . +% \copyrightnotice{\copyright\ IEEE 2000} +% \toappear{To appear in {\it Proc.\ ICASSP2000, +% June 05-09, 2000, Istanbul, Turkey}} +% +% +% PLEASE REPORT ANY BUGS +% +% Author: Stephen Martucci -- stephen.martucci@ieee.org +% +% Date: 3 May 2000 +% +% Updated: Lance Cotton, Ulf-Dietrich Braumann, 11 May 2006 +% Change: Added keywords/Index Terms section +% Change: Added \emergencystretch=11pt, Lance Cotton, 26-Sept-2007 +% +%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% + +% These commands change default text fonts to the scalable PostScript +% fonts Times, Helvetica, and Courier. However, they do not change +% the default math fonts. After conversion to PDF, text will look good +% at any scale but math symbols and equations may not. +% If instead you use the PostScript Type 1 implementation of the +% Computer Modern fonts from the American Mathematical Society, which +% will make all fonts (text and math) scalable, comment out the +% following three lines. Those fonts use the same metrics as the Knuth +% Computer Modern fonts and therefore no font redefinition is needed. +\renewcommand{\sfdefault}{phv} +\renewcommand{\rmdefault}{ptm} +\renewcommand{\ttdefault}{pcr} + +%\oddsidemargin -0.31in +%\evensidemargin -0.31in +\oddsidemargin -6.2truemm +\evensidemargin -6.2truemm + +\topmargin 0truept +\headheight 0truept +\headsep 0truept +%\footheight 0truept +%\footskip 0truept +\textheight 229truemm +\textwidth 178truemm + +\twocolumn +\columnsep 6truemm +\pagestyle{empty} + +\emergencystretch=11pt + +\def\ninept{\def\baselinestretch{.95}\let\normalsize\small\normalsize} + +\def\maketitle{\par + \begingroup + \def\thefootnote{} + \def\@makefnmark{\hbox + {$^{\@thefnmark}$\hss}} + \if@twocolumn + \twocolumn[\@maketitle] + \else \newpage + \global\@topnum\z@ \@maketitle \fi\@thanks + \endgroup + \setcounter{footnote}{0} + \let\maketitle\relax + \let\@maketitle\relax + \gdef\thefootnote{\arabic{footnote}}\gdef\@@savethanks{}% + \gdef\@thanks{}\gdef\@author{}\gdef\@title{}\let\thanks\relax} + +\def\@maketitle{\newpage + \null + \vskip 2em \begin{center} + {\large \bf \@title \par} \vskip 1.5em {\large \lineskip .5em +\begin{tabular}[t]{c}\@name \\ \@address + \end{tabular}\par} \end{center} + \par + \vskip 1.5em} + +\def\title#1{\gdef\@title{\uppercase{#1}}} +\def\name#1{\gdef\@name{{\em #1}\\}} +\def\address#1{\gdef\@address{#1}} +\gdef\@title{\uppercase{title of paper}} +\gdef\@name{{\em Name of author}\\} +\gdef\@address{Address - Line 1 \\ + Address - Line 2 \\ + Address - Line 3} + +\let\@@savethanks\thanks +\def\thanks#1{\gdef\thefootnote{}\@@savethanks{#1}} +\def\sthanks#1{\gdef\thefootnote{\fnsymbol{footnote}}\@@savethanks{#1}} + +\def\twoauthors#1#2#3#4{\gdef\@address{} + \gdef\@name{\begin{tabular}{@{}c@{}} + {\em #1} \\ \\ + #2\relax + \end{tabular}\hskip 1in\begin{tabular}{@{}c@{}} + {\em #3} \\ \\ + #4\relax +\end{tabular}}} + +\def\@sect#1#2#3#4#5#6[#7]#8{ + \refstepcounter{#1}\edef\@svsec{\csname the#1\endcsname.\hskip 0.6em} + \begingroup \ifnum #2=1\bf\centering + {\interlinepenalty \@M + \@svsec\uppercase{#8}\par}\else\ifnum #2=2\bf + \noindent{\interlinepenalty \@M \@svsec #8\par}\else\it + \noindent{\interlinepenalty \@M + \@svsec #8\par}\fi\fi\endgroup + \csname #1mark\endcsname{#7}\addcontentsline + {toc}{#1}{\protect\numberline{\csname the#1\endcsname} #7} + \@tempskipa #5\relax + \@xsect{\@tempskipa}} + +\def\abstract{\begin{center} +{\bf ABSTRACT\vspace{-.5em}\vspace{0pt}} +\end{center}} +\def\endabstract{\par} + +% Keyword section, added by Lance Cotton, adapted from IEEEtrans, corrected by Ulf-Dietrich Braumann +\def\keywords{\vspace{.5em} +{\bfseries\textit{Index Terms}---\,\relax% +}} +\def\endkeywords{\par} + +\def\copyrightnotice#1{\gdef\@copyrightnotice{#1}} +\let\@copyrightnotice\relax +\def\toappear#1{\gdef\@toappear{#1}}\let\@toappear\relax + +\newif\if@preprint\@preprintfalse +\@namedef{ds@preprint}{\global\@preprinttrue} +\@options +\def\ps@preprint{\def\mypage{}\let\@mkboth\@gobbletwo\def\@oddhead{} + \def\@oddfoot{\rlap{\@toappear}\hfil\mypage\hfil + \llap{\@copyrightnotice} + \gdef\mypage{\thepage}\gdef\@toappear{}\gdef\@copyrightnotice{}}} + +\if@preprint\ps@preprint +\else\ps@empty\flushbottom\fi + +\def\thebibliography#1{\section{References}\list + {[\arabic{enumi}]}{\settowidth\labelwidth{[#1]}\leftmargin\labelwidth + \advance\leftmargin\labelsep + \usecounter{enumi}} + \def\newblock{\hskip .11em plus .33em minus .07em} + \sloppy\clubpenalty4000\widowpenalty4000 + \sfcode`\.=1000\relax} +\let\endthebibliography=\endlist + +\long\def\@makecaption#1#2{ + \vskip 10pt + \setbox\@tempboxa\hbox{#1. #2} + \ifdim \wd\@tempboxa >\hsize #1. #2\par \else \hbox +to\hsize{\hfil\box\@tempboxa\hfil} + \fi} + +\def\fnum@figure{{\bf Fig.\ \thefigure}} +\def\fnum@table{{\bf Table \thetable}} + +\flushbottom + +%%%% EOF Index: /papers/FDL2012/strings.bib =================================================================== --- /papers/FDL2012/strings.bib (revision 48) +++ /papers/FDL2012/strings.bib (revision 48) @@ -0,0 +1,11 @@ +@Article{Lamp86, + author = "A.B. Smith and C.D. Jones and E.F. Roberts", + title = "Article Title", + journal = "Journal", + year = "1920", + volume = "62", + pages = "291-294", + month = "January" +} + +