{"expr":"Composite(AA.AuN=='michael perscheid')","entities":[{"logprob":-18.891,"Id":2144114063,"Ty":"0","Ti":"a comparison of context oriented programming languages","Pt":"0","L":"en","Y":2009,"D":"2009-07-07","CC":96,"ECC":149,"RId":[2138363365,2143238865,2075642720,2150275961,1992443356,2089889705,2154597770,2115607078,2087175184,1501829296,1556513858,2097664691,1597389001,2014881790,2115899208,2294229253],"W":["comparison","context","languages","oriented","programming"],"AA":[{"DAuN":"Malte Appeltauer","AuN":"malte appeltauer","AuId":135591984,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":1},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":2},{"DAuN":"Michael Haupt","AuN":"michael haupt","AuId":2146662369,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":3},{"DAuN":"Jens Lincke","AuN":"jens lincke","AuId":2055148755,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":4},{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":5}],"F":[{"DFN":"Very high-level programming language","FN":"very high level programming language","FId":169796678},{"DFN":"Third-generation programming language","FN":"third generation programming language","FId":206146517},{"DFN":"Second-generation programming language","FN":"second generation programming language","FId":11164408},{"DFN":"Programming language theory","FN":"programming language theory","FId":18701968},{"DFN":"Programming language","FN":"programming language","FId":199360897},{"DFN":"Fourth-generation programming language","FN":"fourth generation programming language","FId":145628200},{"DFN":"First-generation programming language","FN":"first generation programming language","FId":570499},{"DFN":"Fifth-generation programming language","FN":"fifth generation programming language","FId":199305712},{"DFN":"Computer science","FN":"computer science","FId":41008148},{"DFN":"Comparison of multi-paradigm programming languages","FN":"comparison of multi paradigm programming languages","FId":74149592}],"E":"{\"DN\":\"A comparison of context-oriented programming languages\",\"IA\":{\"IndexLength\":45,\"InvertedIndex\":{\"Context-oriented\":[0],\"programming\":[1],\"(COP)\":[2],\"extensions\":[3],\"have\":[4],\"been\":[5],\"implemented\":[6],\"for\":[7],\"several\":[8],\"languages.\":[9],\"Each\":[10],\"concrete\":[11],\"language\":[12],\"design\":[13],\"and\":[14,41],\"implementation\":[15],\"comes\":[16],\"with\":[17],\"different\":[18],\"variations\":[19],\"of\":[20,23,34],\"the\":[21,24],\"features\":[22],\"COP\":[25,36],\"paradigm.\":[26],\"In\":[27],\"this\":[28],\"paper,\":[29],\"we\":[30],\"provide\":[31],\"a\":[32],\"comparison\":[33],\"eleven\":[35],\"implementations,\":[37],\"discuss\":[38],\"their\":[39,43],\"designs,\":[40],\"evaluate\":[42],\"performance.\":[44]}},\"S\":[{\"Ty\":3,\"U\":\"http://soft.vub.ac.be/cop09/papers/a6-appeltauer.pdf\"},{\"Ty\":3,\"U\":\"http://www.hirschfeld.org/writings/media/AppeltauerHirschfeldHauptLinckePerscheid_2009_AComparisonOfContextOrientedProgrammingLanguages_AcmDL.pdf\"},{\"Ty\":3,\"U\":\"http://www.hpi.uni-potsdam.de/hirschfeld/publications/media/AppeltauerHirschfeldHauptLinckePerscheid_2009_AComparisonOfContextOrientedProgrammingLanguages_AcmDL.pdf\"},{\"Ty\":1,\"U\":\"https://dl.acm.org/citation.cfm?id=1562118\"},{\"Ty\":0,\"U\":\"http://dl.acm.org/citation.cfm?id=1562118\"}],\"VFN\":\"International Workshop on Context-Oriented Programming\",\"FP\":6,\"DOI\":\"10.1145/1562112.1562118\",\"CC\":{\"1501829296\":[\"It serves the purpose of demonstrating the applicability of a machine model and semantics for multi-dimensional separation of concerns [8] to COP.\"],\"1556513858\":[\"gramming languages were developed, namely ContextS [9] for Smalltalk, ContextR [15] for Ruby, ContextJS for JavaScript, ContextPy [16] and PyContext [17] for Python, and ContextG for Groovy.\"],\"1597389001\":[\"It is implemented as an aspect-oriented precompiler based on the LogicAJ [12] aspect language and provides a more convenient syntax than ContextJ*.\"],\"1992443356\":[\"ContextL [4,5] was the first COP extension to a programming language.\"],\"2014881790\":[\"The cj prototype [13, 14] is an implementation of a minimal subset of ContextJ.\"],\"2075642720\":[\"programming [3], and context-oriented programming (COP)\"],\"2087175184\":[\"gramming languages were developed, namely ContextS [9] for Smalltalk, ContextR [15] for Ruby, ContextJS for JavaScript, ContextPy [16] and PyContext [17] for Python, and ContextG for Groovy.\",\"PyContext [17] suggests the concepts of dynamic variables [7] and implicit layer activation.\"],\"2089889705\":[\"Aside from these dynamic languages, three COP extensions to the Java programming language exist, namely ContextJ [ 1 ], ContextJ* [10], and ContextLogicAJ [2].\\u001bThe rst ideas about a ContextJ language were presented in [5]; a language specication and compiler-based implementation of ContextJ is provided by [ 1 ].\"],\"2097664691\":[\"The cj prototype [13, 14] is an implementation of a minimal subset of ContextJ.\"],\"2115607078\":[\"Another approach to context-orientation is Ambience and its underlying Ambient Object System [6] that is based on Common Lisp.\"],\"2115899208\":[\"Aside from these dynamic languages, three COP extensions to the Java programming language exist, namely ContextJ [1], ContextJ* [10], and ContextLogicAJ [2].\"],\"2138363365\":[\"The separation of cross-cutting concerns is an issue that is considered by several programming language paradigms, such as aspect-oriented programming [ 11 ], feature-oriented programming [3], and context-oriented programming (COP) [10].\"],\"2143238865\":[\"The separation of cross-cutting concerns is an issue that is considered by several programming language paradigms, such as aspect-oriented programming [11], feature-oriented programming [3], and context-oriented programming (COP) [10].\"],\"2150275961\":[\"[10].\",\"For a detailed description of the concepts of COP, we refer to [10]; Section 2.\",\"Aside from these dynamic languages, three COP extensions to the Java programming language exist, namely ContextJ [1], ContextJ* [10], and ContextLogicAJ [2].\"],\"2154597770\":[\"ContextL [4,5] was the first COP extension to a programming language.\",\"The first ideas about a ContextJ language were presented in [5]; a language specification and compiler-based implementation of ContextJ is provided by [1].\"],\"2294229253\":[\"PyContext [17] suggests the concepts of dynamic variables [7] and implicit layer activation.\"]},\"PR\":[2150275961,1992443356,2089889705,2480195817,2087175184,2060640309,1556513858,1978875190,175922506,2115607078,2172169742,1724660581,2138363365,2145919358,1990911977,2145304606,1985637830,2089287449,1649645444,1665004853,2150275961,1992443356,2089889705,2480195817,2087175184,2060640309,1556513858,1978875190,175922506,2115607078,2172169742,1724660581,2138363365,2145919358,1990911977,2145304606,1985637830,2089287449,1649645444,1665004853],\"ANF\":[{\"FN\":\"Malte\",\"LN\":\"Appeltauer\",\"S\":1},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":2},{\"FN\":\"Michael\",\"LN\":\"Haupt\",\"S\":3},{\"FN\":\"Jens\",\"LN\":\"Lincke\",\"S\":4},{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":5}],\"BV\":\"International Workshop on Context-Oriented Programming\",\"BT\":\"p\",\"PB\":\"ACM\"}"},{"logprob":-19.809,"Id":2284072287,"Ty":"0","Ti":"studying the advancement in debugging practice of professional software developers","Pt":"1","L":"en","Y":2017,"D":"2017-03-01","CC":14,"ECC":14,"RId":[2031648200,2162376048,2123659430,1574060188,2113302524,1767990287,2156357889,1968847337,2132383311,2141109493,1993199499,2137270184,1843474218,2118529754,2127961981,2000711964,2146146233,1572075820,2092239677,2155788121,2037987349,1774013863,1989678938,2147045401,2794372210,1644965812,1502739415,107792539,151007792,2036887984],"W":["advancement","debugging","developers","practice","professional","software","studying"],"AA":[{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"SAP Innovation Center","S":1},{"DAuN":"Benjamin Siegmund","AuN":"benjamin siegmund","AuId":2107713863,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":2},{"DAuN":"Marcel Taeumel","AuN":"marcel taeumel","AuId":83004794,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":3},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":4}],"F":[{"DFN":"Systems engineering","FN":"systems engineering","FId":201995342},{"DFN":"Software","FN":"software","FId":2777904410},{"DFN":"Debugging","FN":"debugging","FId":168065819},{"DFN":"Computer science","FN":"computer science","FId":41008148},{"DFN":"Computer engineering","FN":"computer engineering","FId":113775141},{"DFN":"Algorithmic program debugging","FN":"algorithmic program debugging","FId":136388014}],"J":{"JN":"sqj","JId":7504070},"E":"{\"DN\":\"Studying the advancement in debugging practice of professional software developers\",\"IA\":{\"IndexLength\":144,\"InvertedIndex\":{\"In\":[0],\"1997,\":[1],\"Henry\":[2],\"Lieberman\":[3],\"stated\":[4],\"that\":[5,67,113,135],\"debugging\":[6,19,41,75,101,122,133],\"is\":[7,42,52],\"the\":[8,34,38,71,83,116],\"dirty\":[9],\"little\":[10],\"secret\":[11],\"of\":[12,74],\"computer\":[13],\"science.\":[14],\"Since\":[15],\"then,\":[16],\"several\":[17,97],\"promising\":[18],\"technologies\":[20],\"have\":[21,59],\"been\":[22,60],\"developed\":[23],\"such\":[24],\"as\":[25,115],\"back-in-time\":[26],\"debuggers\":[27],\"and\":[28,49,86,91,102],\"automatic\":[29],\"fault\":[30],\"localization\":[31],\"methods.\":[32],\"However,\":[33],\"last\":[35],\"study\":[36,92],\"about\":[37,88,105],\"state-of-the-art\":[39],\"in\":[40,62,76],\"still\":[43],\"more\":[44],\"than\":[45],\"15\":[46],\"years\":[47],\"old\":[48],\"so\":[50],\"it\":[51],\"not\":[53],\"clear\":[54],\"whether\":[55],\"these\":[56,126],\"new\":[57,130,139],\"approaches\":[58,90],\"applied\":[61],\"practice\":[63,134],\"or\":[64],\"not.\":[65],\"For\":[66],\"reason,\":[68],\"we\":[69,81,95,109,128],\"investigate\":[70],\"current\":[72,89],\"state\":[73],\"a\":[77,111,119],\"comprehensive\":[78],\"study.\":[79],\"First,\":[80],\"review\":[82],\"available\":[84],\"literature\":[85],\"learn\":[87],\"results.\":[93],\"Second,\":[94],\"observe\":[96],\"professional\":[98],\"developers\":[99],\"while\":[100],\"interview\":[103],\"them\":[104],\"their\":[106],\"experiences.\":[107],\"Third,\":[108],\"create\":[110],\"questionnaire\":[112],\"serves\":[114],\"basis\":[117],\"for\":[118,141],\"larger\":[120],\"online\":[121],\"survey.\":[123],\"Based\":[124],\"on\":[125],\"results,\":[127],\"present\":[129],\"insights\":[131],\"into\":[132],\"help\":[136],\"to\":[137],\"suggest\":[138],\"directions\":[140],\"future\":[142],\"research.\":[143]}},\"S\":[{\"Ty\":1,\"U\":\"https://link.springer.com/article/10.1007%2Fs11219-015-9294-2\"},{\"Ty\":1,\"U\":\"http://dblp.uni-trier.de/db/journals/sqj/sqj25.html#PerscheidSTH17\"}],\"VFN\":\"Software Quality Journal\",\"V\":25,\"I\":1,\"FP\":83,\"LP\":110,\"DOI\":\"10.1007/s11219-015-9294-2\",\"PR\":[2794673032,2604560923,2039179155,2527840817,2067436653,649949742,2726267606,2770272372,2293310672,1973924171,2008424891,2052885256,2497849102,2291724978,1571919519,2088137140,2030348613,2491623261,2767603763,2900485839,2794673032,2604560923,2039179155,2527840817,2067436653,649949742,2726267606,2770272372,2293310672,1973924171,2008424891,2052885256,2497849102,2291724978,1571919519,2088137140,2030348613,2491623261,2767603763,2900485839],\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":1},{\"FN\":\"Benjamin\",\"LN\":\"Siegmund\",\"S\":2},{\"FN\":\"Marcel\",\"LN\":\"Taeumel\",\"S\":3},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":4}],\"BV\":\"Software Quality Journal\",\"BT\":\"a\",\"PB\":\"Springer US\"}"},{"logprob":-20.64,"Id":1774013863,"Ty":"0","Ti":"test driven fault navigation for debugging reproducible failures","Pt":"1","L":"en@@@ja","Y":2012,"D":"2012-01-01","CC":10,"ECC":10,"RId":[2014309790,2079317829,2101819268,2162376048,2106588364,2162045655,2036196659,2166007208,1964962870,2099332975,2164372721,1574060188,2165663378,2136213879,1673079227,2134876531,2002985857,2070321219,2782959840,2028530550,1507612039,2166633979,2162541525,175708229,2125825154,2092239677,2136887998,1482473201,2155848253,1972151373,2065296680,2066031375,169400382,2130237836,152925115],"W":["debugging","driven","failures","fault","navigation","reproducible","test"],"AA":[{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":1},{"DAuN":"Michael Haupt","AuN":"michael haupt","AuId":2146662369,"DAfN":"Oracle Corporation","AfN":"oracle corporation","AfId":1342911587,"S":2},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":3},{"DAuN":"Hidehiko Masuhara","AuN":"hidehiko masuhara","AuId":2087436944,"DAfN":"University of Tokyo","AfN":"university of tokyo","AfId":74801974,"S":4}],"F":[{"DFN":"Test case","FN":"test case","FId":128942645},{"DFN":"Real-time computing","FN":"real time computing","FId":79403827},{"DFN":"Failure causes","FN":"failure causes","FId":28944875},{"DFN":"Debugging","FN":"debugging","FId":168065819},{"DFN":"Debugger","FN":"debugger","FId":2778485113},{"DFN":"Computer science","FN":"computer science","FId":41008148},{"DFN":"Algorithmic program debugging","FN":"algorithmic program debugging","FId":136388014}],"J":{"JN":"journal of information processing","JId":192843772},"E":"{\"DN\":\"Test-driven Fault Navigation for Debugging Reproducible Failures\",\"IA\":{\"IndexLength\":213,\"InvertedIndex\":{\"Debugging\":[0],\"failing\":[1,174],\"test\":[2,122,175,195],\"cases,\":[3,123,196],\"particularly\":[4],\"the\":[5,18,29,64,140,191,197,204],\"search\":[6,32,155],\"for\":[7,91,132,156,164,177,193],\"failure\":[8,65,117,159],\"causes,\":[9],\"is\":[10,69,88,167],\"often\":[11],\"a\":[12,152,168],\"laborious\":[13],\"and\":[14,49,116,136,161,203],\"timeconsuming\":[15],\"activity.\":[16],\"With\":[17],\"help\":[19],\"of\":[20,187,200,208],\"spectrum-based\":[21],\"fault\":[22,105],\"localization\":[23],\"developers\":[24,51,129,163],\"are\":[25],\"able\":[26],\"to\":[27,54,82,100,183],\"reduce\":[28],\"potentially\":[30],\"large\":[31],\"space\":[33],\"by\":[34,59],\"detecting\":[35],\"anomalies\":[36,43,115],\"in\":[37,139],\"tested\":[38],\"program\":[39],\"entities.\":[40],\"However,\":[41],\"such\":[42],\"do\":[44],\"not\":[45,74],\"necessarily\":[46],\"indicate\":[47],\"defects\":[48],\"so\":[50],\"still\":[52],\"have\":[53],\"analyze\":[55],\"numerous\":[56],\"candidates\":[57],\"one\":[58,60],\"until\":[61],\"they\":[62],\"find\":[63],\"cause.\":[66],\"This\":[67],\"procedure\":[68],\"inefficient\":[70],\"since\":[71],\"it\":[72],\"does\":[73],\"take\":[75],\"into\":[76],\"account\":[77],\"how\":[78,96],\"suspicious\":[79,126],\"entities\":[80],\"relate\":[81],\"each\":[83],\"other,\":[84],\"whether\":[85],\"another\":[86],\"developer\":[87],\"better\":[89],\"qualified\":[90,131],\"debugging\":[92,110,194],\"this\":[93],\"failure,\":[94],\"or\":[95],\"erroneous\":[97,137],\"behavior\":[98,138,176],\"comes\":[99],\"be.\":[101],\"We\":[102],\"present\":[103],\"test-driven\":[104],\"navigation\":[106],\"as\":[107],\"an\":[108],\"interconnected\":[109],\"guide\":[111],\"that\":[112,172],\"integrates\":[113],\"spectrumbased\":[114],\"causes.\":[118],\"By\":[119],\"analyzing\":[120],\"failure-reproducing\":[121],\"we\":[124],\"reveal\":[125],\"system\":[127],\"parts,\":[128],\"most\":[130],\"addressing\":[133],\"localized\":[134],\"faults,\":[135],\"execution\":[141],\"history.\":[142],\"The\":[143,185],\"Paths\":[144],\"tool\":[145,211],\"suite\":[146],\"realizes\":[147],\"our\":[148,188,209],\"approach:\":[149],\"PathMap\":[150],\"supports\":[151],\"breadth\":[153],\"first\":[154],\"narrowing\":[157],\"down\":[158],\"causes\":[160],\"recommends\":[162],\"help;\":[165],\"PathFinder\":[166],\"lightweight\":[169],\"back-in-time\":[170],\"debugger\":[171],\"classifies\":[173],\"easily\":[178],\"following\":[179],\"infection\":[180],\"chains\":[181],\"back\":[182],\"defects.\":[184],\"evaluation\":[186],\"approach\":[189],\"illustrates\":[190],\"improvements\":[192],\"high\":[198],\"accuracy\":[199],\"recommended\":[201],\"developers,\":[202],\"fast\":[205],\"response\":[206],\"times\":[207],\"corresponding\":[210],\"suite.\":[212]}},\"S\":[{\"Ty\":3,\"U\":\"http://www.hirschfeld.org/writings/media/PerscheidHauptHirschfeldMasuhara_2012_TestDrivenFaultNavigationForDebuggingReproducibleFailures_JSSST.pdf\"},{\"Ty\":3,\"U\":\"http://prg.is.titech.ac.jp/members/masuhara/papers/compsoft2012.pdf\"},{\"Ty\":1,\"U\":\"http://ci.nii.ac.jp/naid/130003324424\"},{\"Ty\":1,\"U\":\"https://www.jstage.jst.go.jp/article/imt/7/4/7_1377/_article\"}],\"VFN\":\"Journal of Information Processing\",\"V\":7,\"I\":4,\"FP\":1377,\"LP\":1400,\"DOI\":\"10.11185/imt.7.1377\",\"CC\":{\"1972151373\":[\"29,No.3 (2012),pp.\"],\"2162045655\":[\"Information and Media Technologies 7(4): 1377-1400 (2012) reprinted from: Computer Software 29(3): 188-211 (2012) © Japan Society for Software Science and Technology\"]},\"PR\":[2111708921,2001919024,2775592182,2062154010,1219082078,2807730630,1605507930,1574060188,2598366710,66783427,2004141756,2118315969,2082732081,2578469907,2762915977,1860170051,2154701440,1994816063,1574571988,2096761130,2111708921,2001919024,2775592182,2062154010,1219082078,2807730630,1605507930,1574060188,2598366710,66783427,2004141756,2118315969,2082732081,2578469907,2762915977,1860170051,2154701440,1994816063,1574571988,2096761130],\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":1},{\"FN\":\"Michael\",\"LN\":\"Haupt\",\"S\":2},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":3},{\"FN\":\"Hidehiko\",\"LN\":\"Masuhara\",\"S\":4}],\"BV\":\"Journal of Information Processing\",\"BT\":\"a\",\"PB\":\"Information and Media Technologies Editorial Board\"}"},{"logprob":-20.825,"Id":2136885942,"Ty":"0","Ti":"explicit use case representation in object oriented programming languages","Pt":"3","L":"en","Y":2011,"D":"2011-10-24","CC":11,"ECC":11,"RId":[2138363365,2139907081,1500250067,2128581098,1552830686,2075642720,2150275961,2163960678,2148357053,2129559874,2125682153,1574060188,2101730275,2162363818,2121234902,2104354357,2041853131,2113647890,2113476536,2539187648,2111014165,1563647787,2001033929,2002454301,2072661102,2077997855,1984129195,2151318864,1510987657,2803343605,2169540278,2169326591,149861366,1998033538,2133815117],"W":["case","explicit","languages","object","oriented","programming","representation"],"AA":[{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":1},{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":2},{"DAuN":"Michael Haupt","AuN":"michael haupt","AuId":2146662369,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":3}],"F":[{"DFN":"Theoretical computer science","FN":"theoretical computer science","FId":80444323},{"DFN":"Source code","FN":"source code","FId":43126263},{"DFN":"Separation of concerns","FN":"separation of concerns","FId":76214141},{"DFN":"Second-generation programming language","FN":"second generation programming language","FId":11164408},{"DFN":"Programming paradigm","FN":"programming paradigm","FId":34165917},{"DFN":"Programming language","FN":"programming language","FId":199360897},{"DFN":"Intentional programming","FN":"intentional programming","FId":24125291},{"DFN":"Fourth-generation programming language","FN":"fourth generation programming language","FId":145628200},{"DFN":"Fifth-generation programming language","FN":"fifth generation programming language","FId":199305712},{"DFN":"Computer science","FN":"computer science","FId":41008148},{"DFN":"Computer programming","FN":"computer programming","FId":33857546}],"C":{"CN":"dls","CId":1133200404},"E":"{\"DN\":\"Explicit use-case representation in object-oriented programming languages\",\"IA\":{\"IndexLength\":171,\"InvertedIndex\":{\"Use-cases\":[0],\"are\":[1],\"considered\":[2],\"an\":[3,87,153],\"integral\":[4],\"part\":[5],\"of\":[6,22,29,49,66,124,136,155],\"most\":[7],\"contemporary\":[8],\"development\":[9,41,160],\"processes\":[10],\"since\":[11],\"they\":[12],\"describe\":[13],\"a\":[14],\"software\":[15],\"system's\":[16],\"expected\":[17],\"behavior\":[18],\"from\":[19],\"the\":[20,27,47,67,96,100,107,110,130,134,167],\"perspective\":[21],\"its\":[23,164],\"prospective\":[24],\"users.\":[25,131],\"However,\":[26],\"presence\":[28],\"and\":[30,60,76,99,109,117,140,163],\"traceability\":[31],\"to\":[32,54,70,89,119,129,143,158,166],\"use-cases\":[33,72,91,104],\"is\":[34,73],\"increasingly\":[35],\"lost\":[36],\"in\":[37,57,94,106,161],\"later\":[38],\"more\":[39],\"code-centric\":[40],\"activities.\":[42],\"Use-cases,\":[43],\"being\":[44],\"well-encapsulated\":[45],\"at\":[46],\"level\":[48],\"requirements\":[50],\"descriptions,\":[51],\"eventually\":[52],\"lead\":[53],\"crosscutting\":[55],\"concerns\":[56],\"system\":[58,68,112],\"design\":[59],\"source\":[61,146],\"code.\":[62],\"Tracing\":[63],\"which\":[64,71],\"parts\":[65],\"contribute\":[69],\"therefore\":[74],\"hard\":[75],\"so\":[77],\"limits\":[78],\"understandability.\":[79],\"In\":[82],\"this\":[83],\"paper,\":[84],\"we\":[85],\"propose\":[86],\"approach\":[88,157],\"making\":[90],\"first-class\":[92],\"entities\":[93],\"both\":[95],\"programming\":[97],\"language\":[98],\"runtime\":[101],\"environment.\":[102],\"Having\":[103],\"present\":[105,151],\"code\":[108,147],\"running\":[111],\"will\":[113],\"allow\":[114],\"developers,\":[115],\"maintainers,\":[116],\"operators\":[118],\"easily\":[120],\"associate\":[121,145],\"their\":[122],\"units\":[123],\"work\":[125],\"with\":[126,148],\"what\":[127],\"matters\":[128],\"We\":[132,150],\"suggest\":[133],\"combination\":[135],\"use-cases,\":[137],\"acceptance\":[138],\"tests,\":[139],\"dynamic\":[141],\"analysis\":[142],\"automatically\":[144],\"use-cases.\":[149],\"UseCasePy,\":[152],\"implementation\":[154],\"our\":[156],\"use-case-centered\":[159],\"Python,\":[162],\"application\":[165],\"Django\":[168],\"Web\":[169],\"framework.\":[170]}},\"S\":[{\"Ty\":3,\"U\":\"http://www.hpi.uni-potsdam.de/hirschfeld/publications/media/HirschfeldPerscheidHaupt_2011_Explicit%20UseCaseRepresentationInObjectOrientedProgrammingLanguages_AcmDL.pdf\"},{\"Ty\":3,\"U\":\"http://www.hirschfeld.org/writings/media/HirschfeldPerscheidHaupt_2011_Explicit%20UseCaseRepresentationInObjectOrientedProgrammingLanguages_AcmDL.pdf\"},{\"Ty\":1,\"U\":\"https://dl.acm.org/citation.cfm?id=2047856\"},{\"Ty\":1,\"U\":\"https://publishup.uni-potsdam.de/opus4-ubp/frontdoor/index/index/docId/36139\"},{\"Ty\":0,\"U\":\"http://dl.acm.org/citation.cfm?id=2047856\"}],\"VFN\":\"Dynamic Languages Symposium\",\"VSN\":\"DLS\",\"V\":47,\"I\":2,\"FP\":51,\"LP\":60,\"DOI\":\"10.1145/2047849.2047856\",\"CC\":{\"1510987657\":[\"AspectU [28] introduces an aspect entity at the use-case requirement level similar to AspectJ at implementation level.\"],\"1563647787\":[\"Moreover, dependencies between usecase implementations are not obvious, leading to missing or erroneous annotations [18].\"],\"1574060188\":[\"Developers have to follow the infection chain backwards from the observable failure to the past defect, which is largely a search problem in time and space of programs [35].\"],\"1984129195\":[\"Contemporary object-oriented programming languages are very limited when it comes to reflecting the users’ perspectives in the actual source code of the system [34].\",\"Further research has refined this concept by defining metrics [23, 34] and heuristics [14] or interactively analyzing features at the sub-method level [10] to quantify features and source code more precisely.\"],\"1998033538\":[\"Further research has refined this concept by defining metrics [23, 34] and heuristics [14] or interactively analyzing features at the sub-method level [10] to quantify features and source code more precisely.\"],\"2001033929\":[\"It is hardly possible to determine solely from source code how objects contribute to the run-time behavior of the system, which is to a large degree due to language features such as late binding or polymorphism [8].\"],\"2002454301\":[\"Feature Localization Feature engineering [30] introduces features as the natural organization of a system’s functionality from the users’ point of view.\"],\"2041853131\":[\"Besides dynamic analysis, there are alternative approaches based on information retrieval techniques [24, 36].\"],\"2072661102\":[\"The TraceAnalyzer [12] is similar to our approach since it uses run-time information of scenarios to recover traceability links.\"],\"2077997855\":[\"Based on a few links created manually, LeanArt [16] recovers traceability links between use-case diagrams and types and variables.\"],\"2101730275\":[\"Feature-oriented programming (FOP) [4] and context-oriented programming (COP) [19] are paradigms that capture increments in program functionality.\"],\"2104354357\":[\"Similar concepts [6] focus on test coverage [3] and recovering architectural entities [5].\"],\"2111014165\":[\"A further approach uses static and dynamic concepts with several tools such as parser and processor emulation [1] solving difficulties of collecting dynamic data and combining features and micro architecture together.\"],\"2113476536\":[\"Further research has refined this concept by defining metrics [23, 34] and heuristics [14] or interactively analyzing features at the sub-method level [10] to quantify features and source code more precisely.\"],\"2113647890\":[\"Due to the crosscutting characteristics of use-cases in design and implementation activities [21, 22], their realizing objects end up being scattered over and tangled with the rest of the system.\",\"Aspects Use-case modularity [21] argues that aspect-oriented programming can provide the missing link between use-cases and implementation.\"],\"2121234902\":[\"Developers frequently have to associate requirements expressed by a customer or user with the responsible locations in a system’s implementation [32].\",\"After test execution, the collected traces are used to map source code entities to use-case objects in a so-called use-case method-map (adapted from feature analysis [17, 32])—use-case implementations are said to refer to a method when that method has been executed at least once in a specific use-case trace.\",\"The Software Reconnaissance technique [32, 33] was the first to use dynamic analysis to locate features.\"],\"2125682153\":[\"Another approach extends the idea with static analysis of dependency graphs and formal concept analysis [13].\"],\"2128581098\":[\"There are also some approaches based on information retrieval [2, 26].\"],\"2129559874\":[\"Requirements Traceability Requirements traceability refers to the ability to follow the life of a requirement, both forwards and backwards [15].\",\"This reuse of requirements documents can lead to a significant decrease in time, effort, and costs of software development [15].\"],\"2133815117\":[\"Similar concepts [6] focus on test coverage [3] and recovering architectural entities [5].\"],\"2148357053\":[\"This initial task consists of studying and analyzing an often only partially understood system to store the mappings of system functionalities to source code [25], which is likely to be nontrivial and timeconsuming.\"],\"2150275961\":[\"Feature-oriented programming (FOP) [4] and context-oriented programming (COP) [19] are paradigms that capture increments in program functionality.\"],\"2151318864\":[\"The Software Reconnaissance technique [32, 33] was the first to use dynamic analysis to locate features.\"],\"2163960678\":[\"There are also some approaches based on information retrieval [2, 26].\"],\"2169326591\":[\"Similar concepts [6] focus on test coverage [3] and recovering architectural entities [5].\"],\"2169540278\":[\"Further research has refined this concept by defining metrics [23, 34] and heuristics [14] or interactively analyzing features at the sub-method level [10] to quantify features and source code more precisely.\"],\"2539187648\":[\"Besides dynamic analysis, there are alternative approaches based on information retrieval techniques [24, 36].\",\"For instance, latent semantic indexing will be used to locate similar source code identifiers in different documents [24].\"],\"2803343605\":[\"After test execution, the collected traces are used to map source code entities to use-case objects in a so-called use-case method-map (adapted from feature analysis [17, 32])—use-case implementations are said to refer to a method when that method has been executed at least once in a specific use-case trace.\",\"The usefulness of considering features as the missing link between the users’ point of view and the implementation level was evaluated in several publications explaining the correlation between features and code, characterizing the functional role of classes and methods, and revealing how developers develop features [17].\"]},\"PR\":[2795148395,194409236,1547182252,2469219848,204461497,37128026,2154778832,2181829784,2182619624,2550782796,2186224784,1606671338,192257153,2782050458,2273196620,2602532206,2259495429,2183043735,1561331312,2407603019,2795148395,194409236,1547182252,2469219848,204461497,37128026,2154778832,2181829784,2182619624,2550782796,2186224784,1606671338,192257153,2782050458,2273196620,2602532206,2259495429,2183043735,1561331312,2407603019],\"ANF\":[{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":1},{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":2},{\"FN\":\"Michael\",\"LN\":\"Haupt\",\"S\":3}],\"BV\":\"Proceedings of the 7th symposium on Dynamic languages\",\"BT\":\"p\",\"PB\":\"ACM\"}"},{"logprob":-20.829,"Id":2002568360,"Ty":"0","Ti":"dynamic contract layers","Pt":"3","L":"en","Y":2010,"D":"2010-03-22","CC":14,"ECC":14,"RId":[2138363365,2480195817,2143238865,2161825580,2052363833,2150275961,2886283850,2125682153,1555946950,1574060188,2111706174,1992443356,1531869376,2090496119,2144114063,166270156,61997153,1491095550,2105142318,2087175184,2165121897,1601712140,956539890,1556513858,2172169742,1584704555,2803343605,221784231,2164859807,2146987093,2118399307],"W":["contract","dynamic","layers"],"AA":[{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":1},{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":2},{"DAuN":"Christian Schubert","AuN":"christian schubert","AuId":2493869840,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":3},{"DAuN":"Malte Appeltauer","AuN":"malte appeltauer","AuId":135591984,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":4}],"F":[{"DFN":"dBc","FN":"dbc","FId":193523891},{"DFN":"Thread (computing)","FN":"thread","FId":138101251},{"DFN":"Real-time computing","FN":"real time computing","FId":79403827},{"DFN":"Python (programming language)","FN":"python","FId":519991488},{"DFN":"Implementation","FN":"implementation","FId":26713055},{"DFN":"Function composition (computer science)","FN":"function composition","FId":104637301},{"DFN":"Enforcement","FN":"enforcement","FId":2779777834},{"DFN":"Design by contract","FN":"design by contract","FId":80291951},{"DFN":"Contract management","FN":"contract management","FId":55451941},{"DFN":"Computer science","FN":"computer science","FId":41008148}],"C":{"CN":"sac","CId":2754781246},"E":"{\"DN\":\"Dynamic contract layers\",\"IA\":{\"IndexLength\":170,\"InvertedIndex\":{\"Design\":[0],\"by\":[1,116,161],\"Contract\":[2,45],\"(DBC)\":[4],\"is\":[5,143],\"a\":[6,35,117],\"programming\":[7,155],\"technique\":[8],\"to\":[9,26,70,82,165],\"separate\":[10],\"contract\":[11,97,105,131],\"enforcement\":[12,46,132],\"from\":[13,43,110],\"application\":[14],\"code.\":[15],\"DBC\":[16,40,115],\"provides\":[17],\"information\":[18],\"about\":[19],\"the\":[20,29,71,83,153,166],\"applicability\":[21],\"of\":[22,34,74,126,141],\"methods\":[23],\"and\":[24,61,76,103,124,129],\"helps\":[25],\"narrow\":[27],\"down\":[28],\"search\":[30],\"space\":[31],\"in\":[32,65],\"case\":[33],\"software\":[36],\"failure.\":[37],\"However,\":[38],\"most\":[39],\"implementations\":[41],\"suffer\":[42],\"inflexibility:\":[44],\"can\":[47],\"only\":[48],\"be\":[49,63,79],\"activated\":[50],\"or\":[51,55],\"deactivated\":[52],\"at\":[53,133],\"compile-time\":[54],\"start-up,\":[56],\"contracts\":[57,77,164],\"are\":[58],\"checked\":[59],\"globally\":[60],\"cannot\":[62,78],\"restricted\":[64],\"their\":[66],\"scope\":[67],\"such\":[68,127],\"as\":[69],\"current\":[72],\"thread\":[73],\"execution,\":[75],\"grouped\":[80],\"according\":[81],\"concerns\":[84],\"they\":[85],\"relate\":[86],\"to.\":[87],\"In\":[90],\"this\":[91],\"paper,\":[92],\"we\":[93,113],\"present\":[94],\"dynamic\":[96],\"layers\":[98],\"(DCL)\":[99],\"for\":[101,120,152],\"fine-grained\":[102],\"flexible\":[104],\"management.\":[106],\"Based\":[107],\"on\":[108],\"ideas\":[109],\"context-oriented\":[111],\"programming,\":[112],\"extend\":[114],\"grouping\":[118],\"mechanism\":[119],\"contracts,\":[121],\"thread-local\":[122],\"activation\":[123],\"deactivation\":[125],\"groups,\":[128],\"selective\":[130],\"run-time.\":[134],\"PyDCL\":[136,163],\",\":[137,148],\"our\":[138,149,159],\"proof-of-concept\":[139],\"implementation\":[140],\"DCL,\":[142],\"built\":[144],\"onto\":[145],\"ContextPy\":[147],\"COP\":[150],\"extension\":[151],\"Python\":[154],\"language.\":[156],\"We\":[157],\"evaluate\":[158],\"approach\":[160],\"applying\":[162],\"Moin-Moin\":[167],\"Wiki\":[168],\"framework.\":[169]}},\"S\":[{\"Ty\":3,\"U\":\"http://www.hirschfeld.org/writings/media/HirschfeldPerscheidSchubertAppeltauer_2010_DynamicContractLayers_AcmDL.pdf\"},{\"Ty\":1,\"U\":\"https://doi.acm.org/10.1145/1774088.1774546\"},{\"Ty\":1,\"U\":\"http://dblp.uni-trier.de/db/conf/sac/sac2010.html#HirschfeldPSA10\"},{\"Ty\":1,\"U\":\"https://dl.acm.org/ft_gateway.cfm?id=1774546&type=pdf\"}],\"VFN\":\"ACM Symposium on Applied Computing\",\"VSN\":\"SAC\",\"FP\":2169,\"LP\":2175,\"DOI\":\"10.1145/1774088.1774546\",\"CC\":{\"61997153\":[\"PyDCL is our implementation of DCL in and for the Python programming language [28].\"],\"166270156\":[\"iContract by Kramer [20] uses structured comments (like [25, 31]) for specifying contracts and provides a preprocessor that instruments the original source code with contract checks.\"],\"956539890\":[\"Some AOP languages, such as CaesarJ [3] and AspectS [12] overcome this limitation and provide dynamic aspect weaving, though they lack in supporting annotationbased pointcuts.\"],\"1491095550\":[\"Some AOP languages, such as CaesarJ [3] and AspectS [12] overcome this limitation and provide dynamic aspect weaving, though they lack in supporting annotationbased pointcuts.\"],\"1555946950\":[\"The ideas of DBC [21] and their first incarnation in the Eiffel programming language [22] have contributed to software engineering for almost two decades now [27].\"],\"1556513858\":[\"So far, COP has been implemented for several languages such as Lisp [5], Smalltalk [13], Python [29], 1 employerLayer = layer(\\\"Employer\\\")\"],\"1574060188\":[\"In future work, we are interested in exploring inductive debugging concepts in combination with automatically generated contracts [32].\",\"Future work will be concerned with inductive debugging techniques [32].\"],\"1584704555\":[\"In Duncan and Hölzle’s Handshake [6] contracts are read from a separate file with a Java-like syntax.\"],\"1992443356\":[\"So far, COP has been implemented for several languages such as Lisp [5], Smalltalk [13], Python [29], 1 employerLayer = layer(\\\"Employer\\\")\"],\"2052363833\":[\"With Design by Contract (DBC [16, 21]) programmers can separate the specification of pre- and postconditions and invariants from their application code to improve code comprehensibility and quality.\",\"The ideas of DBC [21] and their first incarnation in the Eiffel programming language [22] have contributed to software engineering for almost two decades now [27].\",\"Besides the original DBC implementation in Eiffel [21], we can find DBC extensions to several other programming languages.\"],\"2087175184\":[\"So far, COP has been implemented for several languages such as Lisp [5], Smalltalk [13], Python [29], 1 employerLayer = layer(\\\"Employer\\\")\",\"PyContext [29] is another COP library in Python.\"],\"2090496119\":[\"With Design by Contract (DBC [16, 21]) programmers can separate the specification of pre- and postconditions and invariants from their application code to improve code comprehensibility and quality.\"],\"2111706174\":[\"The roots of DBC can be traced back to the work of Floyd [8] and Hoare [15].\"],\"2118399307\":[\"The ideas of DBC [21] and their first incarnation in the Eiffel programming language [22] have contributed to software engineering for almost two decades now [27].\"],\"2125682153\":[\"For instance, grouping contracts related to specific requirements is almost impossible since the implementation of most of the requirements are spread over several classes and so cannot be related to a single one [7, 9].\"],\"2143238865\":[\"Aspect-oriented programming [19] (AOP) provides language abstractions to encapsulate crosscutting concerns, thus it is conceptually related to COP.\"],\"2144114063\":[\"An overview of most of them is provided in [1].\",\"It supports the layer-in-class approach [1] and with that allows developers to define their partial methods within the scope of the actual classes these methods are contributing to.\"],\"2146987093\":[\"Guerreiro [10] implements contracts for C++.\"],\"2150275961\":[\"In this paper, we present dynamic contract layers (DCL), which augment the flexibility of state-of-theart DBC approaches by combining them with ideas from context-oriented programming (COP [14]).\",\"It turns out that context-oriented programming [14] (COP) is an ideal base for our extension to DBC.\",\"A broader introduction to COP is provided in [14].\"],\"2161825580\":[\"During the evaluation of an assertion all subsequent method calls must be executed without any evaluation [23].\"],\"2164859807\":[\"Today, there are at least three freely available implementations of DBC in Python: Design by Contract by Plösch [25], ContractPy [31], and PyDBC [4].\",\"iContract by Kramer [20] uses structured comments (like [25, 31]) for specifying contracts and provides a preprocessor that instruments the original source code with contract checks.\"],\"2165121897\":[\"Later work by Parnas [24] already\"],\"2172169742\":[\"Ruby [26], and Java [2].\"],\"2480195817\":[\"Contract4J [30] is an AspectJ [18] based tool that supports classic DBC.\"],\"2803343605\":[\"For instance, grouping contracts related to specific requirements is almost impossible since the implementation of most of the requirements are spread over several classes and so cannot be related to a single one [7, 9].\",\"Feature analysis [9] is a research area that provides an answer to the question which methods are concerned in which features.\"]},\"PR\":[1992443356,1556513858,2065646798,2087175184,2143238865,2144114063,2150275961,2286558606,1572825593,2014881790,2075642720,2115607078,34876640,260230765,2136563725,2022299558,2593584386,778258840,2142650158,2135583192,1992443356,1556513858,2065646798,2087175184,2143238865,2144114063,2150275961,2286558606,1572825593,2014881790,2075642720,2115607078,34876640,260230765,2136563725,2022299558,2593584386,778258840,2142650158,2135583192],\"ANF\":[{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":1},{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":2},{\"FN\":\"Christian\",\"LN\":\"Schubert\",\"S\":3},{\"FN\":\"Malte\",\"LN\":\"Appeltauer\",\"S\":4}],\"BV\":\"Proceedings of the 2010 ACM Symposium on Applied Computing\",\"BT\":\"p\",\"PB\":\"ACM\"}"},{"logprob":-21,"Id":2012451248,"Ty":"0","Ti":"interleaving of modification and use in data driven tool development","Pt":"3","L":"en","Y":2014,"D":"2014-10-20","CC":9,"ECC":9,"RId":[1539495021,2110001365,2148357053,2100894766,2130344546,2157943826,2097750323,2104686990,1660714679,2162831261,1964757858,90361031,2001033929,1594284843,1917216709,2107472520,2113908489,1597340042,1964316648,2145512597,2030836928,2012072241,2101876886,1967922118,2081968687,1659767374,2136885942,2103211722,1972151373,2090696691,2040040157,2031995884,1965549686],"W":["data","development","driven","interleaving","modification","tool"],"AA":[{"DAuN":"Marcel Taeumel","AuN":"marcel taeumel","AuId":83004794,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":1},{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"SAP Innovation Center Potsdam, Germany, Potsdam, Germany","S":2},{"DAuN":"Bastian Steinert","AuN":"bastian steinert","AuId":2142371068,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":3},{"DAuN":"Jens Lincke","AuN":"jens lincke","AuId":2055148755,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":4},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":5}],"F":[{"DFN":"Squeak","FN":"squeak","FId":2780281086},{"DFN":"Smalltalk","FN":"smalltalk","FId":2777293101},{"DFN":"Shell script","FN":"shell script","FId":150631331},{"DFN":"Scripting language","FN":"scripting language","FId":61423126},{"DFN":"Programming language","FN":"programming language","FId":199360897},{"DFN":"Modularity","FN":"modularity","FId":100648641},{"DFN":"Missing data","FN":"missing data","FId":9357733},{"DFN":"Interleaving","FN":"interleaving","FId":28034677},{"DFN":"GLUE","FN":"glue","FId":2779937294},{"DFN":"Computer science","FN":"computer science","FId":41008148}],"C":{"CN":"onward","CId":2759899939},"E":"{\"DN\":\"Interleaving of Modification and Use in Data-driven Tool Development\",\"IA\":{\"IndexLength\":145,\"InvertedIndex\":{\"Programmers\":[0],\"working\":[1],\"in\":[2,18,89,136],\"a\":[3,24,55,87],\"Unix-like\":[4],\"environment\":[5],\"can\":[6,129],\"easily\":[7,48],\"build\":[8],\"custom\":[9],\"tools\":[10,41,60,128],\"by\":[11,50],\"configuring\":[12],\"and\":[13,27,69,80,107,118,142],\"combining\":[14],\"small\":[15],\"filter\":[16],\"programs\":[17],\"shell\":[19],\"scripts.\":[20],\"When\":[21],\"leaving\":[22],\"such\":[23,103,114],\"text-based\":[25],\"world\":[26],\"entering\":[28],\"one\":[29],\"that\":[30,61,91,123],\"is\":[31,36],\"graphics-based,\":[32],\"however,\":[33],\"tool\":[34,94],\"building\":[35],\"more\":[37],\"difficult\":[38],\"because\":[39],\"graphical\":[40,59,127],\"are\":[42],\"typically\":[43],\"not\":[44],\"prepared\":[45],\"to\":[46,75],\"be\":[47],\"re-programmed\":[49],\"their\":[51],\"users.\":[52],\"We\":[53,121],\"propose\":[54],\"data-driven\":[56],\"perspective\":[57,125],\"on\":[58,126],\"uses\":[62],\"concise\":[63],\"scripts\":[64],\"as\":[65,73,104,115],\"glue\":[66],\"between\":[67],\"data\":[68,78],\"views\":[70],\"but\":[71,109],\"also\":[72,110],\"means\":[74],\"express\":[76],\"missing\":[77],\"transformations\":[79],\"view\":[81],\"items.\":[82],\"Given\":[83],\"this,\":[84],\"we\":[85],\"built\":[86],\"framework\":[88],\"Squeak/Smalltalk\":[90],\"promotes\":[92],\"low-effort\":[93],\"construction;\":[95],\"it\":[96],\"works\":[97],\"well\":[98],\"for\":[99,111,138],\"basic\":[100],\"programming\":[101],\"tools,\":[102],\"code\":[105],\"editors\":[106],\"debuggers,\":[108],\"other\":[112],\"domains,\":[113],\"developer\":[116],\"chats\":[117],\"issue\":[119],\"browsers.\":[120],\"think\":[122],\"this\":[124],\"inspire\":[130],\"the\":[131],\"creation\":[132],\"of\":[133],\"new\":[134],\"trade-offs\":[135],\"modularity\":[137],\"both\":[139],\"data-providing\":[140],\"projects\":[141],\"interactive\":[143],\"views.\":[144]}},\"S\":[{\"Ty\":1,\"U\":\"https://doi.acm.org/10.1145/2661136.2661150\"},{\"Ty\":1,\"U\":\"https://dl.acm.org/citation.cfm?doid=2661136.2661150\"},{\"Ty\":0,\"U\":\"http://dl.acm.org/citation.cfm?doid=2661136.2661150\"}],\"VFN\":\"SIGPLAN symposium on New ideas, new paradigms, and reflections on programming and software\",\"VSN\":\"Onward!\",\"FP\":185,\"LP\":200,\"DOI\":\"10.1145/2661136.2661150\",\"PR\":[2040040157,2172147300,183550334,1547182252,2795148395,2576360137,2294433813,2014738545,2100595214,2557937871,2486569610,2337914944,2498902211,2273196620,2610948442,1124016543,2886686348,2128383602,1972107637,401714238,2040040157,2172147300,183550334,1547182252,2795148395,2576360137,2294433813,2014738545,2100595214,2557937871,2486569610,2337914944,2498902211,2273196620,2610948442,1124016543,2886686348,2128383602,1972107637,401714238],\"ANF\":[{\"FN\":\"Marcel\",\"LN\":\"Taeumel\",\"S\":1},{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":2},{\"FN\":\"Bastian\",\"LN\":\"Steinert\",\"S\":3},{\"FN\":\"Jens\",\"LN\":\"Lincke\",\"S\":4},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":5}],\"BV\":\"Proceedings of the 2014 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming & Software\",\"BT\":\"p\",\"PB\":\"ACM\"}"},{"logprob":-21.162,"Id":1972151373,"Ty":"0","Ti":"immediacy through interactivity online analysis of run time behavior","Pt":"3","L":"en","Y":2010,"D":"2010-10-01","CC":11,"ECC":11,"RId":[1649645444,2480195817,2131664240,2148357053,2100894766,1541128807,2164372721,2097750323,1531869376,61440716,1673079227,2002985857,2132383311,1638356594,1574879889,2162831261,2782959840,2001033929,1507612039,2059838712,2079194250,2123344540,2170311191,2006684428,2161922591,2155848253,2803343605,1506052820,1513058800,1548205805,152925115],"W":["behavior","immediacy","interactivity","online","run","time"],"AA":[{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":1},{"DAuN":"Bastian Steinert","AuN":"bastian steinert","AuId":2142371068,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":2},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":3},{"DAuN":"Felix Geller","AuN":"felix geller","AuId":2226670134,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":4},{"DAuN":"Michael Haupt","AuN":"michael haupt","AuId":2146662369,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":5}],"F":[{"DFN":"Visualization","FN":"visualization","FId":36464697},{"DFN":"Test case","FN":"test case","FId":128942645},{"DFN":"Static timing analysis","FN":"static timing analysis","FId":93682380},{"DFN":"Real-time computing","FN":"real time computing","FId":79403827},{"DFN":"Program comprehension","FN":"program comprehension","FId":2777561058},{"DFN":"Interactivity","FN":"interactivity","FId":144430266},{"DFN":"Immediacy","FN":"immediacy","FId":2780340563},{"DFN":"Development environment","FN":"development environment","FId":139968098},{"DFN":"Computer science","FN":"computer science","FId":41008148},{"DFN":"Comprehension","FN":"comprehension","FId":511192102}],"C":{"CN":"wcre","CId":1131743930},"E":"{\"DN\":\"Immediacy through Interactivity: Online Analysis of Run-time Behavior\",\"IA\":{\"IndexLength\":136,\"InvertedIndex\":{\"Visualizations\":[0],\"of\":[1,8,15,61,91,109,134],\"actual\":[2],\"run-time\":[3,23,49,62,89,118],\"data\":[4,119],\"support\":[5,12],\"the\":[6,13,21,107],\"comprehension\":[7],\"programs,\":[9],\"like\":[10],\"examples\":[11],\"explanation\":[14],\"abstract\":[16],\"concepts\":[17],\"and\":[18,47,83,103],\"principles.\":[19],\"Unfortunately,\":[20],\"required\":[22],\"analysis\":[24,54],\"is\":[25,70],\"often\":[26],\"associated\":[27],\"with\":[28],\"an\":[29,42,76,121],\"inconvenient\":[30],\"overhead\":[31,105],\"that\":[32,78,117],\"renders\":[33],\"current\":[34],\"tools\":[35],\"impractical\":[36],\"for\":[37,56,120,132],\"frequent\":[38],\"use.\":[39],\"We\":[40,74,95],\"propose\":[41],\"interactive\":[43,98],\"approach\":[44,82,99],\"to\":[45,59,86],\"collect\":[46],\"present\":[48,75],\"data.\":[50],\"An\":[51],\"initial\":[52,122],\"shallow\":[53],\"provides\":[55],\"immediate\":[57],\"access\":[58],\"visualizations\":[60],\"information.\":[63],\"As\":[64],\"users\":[65],\"explore\":[66,88],\"this\":[67],\"information,\":[68],\"it\":[69],\"incrementally\":[71],\"refined\":[72],\"on-demand.\":[73],\"implementation\":[77],\"realizes\":[79],\"our\":[80,97],\"proposed\":[81],\"enables\":[84],\"developers\":[85],\"instantly\":[87],\"behavior\":[90],\"selected\":[92],\"code\":[93],\"entities.\":[94],\"evaluate\":[96],\"by\":[100],\"measuring\":[101],\"time\":[102],\"memory\":[104],\"in\":[106,127],\"context\":[108],\"ten\":[110],\"different-sized\":[111],\"projects.\":[112],\"Our\":[113],\"empirical\":[114],\"results\":[115],\"show\":[116],\"overview\":[123],\"can\":[124],\"be\":[125],\"collected\":[126],\"less\":[128],\"than\":[129],\"300\":[130],\"milliseconds\":[131],\"95%\":[133],\"cases.\":[135]}},\"S\":[{\"Ty\":3,\"U\":\"http://www.hirschfeld.org/writings/media/PerscheidSteinertHirschfeldGellerHaupt_2010_ImxmediacyThroughInteractivityOnlineAnalysisOfRunTimeBehavior_IEEE.pdf\"},{\"Ty\":1,\"U\":\"http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005645442\"},{\"Ty\":1,\"U\":\"http://ieeexplore.ieee.org/document/5645442/\"},{\"Ty\":1,\"U\":\"http://dblp.uni-trier.de/db/conf/wcre/wcre2010.html#PerscheidSHGH10\"}],\"VFN\":\"Working Conference on Reverse Engineering\",\"VSN\":\"WCRE\",\"FP\":77,\"LP\":86,\"DOI\":\"10.1109/WCRE.2010.17\",\"CC\":{\"152925115\":[\"Pathfinder leverages test cases as entry points, an approach that we presented in previous work [7].\",\"Pathfinder applies an approach introduced in [7]: Leveraging test cases as sensible entry points.\"],\"1507612039\":[\"Several techniques to reduce the costs have been reported [21], [22], in return for a more complicated setup.\"],\"1513058800\":[\"de/swa/projects/pathfinder/ during development as tests are selectively executed [8].\"],\"1531869376\":[\"Alternatively, dynamic AOP implementations like CaesarJ [12] could be used, as they allow for dynamically reconfiguring a software system.\"],\"1541128807\":[\"For our implementation, we leverage test cases as such entry points, as they commonly satisfy this requirement [6].\"],\"1574879889\":[\"The execution pattern view [25] automatically classifies repetitive behavior into high order execution patterns.\"],\"1638356594\":[\"There are plenty approaches to software visualization that present behavior using call graphs [23].\"],\"1649645444\":[\"The application is based on the description of the Observer design pattern [4].\",\"For instance, the authors of the Gang of Four book on design patterns [4] aid comprehension of their examples by presenting sequence diagrams alongside class diagrams to visualize collaborations among objects.\"],\"2001033929\":[\"Developers of object-oriented software systems spend a significant amount of time on program comprehension [1]– [3].\"],\"2002985857\":[\"Several techniques to reduce the costs have been reported [21], [22], in return for a more complicated setup.\"],\"2006684428\":[\"The feature driven browser in [15] and Senseo [16] are both extensions to an IDE that provide additional support by collecting run-time information.\"],\"2079194250\":[\"The call graph analyzer [27] visualizes call graphs in a 2.\"],\"2097750323\":[\"[13] focused on source code related questions that arise during maintenance.\"],\"2100894766\":[\"Developers of object-oriented software systems spend a significant amount of time on program comprehension [1]– [3].\"],\"2123344540\":[\"The feature driven browser in [15] and Senseo [16] are both extensions to an IDE that provide additional support by collecting run-time information.\",\"The IDE extension Senseo [16] supports the navigation in source code artifacts.\"],\"2131664240\":[\"Visualized run-time information has to be available within some hundreds of milliseconds rather than minutes [5].\",\"Schneiderman [5] argues that two seconds is the upper limit for responding to a user request.\"],\"2132383311\":[\"[14] presented three studies concerning reachability questions, which are described as a “search across feasible paths through a program for target statements matching search criteria”.\"],\"2148357053\":[\"They support reasoning about the behavior of programs in general, which might be the reason why developers use debuggers to improve their understanding of source code [18].\"],\"2155848253\":[\"The selection of relevant packages and exclusion of others avoids unnecessary overhead [10].\"],\"2161922591\":[\"Although all approaches are useful in their specific scenario, no approach can be generalized for various tasks in program comprehension [29].\"],\"2162831261\":[\"Circular Bundle Views [28] deal with the fact that sequence diagrams do not scale and present a scalable view inside a circle.\"],\"2164372721\":[\"Back-in-time debuggers [19] enable developers to navigate an entire program execution and help to answer questions about the cause of a particular state [20].\"],\"2170311191\":[\"Most such visualizations are rarely used during software development [30].\"],\"2480195817\":[\"instance, it would be possible to use aspect-oriented programming (AOP) in the form of the AspectJ [11] programming language to instrument all methods with analysis logic.\"],\"2782959840\":[\"Pathfinder analyzes the execution of entry points by instrumenting the code using method wrappers [9].\"],\"2803343605\":[\"The former helps developers to locate and highlight source code that contributes to features of interest [17].\"]},\"PR\":[2782959840,2014309790,2162045655,2320203379,2188913686,2612886667,568818983,2095979053,34591081,2774500616,21053263,2007964947,2505950341,581551710,1499501833,2566236641,2786272074,2019158077,2901813316,2014680113,2782959840,2014309790,2162045655,2320203379,2188913686,2612886667,568818983,2095979053,34591081,2774500616,21053263,2007964947,2505950341,581551710,1499501833,2566236641,2786272074,2019158077,2901813316,2014680113],\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":1},{\"FN\":\"Bastian\",\"LN\":\"Steinert\",\"S\":2},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":3},{\"FN\":\"Felix\",\"LN\":\"Geller\",\"S\":4},{\"FN\":\"Michael\",\"LN\":\"Haupt\",\"S\":5}],\"BV\":\"2010 17th Working Conference on Reverse Engineering\",\"BT\":\"p\",\"PB\":\"IEEE\"}"},{"logprob":-21.533,"Id":2065296680,"Ty":"0","Ti":"test quality feedback improving effectivity and efficiency of unit testing","Pt":"3","L":"en@@@fr","Y":2012,"D":"2012-01-01","CC":7,"ECC":7,"RId":[1493688518,2014309790,2079317829,2146872957,2162045655,2170606151,1735790193,2052606569,2151099659,2070321219,2782959840,2116771900,2165723276,2132627437,2137440139,2155848253,2157659145,2096508355,2088772524,2143661621,1972151373,2148322842,1513058800,2066031375],"W":["effectivity","efficiency","feedback","improving","quality","test","testing","unit"],"AA":[{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":1},{"DAuN":"Damien Cassou","AuN":"damien cassou","AuId":1514817921,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":2},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":3}],"F":[{"DFN":"Test suite","FN":"test suite","FId":151552104},{"DFN":"Test harness","FN":"test harness","FId":109852812},{"DFN":"Test case","FN":"test case","FId":128942645},{"DFN":"Test Management Approach","FN":"test management approach","FId":7435765},{"DFN":"System under test","FN":"system under test","FId":108913964},{"DFN":"System integration testing","FN":"system integration testing","FId":111524372},{"DFN":"Regression testing","FN":"regression testing","FId":161821725},{"DFN":"Real-time computing","FN":"real time computing","FId":79403827},{"DFN":"Dynamic testing","FN":"dynamic testing","FId":198824145},{"DFN":"Computer science","FN":"computer science","FId":41008148}],"C":{"CN":"c5","CId":1201766282},"CI":{"CIN":"c5 2012","CIId":98471374},"E":"{\"DN\":\"Test Quality Feedback Improving Effectivity and Efficiency of Unit Testing\",\"IA\":{\"IndexLength\":181,\"InvertedIndex\":{\"Writing\":[0],\"unit\":[1],\"tests\":[2,34,45,121],\"for\":[3,65],\"a\":[4,11,21,76,85,89,94,96,130],\"software\":[5,86,97,179],\"system\":[6,12,36,87,98],\"enhances\":[7],\"the\":[8,35,47,53,164,174],\"confidence\":[9],\"that\":[10,79,132],\"works\":[13],\"as\":[14,158],\"expected.\":[15],\"Since\":[16],\"time\":[17,49,147],\"pressure\":[18],\"often\":[19],\"prevents\":[20],\"complete\":[22],\"testing\":[23],\"of\":[24,84,91,177],\"all\":[25,81],\"application\":[26],\"details\":[27],\"developers\":[28,104,117,128],\"need\":[29,40],\"to\":[30,41,74,115,138],\"know\":[31,42],\"which\":[32,43],\"new\":[33],\"requires.\":[37],\"Developers\":[38],\"also\":[39],\"existing\":[44],\"take\":[46],\"most\":[48],\"and\":[50,63,103,122,144,148,168],\"slow\":[51],\"down\":[52],\"whole\":[54],\"development\":[55],\"process.\":[56],\"Missing\":[57],\"feedback\":[58,114],\"about\":[59],\"less\":[60,107],\"tested\":[61,102],\"functionality\":[62],\"reasons\":[64],\"long\":[66],\"running\":[67],\"test\":[68,77,106,112,134,161,175],\"cases\":[69],\"make\":[70],\"it,\":[71],\"however,\":[72],\"harder\":[73],\"create\":[75],\"suite\":[78],\"covers\":[80],\"important\":[82],\"parts\":[83],\"in\":[88,118],\"minimum\":[90],\"time.\":[92],\"As\":[93],\"result\":[95],\"may\":[99,105],\"be\":[100],\"inadequately\":[101],\"frequently.\":[108],\"Our\":[109],\"approach\":[110],\"provides\":[111],\"quality\":[113,176],\"guide\":[116],\"identifying\":[119],\"missing\":[120,142],\"correcting\":[123],\"low-quality\":[124],\"tests.\":[125],\"We\":[126,151],\"provide\":[127],\"with\":[129,136],\"tool\":[131],\"analyzes\":[133],\"suites\":[135],\"respect\":[137],\"their\":[139],\"effectivity\":[140],\"(e.g.,\":[141,146],\"tests)\":[143],\"efficiency\":[145],\"memory\":[149],\"consumption).\":[150],\"implement\":[152],\"our\":[153],\"approach,\":[154],\"named\":[155],\"Path\":[156],\"Map,\":[157],\"an\":[159],\"extended\":[160],\"runner\":[162],\"within\":[163],\"Squeak\":[165],\"Smalltalk\":[166],\"IDE\":[167],\"demonstrate\":[169],\"its\":[170],\"benefits\":[171],\"by\":[172],\"improving\":[173],\"representative\":[178],\"systems.\":[180]}},\"S\":[{\"Ty\":3,\"U\":\"http://www.hirschfeld.org/writings/media/PerscheidCassouHirschfeld_2012_TestQualityFeedbackImprovingEffectivityAndEfficiencyOfUnitTesting_IEEE.pdf\"},{\"Ty\":3,\"U\":\"https://hal.inria.fr/hal-01118969/document\"},{\"Ty\":3,\"U\":\"http://www.michaelperscheid.de/publications/papers/PerscheidCassouHirschfeld_2012_TestQualityFeedbackImprovingEffectivityAndEfficiencyOfUnitTesting_IEEE.pdf\"},{\"Ty\":1,\"U\":\"http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000006195223\"},{\"Ty\":1,\"U\":\"http://ieeexplore.ieee.org/document/6195223/\"},{\"Ty\":1,\"U\":\"https://hal.inria.fr/hal-01118969\"},{\"Ty\":1,\"U\":\"https://www.computer.org/web/csdl/index/-/csdl/proceedings/c5/2012/4672/00/4672a060-abs.html\"},{\"Ty\":1,\"U\":\"https://dl.acm.org/citation.cfm?id=2223947.2223969\"}],\"VFN\":\"Conference on Creating, Connecting and Collaborating through Computing\",\"VSN\":\"C5\",\"FP\":60,\"LP\":67,\"DOI\":\"10.1109/C5.2012.7\",\"CC\":{\"1513058800\":[\"selective testing [23] which should result in an always up-to-\"],\"1735790193\":[\"In the course of time several other approaches have improved the standard layout algorithm: they prevent long rectangles that are difficult to see [20] or they highlight objects that are also neighbors in the hierarchical structure [21], [22].\"],\"1972151373\":[\"run-time behavior of the method and debug it [15].\"],\"2014309790\":[\"Automated unit tests allow developers to specify the proper state and interaction of objects and provide early identification of erroneous behavior [1].\",\"Although developers have used test-driven development [1] during the implementation of AweSOM, they ran into challenges regarding their test base.\"],\"2052606569\":[\"In the course of time several other approaches have improved the standard layout algorithm: they prevent long rectangles that are difficult to see [20] or they highlight objects that are also neighbors in the hierarchical structure [21], [22].\"],\"2066031375\":[\"Doing this coverage ondemand is necessary as a complete statement-level coverage analysis of the whole system would slow down the execution by a factor of 100 [13].\"],\"2070321219\":[\"Our approach can additionally determine an expert by analyzing who last changed the method, who wrote the initial implementation, and who changes the method the most frequently [12].\"],\"2079317829\":[\"We argue that the required testing effort depends on individual skills and knowledge about the system under observation: Similarly to the debugging activity [11] more experienced developers invent better hypotheses than novices.\"],\"2088772524\":[\"AweSOM is an implementation of a SOM (Simple Object Machine) virtual machine in Squeak/Smalltalk [7].\"],\"2096508355\":[\"Commonly, well tested applications own only a coverage rate around 70-80% [4] and increasing\",\"Numerous studies [6], [8], [4] report similar observations during software testing.\"],\"2116771900\":[\"this coverage requires much more development effort [5].\"],\"2132627437\":[\"Numerous studies [6], [8], [4] report similar observations during software testing.\",\"suggest elementary guidelines [8].\"],\"2137440139\":[\"For these tests to be effective in identifying erroneous behavior it is necessary that test cases cover as much as possible of the system code [2].\"],\"2143661621\":[\"TestQ is a tool capable of statically analysing test code [18].\"],\"2146872957\":[\"of a compact and scalable tree map [10].\",\"The visualization of our approach is based on tree maps [10] that visualize arbitrary hierarchical structures by subdividing a given area into small rectangles.\"],\"2148322842\":[\"Hapao is a test coverage tool which uses a graphical visualization to facilitate the discovery of not (completely) tested code [17].\"],\"2151099659\":[\"Moreover, collecting run-time information at statement or branch level comes along with a perceivable performance decrease [6].\",\"Numerous studies [6], [8], [4] report similar observations during software testing.\",\"On the other hand developers complain that they do not know how much code is covered and how well the tested code is [6].\",\"surveyed numerous of them [6].\"],\"2155848253\":[\"While the dynamic analysis for method coverage can be implemented with aspect-oriented programming [16], statement-level coverage depends on the language features.\"],\"2157659145\":[\"the reliability of systems [9].\"],\"2162045655\":[\"[19] proposed a seminal work that aims at finding faults within a software system by comparing unit test results.\"],\"2170606151\":[\"In the course of time several other approaches have improved the standard layout algorithm: they prevent long rectangles that are difficult to see [20] or they highlight objects that are also neighbors in the hierarchical structure [21], [22].\"],\"2782959840\":[\"At the level of methods, we collect run-time information with flexible method wrappers [14]: a wrapper introduces new behavior before and after the execution of a specific method without changing its behavior.\"]},\"PR\":[1815064695,2170918895,2017081575,2127301602,2164315119,2108404340,2052434171,2083736053,2112925845,2106537125,1980768554,2037313217,1967634894,2592403054,2154959594,2403030675,2042044301,2369179610,2368685779,2181413133,1815064695,2170918895,2017081575,2127301602,2164315119,2108404340,2052434171,2083736053,2112925845,2106537125,1980768554,2037313217,1967634894,2592403054,2154959594,2403030675,2042044301,2369179610,2368685779,2181413133],\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":1},{\"FN\":\"Damien\",\"LN\":\"Cassou\",\"S\":2},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":3}],\"BV\":\"2012 10th International Conference on Creating, Connecting and Collaborating through Computing\",\"BT\":\"p\",\"PB\":\"IEEE\"}"},{"logprob":-21.547,"Id":2066031375,"Ty":"0","Ti":"type harvesting a practical approach to obtaining typing information in dynamic programming languages","Pt":"3","L":"en","Y":2011,"D":"2011-03-21","CC":8,"ECC":8,"RId":[1770006921,2148357053,2172147300,1574060188,2135536553,2058213389,2093334386,2122592814,2031627901,2165046128,2170311191,2149539713,2048486205,2120363698,2133468633,1577728776,2053664570,2088772524,2138732532,1513058800,2091556182,1580606833],"W":["approach","dynamic","harvesting","information","languages","obtaining","practical","programming","type","typing"],"AA":[{"DAuN":"Michael Haupt","AuN":"michael haupt","AuId":2146662369,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":1},{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":2},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":3}],"F":[{"DFN":"Uniqueness type","FN":"uniqueness type","FId":21103074},{"DFN":"Type system","FN":"type system","FId":20740285},{"DFN":"Type erasure","FN":"type erasure","FId":48522483},{"DFN":"Type conversion","FN":"type conversion","FId":83137451},{"DFN":"Theoretical computer science","FN":"theoretical computer science","FId":80444323},{"DFN":"Second-generation programming language","FN":"second generation programming language","FId":11164408},{"DFN":"Duck typing","FN":"duck typing","FId":22811154},{"DFN":"Data type","FN":"data type","FId":138958017},{"DFN":"Computer science","FN":"computer science","FId":41008148},{"DFN":"Complex data type","FN":"complex data type","FId":35288925}],"C":{"CN":"sac","CId":2754781246},"CI":{"CIN":"sac 2011","CIId":162684108},"E":"{\"DN\":\"Type harvesting: a practical approach to obtaining typing information in dynamic programming languages\",\"IA\":{\"IndexLength\":134,\"InvertedIndex\":{\"Dynamically\":[0],\"typed\":[1],\"programming\":[2],\"languages\":[3,39],\"are\":[4,13],\"powerful\":[5],\"tools\":[6],\"for\":[7,98,107],\"rapid\":[8],\"software\":[9],\"development.\":[10],\"However,\":[11],\"there\":[12],\"scenarios\":[14],\"that\":[15,125],\"would\":[16],\"benefit\":[17],\"from\":[18],\"actual\":[19],\"type\":[20,49,65,73,105,126],\"information\":[21,106],\"being\":[22],\"available---e.\":[23],\"g.,\":[24],\"code\":[25,35,80,84,109],\"generation\":[26],\"and\":[27],\"optimisation\":[28],\"as\":[29,31],\"well\":[30,54],\"program\":[32],\"comprehension.\":[33],\"Since\":[34],\"written\":[36],\"in\":[37,85,93,116],\"such\":[38],\"usually\":[40],\"makes\":[41],\"little\":[42],\"or\":[43],\"no\":[44],\"explicit\":[45],\"assumptions\":[46],\"about\":[47],\"types,\":[48],\"inference\":[50],\"is\":[51,76],\"not\":[52],\"particularly\":[53],\"suited\":[55],\"to\":[56,71,102],\"obtain\":[57,104],\"the\":[58,83,89],\"desired\":[59],\"information.\":[60,74],\"This\":[61],\"paper\":[62],\"introduces\":[63],\"harvesting\":[66,96,127],\",\":[67],\"a\":[68,108],\"practical\":[69],\"approach\":[70,112],\"obtaining\":[72],\"It\":[75],\"based\":[77],\"on\":[78],\"stepwise\":[79],\"execution\":[81],\"of\":[82,91],\"question,\":[86],\"closely\":[87],\"observing\":[88],\"types\":[90],\"entities\":[92],\"question.\":[94],\"Type\":[95],\"allows\":[97],\"exploiting\":[99],\"unit\":[100],\"tests\":[101],\"automatically\":[103],\"base.\":[110],\"The\":[111],\"has\":[113],\"been\":[114],\"implemented\":[115],\"Squeak/Smalltalk.\":[117],\"Its\":[118],\"evaluation,\":[119],\"using\":[120],\"several\":[121],\"complex\":[122],\"applications,\":[123],\"shows\":[124],\"yields\":[128],\"excellent\":[129],\"results\":[130],\"with\":[131],\"high\":[132],\"precision.\":[133]}},\"S\":[{\"Ty\":3,\"U\":\"http://www.hirschfeld.org/writings/media/HauptPerscheidHirschfeld_2011_TypeHarvestingAPracticalApproachToObtainingTypingInformationInDynamicProgrammingLanguages_AcmDL.pdf\"},{\"Ty\":1,\"U\":\"https://dl.acm.org/citation.cfm?id=1982464\"},{\"Ty\":1,\"U\":\"http://dblp.uni-trier.de/db/conf/sac/sac2011.html#HauptPH11\"},{\"Ty\":1,\"U\":\"https://doi.acm.org/10.1145/1982185.1982464\"},{\"Ty\":0,\"U\":\"http://doi.acm.org/10.1145/1982185.1982464\"}],\"VFN\":\"ACM Symposium on Applied Computing\",\"VSN\":\"SAC\",\"FP\":1282,\"LP\":1289,\"DOI\":\"10.1145/1982185.1982464\",\"CC\":{\"1513058800\":[\"In fact, there exist approaches that adopt incremental execution of relevant tests as those parts of an application covered by them are changed [19, 21].\"],\"1574060188\":[\"Finally, dynamic analysis tools can verify deduced type information to identify failure causes [24].\"],\"1577728776\":[\"There exist inference engines [4, 2, 1, 20, 16, 6] that are however necessarily incomplete.\",\"More recent approaches [4, 2, 1, 20, 16, 6] mostly focus on obtaining type information for interfaces (i.\",\"Moreover, their precision is sometimes lower [20, 16].\"],\"1580606833\":[\"Other projects have pursued similar goals without necessarily aiming for systems software [13, 15, 2], mostly applying source-to-source translation and type inference.\"],\"1770006921\":[\"Second, we present an implementation of type harvesting in Squeak [12], an implementation of Smalltalk [7].\"],\"2031627901\":[\"In fact, there exist approaches that adopt incremental execution of relevant tests as those parts of an application covered by them are changed [19, 21].\"],\"2048486205\":[\"There also exist lightweight approaches like pluggable types [3, 8], where developers can annotate methods with type information.\",\"Apart from these two, pluggable types [3, 8] are worth mentioning, but since they require developers to provide type information, we do not discuss them here.\"],\"2053664570\":[\"Type inference for dynamically typed programming languages has been researched early on [22].\"],\"2088772524\":[\"One of the four projects, AweSOM [9], is a research project, namely a virtual machine for a Smalltalk dialect (SOM Smalltalk) written in Squeak.\"],\"2093334386\":[\"Type feedback [11] is a VM technique that drives just-in-time compiler optimisation decisions based on dynamically collected type information.\"],\"2120363698\":[\"There exist inference engines [4, 2, 1, 20, 16, 6] that are however necessarily incomplete.\",\"Other projects have pursued similar goals without necessarily aiming for systems software [13, 15, 2], mostly applying source-to-source translation and type inference.\",\"More recent approaches [4, 2, 1, 20, 16, 6] mostly focus on obtaining type information for interfaces (i.\"],\"2122592814\":[\"Type inference for the Ruby programming language [6] has been augmented by profile-guided typing [5].\"],\"2133468633\":[\"Additional type information reduces the set of call graph branches to the possibilities actually assigned in a specific context [10].\"],\"2135536553\":[\"There exist inference engines [4, 2, 1, 20, 16, 6] that are however necessarily incomplete.\",\"More recent approaches [4, 2, 1, 20, 16, 6] mostly focus on obtaining type information for interfaces (i.\",\"Type inference for the Ruby programming language [6] has been augmented by profile-guided typing [5].\"],\"2138732532\":[\"There exist inference engines [4, 2, 1, 20, 16, 6] that are however necessarily incomplete.\",\"More recent approaches [4, 2, 1, 20, 16, 6] mostly focus on obtaining type information for interfaces (i.\"],\"2148357053\":[\"Developers maintain a mental model of program behaviour [14] by navigating the static call graph for a specific method of interest and following several paths comprised of sender and implementor relationships.\"],\"2149539713\":[\"There exist inference engines [4, 2, 1, 20, 16, 6] that are however necessarily incomplete.\",\"More recent approaches [4, 2, 1, 20, 16, 6] mostly focus on obtaining type information for interfaces (i.\",\"Moreover, their precision is sometimes lower [20, 16].\"],\"2165046128\":[\"There exist inference engines [4, 2, 1, 20, 16, 6] that are however necessarily incomplete.\",\"More recent approaches [4, 2, 1, 20, 16, 6] mostly focus on obtaining type information for interfaces (i.\"],\"2170311191\":[\"The Hermion [18] IDE extension for Squeak is designed for providing developers with additional run-time information during static source code navigation.\"],\"2172147300\":[\"Second, we present an implementation of type harvesting in Squeak [12], an implementation of Smalltalk [7].\"]},\"PR\":[1507181701,2305374267,2189052291,2089214613,2896137925,16483339,1581126267,208806687,1017474348,1578444545,2307785417,2085983541,202833674,2468602413,1606191713,2181924625,2889858359,1964178963,2794515005,812190219,1507181701,2305374267,2189052291,2089214613,2896137925,16483339,1581126267,208806687,1017474348,1578444545,2307785417,2085983541,202833674,2468602413,1606191713,2181924625,2889858359,1964178963,2794515005,812190219],\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Haupt\",\"S\":1},{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":2},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":3}],\"BV\":\"Proceedings of the 2011 ACM Symposium on Applied Computing\",\"BT\":\"p\",\"PB\":\"ACM\"}"},{"logprob":-21.586,"Id":169400382,"Ty":"0","Ti":"an introduction to seaside","Pt":"0","Y":2008,"D":"2008-01-01","CC":6,"ECC":6,"W":["introduction","seaside"],"AA":[{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"S":1},{"DAuN":"David Tibbe","AuN":"david tibbe","AuId":273462452,"S":2},{"DAuN":"Martin Beck","AuN":"martin beck","AuId":2309158709,"S":3},{"DAuN":"Stefan Berger","AuN":"stefan berger","AuId":2423549385,"S":4},{"DAuN":"Peter Osburg","AuN":"peter osburg","AuId":319726736,"S":5},{"DAuN":"Jeffrey Eastman","AuN":"jeffrey eastman","AuId":2634384335,"S":6},{"DAuN":"Michael Haupt","AuN":"michael haupt","AuId":2146662369,"S":7},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"S":8}],"F":[{"DFN":"World Wide Web","FN":"world wide web","FId":136764020},{"DFN":"Web development","FN":"web development","FId":79373723},{"DFN":"Smalltalk","FN":"smalltalk","FId":2777293101},{"DFN":"Programming language","FN":"programming language","FId":199360897},{"DFN":"Object-oriented programming","FN":"object oriented programming","FId":73752529},{"DFN":"Hypertext Transfer Protocol","FN":"hypertext transfer protocol","FId":149672775},{"DFN":"Computer science","FN":"computer science","FId":41008148}],"E":"{\"DN\":\"An Introduction to Seaside\",\"VFN\":\"\",\"PR\":[1262379696,595349243,250233161,2148017497,54612561,2396478891,1529323326,1561576970,2083505347,2058676784,12892605,22246355,2050214566,2009179144,28466665,2521782464,2158490149,1550042973,2204512861,63082649,1262379696,595349243,250233161,2148017497,54612561,2396478891,1529323326,1561576970,2083505347,2058676784,12892605,22246355,2050214566,2009179144,28466665,2521782464,2158490149,1550042973,2204512861,63082649],\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":1},{\"FN\":\"David\",\"LN\":\"Tibbe\",\"S\":2},{\"FN\":\"Martin\",\"LN\":\"Beck\",\"S\":3},{\"FN\":\"Stefan\",\"LN\":\"Berger\",\"S\":4},{\"FN\":\"Peter\",\"LN\":\"Osburg\",\"S\":5},{\"FN\":\"Jeffrey\",\"LN\":\"Eastman\",\"S\":6},{\"FN\":\"Michael\",\"LN\":\"Haupt\",\"S\":7},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":8}],\"BT\":\"a\"}"},{"logprob":-21.629,"Id":2111708921,"Ty":"0","Ti":"follow the path debugging state anomalies along execution histories","Pt":"3","L":"en","Y":2014,"D":"2014-02-01","CC":4,"ECC":4,"RId":[2110908283,2162376048,2116409384,2162045655,2172147300,2099866050,2164372721,1574060188,2165663378,1983119041,1673079227,2002985857,2133099573,2114178685,2782959840,1507612039,175708229,1986331539,2125825154,2092239677,2092221178,1482473201,1981537308,1774013863,2002568360,1972151373,2798692074,2065296680,2066031375,169400382,2105263737],"W":["anomalies","debugging","execution","follow","histories","path","state"],"AA":[{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":1},{"DAuN":"Tim Felgentreff","AuN":"tim felgentreff","AuId":1964871710,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":2},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":3}],"F":[{"DFN":"Thread (computing)","FN":"thread","FId":138101251},{"DFN":"Test case","FN":"test case","FId":128942645},{"DFN":"Root cause","FN":"root cause","FId":84945661},{"DFN":"Real-time computing","FN":"real time computing","FId":79403827},{"DFN":"Property (programming)","FN":"property","FId":87551280},{"DFN":"Observable","FN":"observable","FId":32848918},{"DFN":"Failure causes","FN":"failure causes","FId":28944875},{"DFN":"Debugging","FN":"debugging","FId":168065819},{"DFN":"Computer science","FN":"computer science","FId":41008148}],"C":{"CN":"csmr","CId":1145597874},"E":"{\"DN\":\"Follow the path: Debugging state anomalies along execution histories\",\"IA\":{\"IndexLength\":218,\"InvertedIndex\":{\"To\":[0,176],\"understand\":[1],\"how\":[2],\"observable\":[3,155],\"failures\":[4,76],\"come\":[5],\"into\":[6],\"being,\":[7],\"back-in-time\":[8,55],\"debuggers\":[9],\"help\":[10],\"developers\":[11,36,135,183,203],\"by\":[12],\"providing\":[13],\"full\":[14],\"access\":[15],\"to\":[16,30,39,78,130,150,201,205],\"past\":[17,132],\"executions.\":[18],\"However,\":[19],\"such\":[20],\"potentially\":[21],\"large\":[22,142],\"execution\":[23,99],\"histories\":[24],\"do\":[25],\"not\":[26],\"include\":[27],\"any\":[28],\"hints\":[29],\"failure\":[31,66],\"causes.\":[32,81],\"For\":[33],\"that\":[34,68,93,195],\"reason,\":[35],\"are\":[37],\"forced\":[38],\"ascertain\":[40],\"unexpected\":[41,95],\"state\":[42,87,96,128,162,197],\"properties\":[43,97,105],\"and\":[44,61,124,171,204],\"wrong\":[45],\"behavior\":[46,109],\"completely\":[47,160],\"on\":[48],\"their\":[49,79],\"own.\":[50],\"Without\":[51],\"deep\":[52],\"program\":[53],\"understanding,\":[54],\"debugging\":[56,91,185],\"can\":[57],\"end\":[58],\"in\":[59],\"countless\":[60],\"difficult\":[62],\"questions\":[63],\"about\":[64],\"possible\":[65],\"causes\":[67,153],\"consume\":[69],\"a\":[70,90,137,190,216],\"lot\":[71],\"of\":[72,110,144,166,215],\"time\":[73,209],\"for\":[74,210],\"following\":[75],\"back\":[77],\"root\":[80,213],\"In\":[82],\"this\":[83],\"paper,\":[84],\"we\":[85,114,180,192],\"present\":[86],\"navigation\":[88,163,170,198],\"as\":[89,127,164],\"guide\":[92],\"highlights\":[94],\"along\":[98],\"histories.\":[100],\"After\":[101],\"deriving\":[102],\"common\":[103,138],\"object\":[104],\"from\":[106],\"the\":[107,121,131,141,154,207,212],\"expected\":[108],\"passing\":[111],\"test\":[112],\"cases,\":[113],\"generate\":[115],\"likely\":[116],\"invariants,\":[117],\"compare\":[118],\"them\":[119,149],\"with\":[120],\"failing\":[122],\"run,\":[123],\"map\":[125],\"differences\":[126],\"anomalies\":[129],\"execution.\":[133],\"So,\":[134],\"obtain\":[136],\"thread\":[139],\"through\":[140],\"amount\":[143],\"run-time\":[145],\"data\":[146],\"which\":[147],\"helps\":[148],\"answer\":[151],\"what\":[152],\"failure.\":[156,217],\"We\":[157],\"implement\":[158],\"our\":[159,167,178,196],\"automatic\":[161],\"part\":[165],\"test-driven\":[168],\"fault\":[169],\"its\":[172],\"Path\":[173],\"tools\":[174],\"framework.\":[175],\"evaluate\":[177],\"approach,\":[179],\"observe\":[181],\"eight\":[182],\"during\":[184],\"four\":[186],\"non-trivial\":[187],\"failures.\":[188],\"As\":[189],\"result,\":[191],\"find\":[193],\"out\":[194],\"is\":[199],\"able\":[200],\"aid\":[202],\"decrease\":[206],\"required\":[208],\"localizing\":[211],\"cause\":[214]}},\"S\":[{\"Ty\":3,\"U\":\"http://www.hirschfeld.org/writings/media/PerscheidFelgentreffHirschfeld_2014_FollowThePathDebuggingStateAnomaliesAlongExecutionHistories_IEEE.pdf\"},{\"Ty\":1,\"U\":\"http://ieeexplore.ieee.org/document/6747162/\"},{\"Ty\":1,\"U\":\"http://dblp.uni-trier.de/db/conf/csmr/csmr2014.html#PerscheidFH14\"}],\"VFN\":\"Conference on Software Maintenance and Reengineering\",\"VSN\":\"CSMR\",\"FP\":124,\"LP\":133,\"DOI\":\"10.1109/CSMR-WCRE.2014.6747162\",\"CC\":{\"169400382\":[\"We have inserted a defect into the Seaside Web framework [8] and its request/response processing logic (BufferedResponse class, writeHeadersOn: method).\"],\"175708229\":[\"Later, a novel indexing and querying technique [24] ensures scalability to arbitrarily large execution traces and offers an interactive debugging experience.\"],\"1482473201\":[\"Unstuck [21] is the first back-in-time debugger for Smalltalk but suffers from similar performance problems.\"],\"1507612039\":[\"Object flow analysis [25] provides a practical back-in-time debugger that leverages the virtual machine and its garbage collector to remove no longer reachable objects and to discard corresponding events.\"],\"1574060188\":[\"Debugging is largely an attempt to understand what causes failures [1].\",\"They understand failure causes step by step, make fewer and simpler decisions about how to follow execution histories, and focus their attention on finding defects [1].\",\"Especially, the missing classification of suspicious and harmless program entities leads to numerous and often laborious decisions which execution subtree to follow [1].\",\"Such state differences have a high probability to include failure causes so that developers can rely on this information for creating their hypotheses [1].\"],\"1774013863\":[\"With a mapping on execution histories of our previous back-in-time debugger [5], [6], anomalies reveal infection chains and guide developers to root causes.\",\"Our test-driven fault navigation [5] is a debugging guide that integrates spectrum-based anomaly detection [10], [12] into a systematic breadth-first search for tracing failure causes back to defects.\",\"3 summarizes the call tree of our back-in-time debugger [5], [6] with our state navigation extension.\",\"We implement our state navigation as part of our test-driven fault navigation and its corresponding Path tools framework [5] for the Squeak/Smalltalk development environment [7].\",\"We base this study on our previous user study [5] in order to assess the positive influence of our state navigation.\",\"During the study, our participants are supposed to localize four failures which we have already applied in our previous study5 [5].\",\"So far, this tool already supports the classification of suspicious method calls with spectrum-based anomalies [5].\"],\"1972151373\":[\"With a mapping on execution histories of our previous back-in-time debugger [5], [6], anomalies reveal infection chains and guide developers to root causes.\",\"By integrating these spectrum-based anomalies into our back-in-time debugger [6], we highlight suspicious method calls and allow developers to distinguish between suspicious and expected run-time behavior.\",\"3 summarizes the call tree of our back-in-time debugger [5], [6] with our state navigation extension.\",\"The tool suite consists of our enhanced test runner PathMap [18] and our lightweight back-in-time debugger PathFinder [6].\",\"Compared to these tools, our PathFinder is a lightweight and specialized back-in-time debugger for localizing failure causes in failing test cases [6].\"],\"1981537308\":[\"Second, our anomalies shall be refined with interactive developer feedback [31] in such a way that identified false positives strengthen the remaining failure cause probabilities.\"],\"1983119041\":[\"Later, an extension to Daikon [26] solves this problem by optimizing polymorphism and filtering unchanged values.\"],\"1986331539\":[\"Screeners [28] further optimize the run-time overhead and decrease it to only 14 %.\"],\"2002568360\":[\"With likely invariants, our state navigation generates dynamic contracts [14] that automatically detect corrupted state in failing test cases.\"],\"2002985857\":[\"The trace-oriented debugger (TOD) [23] combines an efficient instrumentation for capturing exhaustive traces and a specialized distributed database.\"],\"2065296680\":[\"The tool suite consists of our enhanced test runner PathMap [18] and our lightweight back-in-time debugger PathFinder [6].\"],\"2066031375\":[\"Our type harvester gathers detailed type information of executed program entities [16]2.\"],\"2092221178\":[\"Compared to Daikon [11] that provides a considerable amount of more likely invariants, it has been shown that too many invariants can limit their intent for debugging [13], [17].\",\"A current study reports that automatically generated program invariants by Daikon [11] are sometimes hard to understand and tend to produce false positives [17].\",\"Finally, comparative studies [17], [30] of programmer-written and likely invariants conclude that a combination of both methods is most promising.\"],\"2092239677\":[\"Unfortunately, this idealized procedure requires deep knowledge of the system and its behavior [2].\"],\"2099866050\":[\"ClearView [29] also monitors invariants on the fly but it applies them to automatically patch upcoming failures.\"],\"2105263737\":[\"For a detailed description of our tools and how to debug with them, we refer to [19].\"],\"2110908283\":[\"3) Anomalies: What Are Possible Failure Causes?: Anomalies such as from program spectra [10] or likely invariants [11] automatically identify possible failure causes by deriving runtime properties from reference runs and comparing them with failing executions.\",\"ing dynamic analysis of likely invariants tends to be timeconsuming because each object has to be explored at each execution point in full detail [11].\",\"Compared to Daikon [11] that provides a considerable amount of more likely invariants, it has been shown that too many invariants can limit their intent for debugging [13], [17].\",\"A current study reports that automatically generated program invariants by Daikon [11] are sometimes hard to understand and tend to produce false positives [17].\",\"Daikon [11] comprises a set of automatic techniques for inferring generalized program state from execution traces.\"],\"2114178685\":[\"Finally, comparative studies [17], [30] of programmer-written and likely invariants conclude that a combination of both methods is most promising.\"],\"2116409384\":[\"Diduce [27] extends Daikon’s approach and derives invariants on the fly.\"],\"2162045655\":[\"Differences have a high probability of including failure causes [12] and so help developers to narrow down the search space by answering which program entities are potentially infected.\",\"Our test-driven fault navigation [5] is a debugging guide that integrates spectrum-based anomaly detection [10], [12] into a systematic breadth-first search for tracing failure causes back to defects.\"],\"2162376048\":[\"Since failures and defects can be far apart from each other, their unknown infection chains are consequently long and demand a laborious effort for debugging [3].\",\"However, starting debugging at failures still includes a long way back to their root causes [3].\"],\"2164372721\":[\"WhyLine [22] allows developers to ask a set of “why did” and “why didn’t” questions such as why a line of code was not reached.\",\"First, our approach will be extended with why-questions [22] to even better guide developers through execution histories.\"],\"2172147300\":[\"• The Path tools framework implements our completely automatic approach as part of our test-driven fault navigation in Squeak/Smalltalk [7].\",\"We implement our state navigation as part of our test-driven fault navigation and its corresponding Path tools framework [5] for the Squeak/Smalltalk development environment [7].\"],\"2782959840\":[\"Based on the coverage of our failing tests, we instrument each of the included classes and their methods with harvester wrappers to transparently add analysis code around the original implementation [15].\"],\"2798692074\":[\"For example, typos are common and often difficult to localize [20].\"]},\"PR\":[1774013863,2775592182,2001919024,2121847279,2164649341,1529569394,2617064411,2062154010,1605507930,2807730630,2165811181,2004141756,2099526117,2116409384,2082732081,2807463475,2118315969,1984571869,1484132159,2070544288,1774013863,2775592182,2001919024,2121847279,2164649341,1529569394,2617064411,2062154010,1605507930,2807730630,2165811181,2004141756,2099526117,2116409384,2082732081,2807463475,2118315969,1984571869,1484132159,2070544288],\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":1},{\"FN\":\"Tim\",\"LN\":\"Felgentreff\",\"S\":2},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":3}],\"BV\":\"2014 Software Evolution Week - IEEE Conference on Software Maintenance, Reengineering, and Reverse Engineering (CSMR-WCRE)\",\"BT\":\"p\",\"PB\":\"IEEE\"}"},{"logprob":-21.888,"Id":1969234243,"Ty":"0","Ti":"phidgetlab crossing the border from virtual to real world objects","Pt":"3","L":"en","Y":2010,"D":"2010-06-26","CC":3,"ECC":3,"RId":[1770006921,1529323856,2133368199,2119673170,2114657742,1563045389,2172147300,220870191,9402527,2125813862],"W":["border","crossing","objects","phidgetlab","real","virtual","world"],"AA":[{"DAuN":"Michael Haupt","AuN":"michael haupt","AuId":2146662369,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":1},{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":2},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":3},{"DAuN":"Lysann Kessler","AuN":"lysann kessler","AuId":2123091698,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":4},{"DAuN":"Thomas Klingbeil","AuN":"thomas klingbeil","AuId":212836417,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":5},{"DAuN":"Stephanie Platz","AuN":"stephanie platz","AuId":2119395961,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":6},{"DAuN":"Frank Schlegel","AuN":"frank schlegel","AuId":2132997099,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":7},{"DAuN":"Philipp Tessenow","AuN":"philipp tessenow","AuId":228457620,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":8}],"F":[{"DFN":"Visual programming language","FN":"visual programming language","FId":128644962},{"DFN":"Squeak","FN":"squeak","FId":2780281086},{"DFN":"Simulation","FN":"simulation","FId":44154836},{"DFN":"Sight","FN":"sight","FId":1517167},{"DFN":"Realisation","FN":"realisation","FId":2779462738},{"DFN":"Multimedia","FN":"multimedia","FId":49774154},{"DFN":"Etoys","FN":"etoys","FId":2776396814},{"DFN":"Electronic component","FN":"electronic component","FId":81060104},{"DFN":"Design thinking","FN":"design thinking","FId":142778471},{"DFN":"Computer science","FN":"computer science","FId":41008148}],"C":{"CN":"iticse","CId":1167012292},"CI":{"CIN":"iticse 2010","CIId":28015445},"E":"{\"DN\":\"PhidgetLab: crossing the border from virtual to real-world objects\",\"IA\":{\"IndexLength\":128,\"InvertedIndex\":{\"Teaching\":[0],\"pupils\":[1],\"the\":[2,54,71,77,94,108,111,117],\"ideas\":[3],\"behind\":[4],\"objects\":[5,36,47,88],\"in\":[6,100],\"programming\":[7,28,41,61],\"languages\":[8],\"can\":[9,48],\"be\":[10,50],\"difficult\":[11],\"since\":[12],\"these\":[13,46],\"concepts\":[14],\"are\":[15,90],\"mostly\":[16],\"abstract\":[17],\"and\":[18,37,115],\"not\":[19],\"comprehensible\":[20],\"at\":[21],\"first\":[22],\"sight.\":[23],\"Etoys\":[24,72],\"as\":[25],\"a\":[26,60,101,123],\"visual\":[27],\"environment\":[29,62],\"counters\":[30],\"such\":[31],\"issues\":[32],\"by\":[33],\"introducing\":[34],\"visible\":[35],\"simple\":[38],\"tiles\":[39],\"for\":[40,63],\"them.\":[42],\"However,\":[43],\"all\":[44],\"of\":[45,70,110,119,126],\"only\":[49],\"experienced\":[51],\"virtually\":[52],\"on\":[53,68],\"screen.\":[55],\"This\":[56],\"paper\":[57],\"presents\":[58],\"PhidgetLab,\":[59],\"electronic\":[64],\"components\":[65],\"(Phidgets)\":[66],\"realised\":[67],\"top\":[69],\"environment.\":[73],\"PhidgetLab\":[74,97],\"helps\":[75],\"crossing\":[76],\"border\":[78],\"from\":[79],\"virtual\":[80],\"to\":[81,93],\"real-world\":[82],\"objects.\":[83],\"Pupils\":[84],\"interact\":[85],\"with\":[86,104],\"tangible\":[87],\"that\":[89],\"seamlessly\":[91],\"connected\":[92],\"digital\":[95],\"world.\":[96],\"was\":[98],\"evaluated\":[99],\"case\":[102],\"study\":[103],\"22\":[105],\"pupils,\":[106],\"following\":[107],\"principles\":[109],\"Design\":[112],\"Thinking\":[113],\"methodology\":[114],\"comprised\":[116],\"realisation\":[118],\"five\":[120],\"prototypes\":[121],\"within\":[122],\"short\":[124],\"period\":[125],\"time.\":[127]}},\"S\":[{\"Ty\":0,\"U\":\"http://dblp.uni-trier.de/db/conf/iticse/iticse2010.html#HauptPHKKPST10\"},{\"Ty\":3,\"U\":\"http://www.hpi.uni-potsdam.de/hirschfeld/publications/media/HauptPerscheidHirschfeldKesslerKlingbeilPlatzSchlegelTessenow_2010_PhidgetLab_AcmDL.pdf\"},{\"Ty\":1,\"U\":\"https://dl.acm.org/citation.cfm?id=1822112\"},{\"Ty\":0,\"U\":\"http://dl.acm.org/citation.cfm?id=1822112\"}],\"VFN\":\"Integrating Technology into Computer Science Education\",\"VSN\":\"ITiCSE\",\"FP\":73,\"LP\":77,\"DOI\":\"10.1145/1822090.1822112\",\"CC\":{\"9402527\":[\"behind the scenes, pupils are not directly exposed to the involved complexity—PhidgetLab clearly supports the didactic approach that the spiral pattern suggests [4].\"],\"220870191\":[\"The Etoys [1] programming environment provides clean object-oriented programming abstractions to inexperienced “programmers”; the typical target audience are children and\",\"The Etoys environment [1] is implemented on top of Squeak.\"],\"1529323856\":[\"Supported hardware includes the Arduino [2] platform and Lego Mindstorms NXT.\"],\"1563045389\":[\"However, tangibility, involving haptic abilities in the learning process, greatly improves on learning success [7].\"],\"1770006921\":[\"BACKGROUND Squeak [8] is an implementation of the Smalltalk programming language [6].\"],\"2114657742\":[\"PhidgetLab was successfully applied in a setting where pupils were confronted with prototyping tasks that they had to address using the Design Thinking [9] methodology.\",\"Design Thinking [9] is a mind-set and methodology for creating innovative solutions for particular needs or problems.\"],\"2119673170\":[\"Alice [5] is a 3D authoring environment targeting programming beginners.\"],\"2125813862\":[\"NXTalk 11 [ 3 ] is a Smalltalk programming environment for\"],\"2133368199\":[\"[10], which is implemented in Squeak, albeit without uncovering this fact.\"],\"2172147300\":[\"Squeak 2 [ 8 ] is an implementation of the Smalltalk programming language [6].\"]},\"PR\":[2181335707,2767080245,1878897793,2396838746,2517448700,615851705,2050802315,2198673510,2207100703,2466830709,131937011,2464283278,2617925741,2181404473,605589781,2772482464,2742847201,1267451058,2464090704,1556269738,2181335707,2767080245,1878897793,2396838746,2517448700,615851705,2050802315,2198673510,2207100703,2466830709,131937011,2464283278,2617925741,2181404473,605589781,2772482464,2742847201,1267451058,2464090704,1556269738],\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Haupt\",\"S\":1},{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":2},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":3},{\"FN\":\"Lysann\",\"LN\":\"Kessler\",\"S\":4},{\"FN\":\"Thomas\",\"LN\":\"Klingbeil\",\"S\":5},{\"FN\":\"Stephanie\",\"LN\":\"Platz\",\"S\":6},{\"FN\":\"Frank\",\"LN\":\"Schlegel\",\"S\":7},{\"FN\":\"Philipp\",\"LN\":\"Tessenow\",\"S\":8}],\"BV\":\"Proceedings of the fifteenth annual conference on Innovation and technology in computer science education\",\"BT\":\"p\",\"PB\":\"ACM\"}"},{"logprob":-21.913,"Id":2105263737,"Ty":"0","Ti":"follow the path debugging tools for test driven fault navigation","Pt":"3","L":"en","Y":2014,"D":"2014-02-01","CC":5,"ECC":5,"RId":[2110908283,2162045655,2172147300,1574060188,1673079227,2133046607,1774013863,1972151373,2065296680,2111708921],"W":["debugging","driven","fault","follow","navigation","path","test","tools"],"AA":[{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":1},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":2}],"F":[{"DFN":"Test case","FN":"test case","FId":128942645},{"DFN":"Squeak","FN":"squeak","FId":2780281086},{"DFN":"Smalltalk","FN":"smalltalk","FId":2777293101},{"DFN":"Shotgun debugging","FN":"shotgun debugging","FId":87079347},{"DFN":"Real-time computing","FN":"real time computing","FId":79403827},{"DFN":"Development environment","FN":"development environment","FId":139968098},{"DFN":"Debugging","FN":"debugging","FId":168065819},{"DFN":"Computer science","FN":"computer science","FId":41008148},{"DFN":"Background debug mode interface","FN":"background debug mode interface","FId":124774103},{"DFN":"Algorithmic program debugging","FN":"algorithmic program debugging","FId":136388014}],"C":{"CN":"csmr","CId":1145597874},"E":"{\"DN\":\"Follow the path: Debugging tools for test-driven fault navigation\",\"IA\":{\"IndexLength\":92,\"InvertedIndex\":{\"Debugging\":[0],\"failing\":[1],\"test\":[2,25],\"cases,\":[3],\"particularly\":[4],\"the\":[5,88],\"search\":[6],\"for\":[7,87],\"failure\":[8,39,70],\"causes,\":[9],\"is\":[10],\"often\":[11],\"a\":[12,53],\"laborious\":[13],\"and\":[14,24,59,77],\"time-consuming\":[15],\"activity.\":[16],\"Standard\":[17],\"debugging\":[18,54,85],\"tools\":[19,81],\"such\":[20],\"as\":[21,52],\"symbolic\":[22],\"debuggers\":[23],\"runners\":[26],\"hardly\":[27],\"facilitate\":[28],\"developers\":[29],\"during\":[30],\"this\":[31,45],\"task\":[32],\"because\":[33],\"they\":[34],\"neither\":[35],\"provide\":[36],\"advice\":[37],\"to\":[38,67,73],\"causes\":[40,71],\"nor\":[41],\"back-in-time\":[42],\"capabilities.\":[43],\"In\":[44],\"paper,\":[46],\"we\":[47],\"present\":[48],\"test-driven\":[49],\"fault\":[50],\"navigation\":[51],\"guide\":[55],\"that\":[56,82],\"integrates\":[57],\"spectrum-based\":[58],\"state\":[60],\"anomalies\":[61],\"into\":[62],\"execution\":[63],\"histories\":[64],\"in\":[65],\"order\":[66],\"systematically\":[68],\"trace\":[69],\"back\":[72],\"defects.\":[74],\"We\":[75],\"describe\":[76],\"demonstrate\":[78],\"our\":[79,84],\"Path\":[80],\"implement\":[83],\"method\":[86],\"Squeak/Smalltalk\":[89],\"development\":[90],\"environment.\":[91]}},\"S\":[{\"Ty\":3,\"U\":\"http://www.hirschfeld.org/writings/media/PerscheidHirschfeld_2014_FollowThePathDebuggingToolsForTestDrivenFaultNavigation_IEEE.pdf\"},{\"Ty\":3,\"U\":\"http://doi.ieeecomputersociety.org/10.1109/CSMR-WCRE.2014.6747215\"},{\"Ty\":1,\"U\":\"http://dblp.uni-trier.de/db/conf/csmr/csmr2014.html#PerscheidH14\"},{\"Ty\":1,\"U\":\"http://ieeexplore.ieee.org/document/6747215/\"}],\"VFN\":\"Conference on Software Maintenance and Reengineering\",\"VSN\":\"CSMR\",\"FP\":446,\"LP\":449,\"DOI\":\"10.1109/CSMR-WCRE.2014.6747215\",\"CC\":{\"1574060188\":[\"Unfortunately, common debugging tools are inadequate for systematically investigating such infection chains in detail [1].\"],\"1774013863\":[\"1 (left), the fault localization flap is open and allows developers to start the structure navigation [8].\",\"For our team navigation [8], pushing the “Developer Ranking” button presents a ranked list of expert developers by relating suspicious methods with their authors.\",\"Not only does it provide immediate access to run-time information [10], but also classifies traces with suspicious behavior [8] and anomalous state [9].\",\"user study [8] step-by-step1.\"],\"1972151373\":[\"PathFinder [10] is our lightweight back-in-time debugger [5] for exploring specific test case executions with a special focus\",\"Not only does it provide immediate access to run-time information [10], but also classifies traces with suspicious behavior [8] and anomalous state [9].\",\"Moreover, to ensure an experience of immediacy when debugging with our tools, we have also developed the so called incremental dynamic analysis [10].\"],\"2065296680\":[\"PathMap [7] is an extended unit test runner for implementing our structure, team, and state navigation.\"],\"2110908283\":[\"Our test-driven fault navigation [2] is a debugging guide that integrates spectrum- [3] and state-based [4] anomaly detection into a systematic breadth-first search for tracing failure causes back to defects.\",\"For example, the inductive analysis flap allows developers to derive likely invariants [4] for our state navigation [9].\",\"Our behavior navigation combines such suspicious methods with back-in-time debuggers [5] and, finally, likely invariants [4] emphasize state violations along infection chains.\"],\"2111708921\":[\"For example, the inductive analysis flap allows developers to derive likely invariants [4] for our state navigation [9].\",\"Not only does it provide immediate access to run-time information [10], but also classifies traces with suspicious behavior [8] and anomalous state [9].\",\"Furthermore, our state navigation [9] maps violated contracts to traces by adding small exclamation marks (3) to methods.\"],\"2133046607\":[\"A similar idea has been developed in parallel [11].\"],\"2162045655\":[\"Our test-driven fault navigation [2] is a debugging guide that integrates spectrum- [3] and state-based [4] anomaly detection into a systematic breadth-first search for tracing failure causes back to defects.\",\"If developers run selected tests, we automatically record their coverage, compute spectrum-based anomalies [3], and color the map with suspiciousness and confidence scores.\",\"Spectrum-based fault localization [3] provides the basis for our structure navigation.\"],\"2172147300\":[\"In this paper, we present our Path tools that implement test-driven fault navigation for the Squeak/Smalltalk [6].\"]},\"PR\":[2813924655,2166715292,2064135357,2114289261,2056640390,2059289918,653374623,2833869491,2825349371,2828789260,2858810724,2845129494,2899875271,2869955408,2879255998,2871316100,2854954223,2071486761,2046722199,1994476536,2813924655,2166715292,2064135357,2114289261,2056640390,2059289918,653374623,2833869491,2825349371,2828789260,2858810724,2845129494,2899875271,2869955408,2879255998,2871316100,2854954223,2071486761,2046722199,1994476536],\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":1},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":2}],\"BV\":\"2014 Software Evolution Week - IEEE Conference on Software Maintenance, Reengineering, and Reverse Engineering (CSMR-WCRE)\",\"BT\":\"p\",\"PB\":\"IEEE\"}"},{"logprob":-22.271,"Id":2580141483,"Ty":"0","Ti":"bringing back in time debugging down to the database","Pt":"3","L":"en","Y":2017,"D":"2017-02-01","CC":1,"ECC":1,"RId":[1977330283,1984248430,2002985857,1984846967,1507612039,2082498963,1494235637,1774013863,2118393301,2563120126],"W":["back","bringing","database","debugging","down","time"],"AA":[{"DAuN":"Arian Treffer","AuN":"arian treffer","AuId":1851528990,"DAfN":"Hasso-Plattner-Institut, Potsdam, Germany","S":1},{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":2712937134,"DAfN":"SAP Innovation Center, Potsdam, Germany","S":2},{"DAuN":"Matthias Uflacker","AuN":"matthias uflacker","AuId":2008573489,"DAfN":"Hasso-Plattner-Institut, Potsdam, Germany","S":3}],"F":[{"DFN":"Stored procedure","FN":"stored procedure","FId":154420247},{"DFN":"Scripting language","FN":"scripting language","FId":61423126},{"DFN":"SQL","FN":"sql","FId":510870499},{"DFN":"SAP HANA","FN":"sap hana","FId":15051874},{"DFN":"Real-time computing","FN":"real time computing","FId":79403827},{"DFN":"Distributed database","FN":"distributed database","FId":70061542},{"DFN":"Debugging","FN":"debugging","FId":168065819},{"DFN":"Debugger","FN":"debugger","FId":2778485113},{"DFN":"Database","FN":"database","FId":77088390},{"DFN":"Computer science","FN":"computer science","FId":41008148},{"DFN":"Algorithmic program debugging","FN":"algorithmic program debugging","FId":136388014}],"C":{"CN":"saner","CId":2754456056},"E":"{\"DN\":\"Bringing back-in-time debugging down to the database\",\"IA\":{\"IndexLength\":155,\"InvertedIndex\":{\"With\":[0,98],\"back-in-time\":[1,36,69],\"debuggers,\":[2],\"developers\":[3,52,82],\"can\":[4,106],\"explore\":[5],\"what\":[6],\"happened\":[7],\"before\":[8],\"observable\":[9],\"failures\":[10,43],\"by\":[11,46],\"following\":[12],\"infection\":[13],\"chains\":[14],\"back\":[15],\"to\":[16,72,83,150],\"their\":[17,57],\"root\":[18],\"causes.\":[19],\"While\":[20],\"there\":[21],\"are\":[22,44],\"several\":[23],\"such\":[24],\"debuggers\":[25],\"for\":[26,67],\"object-oriented\":[27],\"programming\":[28],\"languages,\":[29],\"we\":[30,63,105],\"do\":[31],\"not\":[32],\"know\":[33],\"of\":[34,101,112,123],\"any\":[35],\"capabilities\":[37],\"at\":[38,91,142],\"the\":[39,73,89,99,151],\"database-level.\":[40],\"Thus,\":[41],\"if\":[42],\"caused\":[45],\"SQL\":[47,103],\"scripts\":[48],\"or\":[49],\"stored\":[50],\"procedures,\":[51],\"have\":[53],\"difficulties\":[54],\"in\":[55,96],\"understanding\":[56],\"unexpected\":[58],\"behavior.\":[59],\"In\":[60],\"this\":[61],\"paper,\":[62],\"present\":[64],\"an\":[65],\"approach\":[66,134],\"bringing\":[68],\"debugging\":[70,117],\"down\":[71],\"SAP\":[74,143],\"HANA\":[75],\"in-memory\":[76],\"database.\":[77],\"Our\":[78],\"TARDISP\":[79],\"debugger\":[80],\"allows\":[81],\"step\":[84],\"queries\":[85,108],\"backwards\":[86],\"and\":[87,93,119,130,144],\"inspecting\":[88],\"database\":[90],\"previous\":[92],\"arbitrary\":[94],\"points\":[95],\"time.\":[97],\"help\":[100],\"a\":[102,110,116,139],\"extension,\":[104],\"express\":[107],\"covering\":[109],\"period\":[111],\"execution\":[113],\"time\":[114],\"within\":[115,138],\"session\":[118],\"handle\":[120],\"large\":[121],\"amounts\":[122],\"data\":[124],\"with\":[125,148],\"low\":[126],\"overhead\":[127],\"on\":[128],\"performance\":[129],\"memory.\":[131],\"The\":[132],\"entire\":[133],\"has\":[135],\"been\":[136],\"evaluated\":[137],\"development\":[140],\"project\":[141],\"shows\":[145],\"promising\":[146],\"results\":[147],\"respect\":[149],\"gathered\":[152],\"developer\":[153],\"feedback.\":[154]}},\"S\":[{\"Ty\":1,\"U\":\"https://arxiv.org/abs/1701.05327\"},{\"Ty\":1,\"U\":\"http://dblp.uni-trier.de/db/journals/corr/corr1701.html#TrefferPU17\"}],\"VFN\":\"IEEE International Conference on Software Analysis, Evolution, and Reengineering\",\"VSN\":\"SANER\",\"FP\":521,\"LP\":525,\"DOI\":\"10.1109/SANER.2017.7884666\",\"CC\":{\"1774013863\":[\"ddistributeddatabasetobetterhandle largeamountsoftracedata.Objectflowanalysis[7]reduces therequiredamountofmemorybyleveragingtheVM’s garbagecollector.ThePathtoolsuiteanditsTest-Driven Fault Navigation [8] leverages reproducible test cases in ordertodistributethetracingoverheadovermultipleruns dependingondevelopers’needs.SPYDER[1]andtheSlice Navigator[13]areback-in-timedebuggersthatusedynamic slicingto\"],\"1984248430\":[\"ograms. Futureworkwillmoveintwodirections.First,weshall bring more advanced debugging techniques that use a combinationoftracedataandcodeanalysistohelpidentify failure causes, such as dynamic slicing [2] down to the database.Second,whiledevelopersnowhavethetoolsto efficientlydebugeachlayerofacomplexapplication,the tool support to track infection chains across layers and systemboundariesisstilllacking.W\"]},\"PR\":[2770917844,2899875271,1917216709,2026757266,139152171,1976122744,125219212,600065007,2114289261,2039676055,2103843930,2170913501,2052097008,2319415934,2009047716,2898163933,2135925327,2543963479,2157922094,2097576663,2770917844,2899875271,1917216709,2026757266,139152171,1976122744,125219212,600065007,2114289261,2039676055,2103843930,2170913501,2052097008,2319415934,2009047716,2898163933,2135925327,2543963479,2157922094,2097576663],\"ANF\":[{\"FN\":\"Arian\",\"LN\":\"Treffer\",\"S\":1},{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":2},{\"FN\":\"Matthias\",\"LN\":\"Uflacker\",\"S\":3}],\"BV\":\"2017 IEEE 24th International Conference on Software Analysis, Evolution and Reengineering (SANER)\",\"BT\":\"p\"}"},{"logprob":-22.358,"Id":2130237836,"Ty":"0","Ti":"debugging into examples","Pt":"3","L":"en","Y":2009,"D":"2009-11-03","CC":3,"ECC":3,"RId":[2143238865,2029414465,2172147300,2164372721,2499711114,2104354357,2135704076,1574879889,1491095550,2102444871,2109469978,2112873091,2170311191,2006684428,2168335247,1487995234,2155848253,2803343605,2886743082],"W":["debugging","examples"],"AA":[{"DAuN":"Bastian Steinert","AuN":"bastian steinert","AuId":2142371068,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":1},{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":2},{"DAuN":"Martin Beck","AuN":"martin beck","AuId":2309158709,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":3},{"DAuN":"Jens Lincke","AuN":"jens lincke","AuId":2055148755,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":4},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":5}],"F":[{"DFN":"Unreachable code","FN":"unreachable code","FId":50951305},{"DFN":"Static program analysis","FN":"static program analysis","FId":137287247},{"DFN":"Source code","FN":"source code","FId":43126263},{"DFN":"Software engineering","FN":"software engineering","FId":115903868},{"DFN":"Programming language","FN":"programming language","FId":199360897},{"DFN":"Program animation","FN":"program animation","FId":35167187},{"DFN":"KPI-driven code analysis","FN":"kpi driven code analysis","FId":121957198},{"DFN":"Computer science","FN":"computer science","FId":41008148},{"DFN":"Code review","FN":"code review","FId":150292731},{"DFN":"Code generation","FN":"code generation","FId":133162039},{"DFN":"Code coverage","FN":"code coverage","FId":53942775}],"C":{"CN":"testcom","CId":2756772395},"E":"{\"DN\":\"Debugging into Examples\",\"IA\":{\"IndexLength\":115,\"InvertedIndex\":{\"Enhancing\":[0],\"and\":[1,33,100],\"maintaining\":[2],\"a\":[3,43],\"complex\":[4,32],\"software\":[5,25,52],\"system\":[6],\"requires\":[7],\"detailed\":[8],\"understanding\":[9,17],\"of\":[10,42,51,108],\"the\":[11,40],\"underlying\":[12],\"source\":[13,20,45,63],\"code.\":[14],\"Gaining\":[15],\"this\":[16],\"by\":[18,58,67,89,106],\"reading\":[19],\"code\":[21,46,64,88,102],\"is\":[22,31],\"difficult.\":[23],\"Since\":[24],\"systems\":[26,53],\"are\":[27],\"inherently\":[28],\"dynamic,\":[29],\"it\":[30,77],\"time\":[34],\"consuming\":[35],\"to\":[36,62,75,81],\"imagine,\":[37],\"for\":[38,79],\"example,\":[39],\"effects\":[41],\"method's\":[44],\"at\":[47],\"run-time.\":[48],\"The\":[49],\"inspection\":[50],\"during\":[54],\"execution,\":[55],\"as\":[56,70],\"encouraged\":[57],\"debugging\":[59,90],\"tools,\":[60],\"contributes\":[61],\"comprehension.\":[65],\"Leveraged\":[66],\"test\":[68,98],\"cases\":[69,99],\"entry\":[71],\"points,\":[72],\"we\":[73],\"want\":[74],\"make\":[76],\"easy\":[78],\"developers\":[80],\"experience\":[82],\"selected\":[83],\"execution\":[84],\"paths\":[85],\"in\":[86],\"their\":[87],\"into\":[91],\"examples.\":[92],\"We\":[93],\"show\":[94],\"how\":[95],\"links\":[96],\"between\":[97],\"application\":[101],\"can\":[103],\"be\":[104],\"established\":[105],\"means\":[107],\"dynamic\":[109],\"analysis\":[110],\"while\":[111],\"executing\":[112],\"regular\":[113],\"tests.\":[114]}},\"S\":[{\"Ty\":3,\"U\":\"http://dl.ifip.org/db/conf/pts/testcom2009/SteinertPBLH09.pdf\"},{\"Ty\":3,\"U\":\"https://link.springer.com/content/pdf/10.1007%2F978-3-642-05031-2_18.pdf\"},{\"Ty\":1,\"U\":\"https://link.springer.com/chapter/10.1007%2F978-3-642-05031-2_18\"},{\"Ty\":1,\"U\":\"http://adsabs.harvard.edu/abs/2009LNCS.5826..235S\"},{\"Ty\":1,\"U\":\"https://rd.springer.com/chapter/10.1007/978-3-642-05031-2_18\"}],\"VFN\":\"International Conference on Testing (of Software and) Communication Systems\",\"VSN\":\"TestCom\",\"FP\":235,\"LP\":240,\"DOI\":\"10.1007/978-3-642-05031-2_18\",\"CC\":{\"1491095550\":[\"To record the relevant run-time data, we apply aspect-oriented programming techniques [8, 10].\"],\"1574879889\":[\"Related research results have already emphasized the usefulness of examples and extensions to Integrated Development Environments (IDEs) for source code comprehension [5,6, 12 ,14].\\u001bMost tracing approaches are designed for general analysis purposes and thus have to record lots of data such as the state of all objects for each step in the execution [ 12 ].\"],\"2006684428\":[\"Related research results have already emphasized the usefulness of examples and extensions to Integrated Development Environments (IDEs) for source code comprehension [5,6,12, 14 ].\\u001bThe feature driven browser [ 14 ] is based on the ideas of feature location [6] and combines an interactive visual representation of features with its related source code entities within the Squeak IDE.\"],\"2102444871\":[\"In contrast to static analysis, dynamic analysis allows to collect run-time information such as method bindings [ 13 ] during the execution of a particular path.\"],\"2104354357\":[\"We developed a tracing aspect that intercepts all calls of selected application methods [ 7 ]—developers are usually not interested in tracing all libraries of the system.\"],\"2112873091\":[\"For instance, behavioral properties, such as message exchange in object-oriented programs, can only be determined precisely at run-time [1].\"],\"2135704076\":[\"a method and following a message flow more difficult [4, 16].\"],\"2143238865\":[\"To record the relevant run-time data, we apply aspect-oriented programming techniques [8, 10].\"],\"2155848253\":[\"We developed a tracing aspect that intercepts all calls of selected application methods [7]—developers are usually not interested in tracing all libraries of the system.\"],\"2164372721\":[\"WhyLine [11] is a debugger rather than an IDE but offers sophisticated means for inspecting the system at run-time.\"],\"2168335247\":[\"a method and following a message flow more difficult [4, 16].\"],\"2170311191\":[\"The Squeak IDE extension Hermion [15] enriches source code views with runtime data.\"],\"2172147300\":[\"We extended the source code browsing tools of Squeak Smalltalk [9].\"],\"2803343605\":[\"Related research results have already emphasized the usefulness of examples and extensions to Integrated Development Environments (IDEs) for source code comprehension [5, 6, 12, 14].\",\"The feature driven browser [14] is based on the ideas of feature location [6] and combines an interactive visual representation of features with its related source code entities within the Squeak IDE.\"],\"2886743082\":[\"Related research results have already emphasized the usefulness of examples and extensions to Integrated Development Environments (IDEs) for source code comprehension [5, 6, 12, 14].\",\"In [5], for example, the author argues that unit tests can often be considered as usage examples for the units under test.\",\"Furthermore, research results described in [5] might be useful to filter and order the list of possible entry points according to relevance.\"]},\"PR\":[1183695963,2144995606,2782743876,2306294637,2024544369,1558063307,950459763,2060626906,2281471732,1984846967,1902907570,2564788809,2120501260,1986544324,26428152,1999427125,2107328031,2120459757,1500344871,2168363980,1183695963,2144995606,2782743876,2306294637,2024544369,1558063307,950459763,2060626906,2281471732,1984846967,1902907570,2564788809,2120501260,1986544324,26428152,1999427125,2107328031,2120459757,1500344871,2168363980],\"ANF\":[{\"FN\":\"Bastian\",\"LN\":\"Steinert\",\"S\":1},{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":2},{\"FN\":\"Martin\",\"LN\":\"Beck\",\"S\":3},{\"FN\":\"Jens\",\"LN\":\"Lincke\",\"S\":4},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":5}],\"BV\":\"TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop\",\"BT\":\"p\",\"PB\":\"Springer, Berlin, Heidelberg\"}"},{"logprob":-22.545,"Id":2740106971,"Ty":"0","Ti":"exploratory development of data intensive applications sampling and streaming of large data sets in live programming environments","Pt":"0","L":"en","Y":2017,"D":"2017-04-03","CC":0,"ECC":0,"RId":[2611278845,1770006921,2073912395,2088675571,2172147300,2045723688,1522006088,2080258928,2120829994,1565645576,2086430431,1969667418,90361031,2227389699,1527077815,2038903004,2472748283,1529345125,1481441011,104355519,2467149053,2487791581,2328193884,2012451248,2518770195,89199789],"W":["applications","data","development","environments","exploratory","intensive","large","live","programming","sampling","sets","streaming"],"AA":[{"DAuN":"Patrick Rein","AuN":"patrick rein","AuId":2229220081,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":1},{"DAuN":"Marcel Taeumel","AuN":"marcel taeumel","AuId":83004794,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":2},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":3},{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"SAP Innovation Center, Potsdam, Germany","S":4}],"F":[{"DFN":"Theoretical computer science","FN":"theoretical computer science","FId":80444323},{"DFN":"Squeak","FN":"squeak","FId":2780281086},{"DFN":"Smalltalk","FN":"smalltalk","FId":2777293101},{"DFN":"Sampling (statistics)","FN":"sampling","FId":90842384},{"DFN":"Relational database","FN":"relational database","FId":5655090},{"DFN":"Data set","FN":"data set","FId":58489278},{"DFN":"Computer science","FN":"computer science","FId":41008148}],"E":"{\"DN\":\"Exploratory Development of Data-intensive Applications: Sampling and Streaming of Large Data Sets in Live Programming Environments\",\"IA\":{\"IndexLength\":154,\"InvertedIndex\":{\"Business\":[0],\"applications\":[1,12,84],\"are\":[2],\"usually\":[3,29],\"data-intensive.\":[4],\"The\":[5],\"process\":[6],\"of\":[7,81,87,93,104,119,122,151],\"designing\":[8],\"and\":[9,22,32,38,44,54,74,124,137],\"implementing\":[10],\"such\":[11,26,109,130],\"benefits\":[13],\"from\":[14],\"working\":[15,58],\"with\":[16,59,71],\"realistic\":[17,61],\"data\":[18,27,123],\"to\":[19,96,147],\"sharpen\":[20],\"requirements\":[21],\"discover\":[23],\"pitfalls.\":[24],\"However,\":[25],\"is\":[28,113,125],\"quite\":[30],\"extensive\":[31],\"the\":[33,79,91,117,148],\"feedback\":[34,73],\"cycles\":[35],\"during\":[36],\"programming\":[37,107],\"design\":[39],\"activities\":[40],\"can\":[41,100],\"become\":[42],\"long\":[43],\"distracting.\":[45],\"As\":[46],\"a\":[47,65,105],\"result,\":[48],\"programmers\":[49],\"might\":[50],\"prefer\":[51],\"abstract\":[52],\"thinking\":[53],\"mental\":[55],\"simulations\":[56],\"over\":[57],\"concrete,\":[60],\"data.\":[62],\"We\":[63,132],\"propose\":[64],\"new\":[66],\"approach\":[67,144],\"supporting\":[68],\"live\":[69,106],\"programming,\":[70],\"immediate\":[72],\"explorable\":[75],\"runtime\":[76],\"data,\":[77,98],\"for\":[78,116,129],\"domain\":[80],\"data-intensive\":[82],\"business\":[83,152],\"on\":[85],\"top\":[86],\"relational\":[88],\"databases.\":[89],\"With\":[90],\"integration\":[92],\"streamed\":[94],\"access\":[95],\"sampled\":[97],\"we\":[99],\"employ\":[101],\"productive\":[102],\"traits\":[103],\"environment\":[108],\"as\":[110],\"Squeak/Smalltalk,\":[111],\"which\":[112],\"not\":[114,127],\"optimized\":[115],\"processing\":[118],\"huge\":[120],\"amounts\":[121],\"hence\":[126],\"well-suited\":[128],\"tasks.\":[131],\"describe\":[133],\"two\":[134],\"representative\":[135],\"scenarios\":[136],\"also\":[138],\"discuss\":[139],\"limitations\":[140],\"by\":[141],\"putting\":[142],\"our\":[143],\"in\":[145],\"relation\":[146],\"current\":[149],\"development\":[150],\"applications.\":[153]}},\"S\":[{\"Ty\":1,\"U\":\"https://dl.acm.org/citation.cfm?id=3079399\"},{\"Ty\":1,\"U\":\"https://doi.org/10.1145/3079368.3079399\"},{\"Ty\":0,\"U\":\"http://doi.acm.org/10.1145/3079368.3079399\"},{\"Ty\":0,\"U\":\"http://dl.acm.org/citation.cfm?doid=3079368.3079399\"}],\"VFN\":\"Companion to the first International Conference on the Art, Science and Engineering of Programming on \",\"FP\":25,\"DOI\":\"10.1145/3079368.3079399\",\"PR\":[2123942796,2238451760,2886406194,2733842072,2074460589,2886378351,1590317065,2293946261,2606547379,2772535856,2391592313,1505920041,1525295823,1592107557,2898508336,2246277364,1605676483,1977695489,2784687354,1635892993,2123942796,2238451760,2886406194,2733842072,2074460589,2886378351,1590317065,2293946261,2606547379,2772535856,2391592313,1505920041,1525295823,1592107557,2898508336,2246277364,1605676483,1977695489,2784687354,1635892993],\"ANF\":[{\"FN\":\"Patrick\",\"LN\":\"Rein\",\"S\":1},{\"FN\":\"Marcel\",\"LN\":\"Taeumel\",\"S\":2},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":3},{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":4}],\"BV\":\"Companion to the first International Conference on the Art, Science and Engineering of Programming on \",\"BT\":\"p\",\"PB\":\"ACM\"}"},{"logprob":-22.594,"Id":152925115,"Ty":"0","Ti":"debugging into examples leveraging tests for program comprehension","Pt":"0","Y":2009,"D":"2009-01-01","CC":3,"ECC":3,"RId":[2143238865,2029414465,2172147300,2164372721,2104354357,2135704076,1574879889,1491095550,2102444871,2112873091,2170311191,2006684428,2168335247,1487995234,2155848253,2803343605,2886743082],"W":["comprehension","debugging","examples","leveraging","program","tests"],"AA":[{"DAuN":"Bastian Steinert","AuN":"bastian steinert","AuId":2142371068,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":1},{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"S":2},{"DAuN":"Martin Beck","AuN":"martin beck","AuId":2309158709,"S":3},{"DAuN":"Jens Lincke","AuN":"jens lincke","AuId":2055148755,"S":4},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"S":5}],"F":[{"DFN":"Test case","FN":"test case","FId":128942645},{"DFN":"Static program analysis","FN":"static program analysis","FId":137287247},{"DFN":"Source code","FN":"source code","FId":43126263},{"DFN":"Programming language","FN":"programming language","FId":199360897},{"DFN":"Program comprehension","FN":"program comprehension","FId":2777561058},{"DFN":"Program animation","FN":"program animation","FId":35167187},{"DFN":"KPI-driven code analysis","FN":"kpi driven code analysis","FId":121957198},{"DFN":"Debugging","FN":"debugging","FId":168065819},{"DFN":"Computer science","FN":"computer science","FId":41008148},{"DFN":"Code review","FN":"code review","FId":150292731}],"E":"{\"DN\":\"Debugging into Examples Leveraging Tests for Program Comprehension\",\"IA\":{\"IndexLength\":118,\"InvertedIndex\":{\"Enhancing\":[0],\"and\":[1,34,102],\"maintaining\":[2],\"a\":[3,44],\"complex\":[4,33],\"software\":[5,26,54],\"system\":[6],\"re-\":[7],\"quires\":[8],\"detailed\":[9],\"understanding\":[10,18],\"of\":[11,43,53,111],\"the\":[12,41],\"underlying\":[13],\"source\":[14,21,46,65],\"code.\":[15],\"Gaining\":[16],\"this\":[17],\"by\":[19,60,69,91,109],\"reading\":[20],\"code\":[22,47,66,90,104],\"is\":[23,32],\"difficult.\":[24],\"Since\":[25],\"systems\":[27,55],\"are\":[28],\"inherently\":[29],\"dynamic,\":[30],\"it\":[31,79],\"time\":[35],\"consuming\":[36],\"to\":[37,64,77,83],\"imagine,\":[38],\"for\":[39,81],\"example,\":[40],\"effects\":[42],\"method's\":[45],\"at\":[48],\"run-time.\":[49],\"The\":[50],\"inspec-\":[51],\"tion\":[52],\"during\":[56],\"execution,\":[57],\"as\":[58,72],\"encouraged\":[59],\"debugging\":[61,92],\"tools,\":[62],\"contributes\":[63],\"comprehension.\":[67],\"Leveraged\":[68],\"test\":[70,100],\"cases\":[71,101],\"entry\":[73],\"points,\":[74],\"we\":[75],\"want\":[76],\"make\":[78],\"easy\":[80],\"developers\":[82],\"experience\":[84],\"selected\":[85],\"execution\":[86],\"paths\":[87],\"in\":[88],\"their\":[89],\"into\":[93],\"examples.\":[94],\"We\":[95],\"show\":[96],\"how\":[97],\"links\":[98],\"between\":[99],\"application\":[103],\"can\":[105],\"be\":[106],\"estab-\":[107],\"lished\":[108],\"means\":[110],\"dynamic\":[112],\"analysis\":[113],\"while\":[114],\"executing\":[115],\"regular\":[116],\"tests.\":[117]}},\"S\":[{\"Ty\":3,\"U\":\"http://www.hirschfeld.org/writings/media/SteinertPerscheidBeckLinckeHirschfeld_2009_DebuggingIntoExamplesLeveragingTestsForProgramComprehension_SpringerLNCS.pdf\"},{\"Ty\":3,\"U\":\"https://www.researchgate.net/profile/Michael_Perscheid/publication/221047094_Debugging_into_Examples/links/09e415074807e0239c000000.pdf\"}],\"VFN\":\"\",\"CC\":{\"1487995234\":[\"amounts of data [3].\"],\"1491095550\":[\"To record the relevant run-time data, we apply aspect-oriented programming techniques [8,10].\"],\"2006684428\":[\"Related research results have already emphasized the usefulness of examples and extensions to Integrated Development Environments (IDEs) for source code comprehension [5,6,12,14].\",\"The feature driven browser [14] is based on the ideas of feature location [6] and combines an interactive visual representation of features with its related source code entities within the Squeak IDE.\"],\"2102444871\":[\"In contrast to static analysis, dynamic analysis allows to collect run-time information such as method bindings [13] during the execution of a particular path.\"],\"2104354357\":[\"To discover relationships between source code entities, static as well as dynamic analysis [2] can be used.\"],\"2112873091\":[\"For instance, behavioral properties, such as message exchange in object-oriented programs, can only be determined precisely at run-time [1].\"],\"2135704076\":[\"a method and following a message flow more difficult [4,16].\"],\"2143238865\":[\"To record the relevant run-time data, we apply aspect-oriented programming techniques [8,10].\"],\"2164372721\":[\"WhyLine [11] is a debugger rather than an IDE but offers sophisticated means for inspecting the system at run-time.\"],\"2168335247\":[\"a method and following a message flow more difficult [4,16].\"],\"2170311191\":[\"The Squeak IDE extension Hermion [15] enriches source code views with runtime data.\"],\"2172147300\":[\"We extended the source code browsing tools of Squeak Smalltalk [9].\"],\"2803343605\":[\"Related research results have already emphasized the usefulness of examples and extensions to Integrated Development Environments (IDEs) for source code comprehension [5,6,12,14].\",\"The feature driven browser [14] is based on the ideas of feature location [6] and combines an interactive visual representation of features with its related source code entities within the Squeak IDE.\"],\"2886743082\":[\"Related research results have already emphasized the usefulness of examples and extensions to Integrated Development Environments (IDEs) for source code comprehension [5,6,12,14].\",\"In [5], for example, the author argues that unit tests can often be considered as usage examples for the units under test.\",\"Furthermore, research results described in [5] might be useful to filter and order the list of possible entry points according to relevance.\"]},\"PR\":[2767805857,2287526774,2113556945,2136296681,2726267606,2796354015,2154700201,2507745635,2900680198,2067436653,2329159417,2187080178,2003056571,2472431292,2099858487,2121234902,2148220468,1583876911,2741680762,2188760590,2767805857,2287526774,2113556945,2136296681,2726267606,2796354015,2154700201,2507745635,2900680198,2067436653,2329159417,2187080178,2003056571,2472431292,2099858487,2121234902,2148220468,1583876911,2741680762,2188760590],\"ANF\":[{\"FN\":\"Bastian\",\"LN\":\"Steinert\",\"S\":1},{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":2},{\"FN\":\"Martin\",\"LN\":\"Beck\",\"S\":3},{\"FN\":\"Jens\",\"LN\":\"Lincke\",\"S\":4},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":5}],\"BT\":\"a\"}"},{"logprob":-22.78,"Id":2232878766,"Ty":"0","Ti":"implementing record and refinement for debugging timing dependent communication","Pt":"1","L":"en","Y":2017,"D":"2017-02-01","CC":1,"ECC":1,"RId":[1973501242,2110908283,1652742168,2131056547,2162045655,2172147300,1574060188,2154698535,2105391037,1867761151,2040851906,1613865581,2144114063,2002985857,2040463770,2059385647,1965462925,2171581420,2782959840,2119636671,1507612039,1556513858,2138058557,2102075452,2111576674,2340164411,2783690368,2109820865,82576189,1774013863,2155848253,2103211722,1972151373,2065296680,2111708921,2105263737],"W":["communication","debugging","dependent","implementing","record","refinement","timing"],"AA":[{"DAuN":"Tim Felgentreff","AuN":"tim felgentreff","AuId":1964871710,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":1},{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":2},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":3}],"F":[{"DFN":"Source code","FN":"source code","FId":43126263},{"DFN":"Real-time computing","FN":"real time computing","FId":79403827},{"DFN":"Programming language","FN":"programming language","FId":199360897},{"DFN":"Distributed computing","FN":"distributed computing","FId":120314980},{"DFN":"Debugging","FN":"debugging","FId":168065819},{"DFN":"Debugger","FN":"debugger","FId":2778485113},{"DFN":"Computer science","FN":"computer science","FId":41008148},{"DFN":"Abstraction","FN":"abstraction","FId":124304363}],"J":{"JN":"scp","JId":21029587},"E":"{\"DN\":\"Implementing record and refinement for debugging timing-dependent communication\",\"IA\":{\"IndexLength\":171,\"InvertedIndex\":{\"Distributed\":[0],\"applications\":[1],\"are\":[2],\"hard\":[3],\"to\":[4,18,37,45,68,117,134,139,158,162],\"debug\":[5,19],\"because\":[6],\"timing-dependent\":[7,48],\"network\":[8,152,164,169],\"communication\":[9,49,142,165],\"is\":[10],\"a\":[11,51,89,94],\"source\":[12,149],\"of\":[13,54],\"non-deterministic\":[14,20,83,141],\"behavior.\":[15],\"Current\":[16],\"approaches\":[17,62],\"failures\":[21,84,116],\"include\":[22],\"post-mortem\":[23],\"debugging\":[24,109],\"as\":[25,27],\"well\":[26],\"record\":[28,140,163],\"and\":[29,121,143],\"replay.\":[30],\"However,\":[31],\"the\":[32,41,47,78,101,159],\"first\":[33],\"impairs\":[34],\"system\":[35],\"performance\":[36],\"gather\":[38,69],\"data,\":[39],\"whereas\":[40],\"latter\":[42],\"requires\":[43],\"developers\":[44,114],\"understand\":[46],\"at\":[50],\"lower\":[52],\"level\":[53],\"abstraction\":[55],\"than\":[56],\"they\":[57],\"develop\":[58],\"at.\":[59],\"Furthermore,\":[60],\"both\":[61],\"require\":[63],\"intrusive\":[64],\"core\":[65,160],\"library\":[66,161],\"modifications\":[67],\"data\":[70,124,146],\"from\":[71,115],\"live\":[72],\"systems.In\":[73],\"this\":[74],\"paper,\":[75],\"we\":[76,105,129,155],\"present\":[77,130],\"Peek-At-Talk\":[79],\"debugger\":[80],\"for\":[81],\"investigating\":[82],\"with\":[85,93,125,151],\"low\":[86,126],\"overhead\":[87],\"in\":[88,100],\"systematic,\":[90],\"top-down\":[91],\"method,\":[92],\"particular\":[95],\"focus\":[96],\"on\":[97],\"tool-building\":[98],\"issues\":[99],\"following\":[102],\"areas:\":[103],\"First,\":[104],\"show\":[106],\"how\":[107],\"our\":[108,135],\"framework\":[110,138],\"Path\":[111,136],\"Tools\":[112,137],\"guides\":[113],\"their\":[118],\"root\":[119],\"causes\":[120],\"gathers\":[122],\"run-time\":[123],\"overhead.\":[127],\"Second,\":[128],\"Peek-At-Talk,\":[131],\"an\":[132],\"extension\":[133],\"refine\":[144],\"behavioral\":[145],\"that\":[147],\"connects\":[148],\"code\":[150],\"events.\":[153],\"Finally,\":[154],\"scope\":[156],\"changes\":[157],\"without\":[166],\"impacting\":[167],\"other\":[168],\"applications.\":[170]}},\"S\":[{\"Ty\":1,\"U\":\"https://www.sciencedirect.com/science/article/pii/S0167642315003585\"},{\"Ty\":1,\"U\":\"https://dl.acm.org/citation.cfm?id=3032863\"},{\"Ty\":1,\"U\":\"http://dblp.uni-trier.de/db/journals/scp/scp134.html#FelgentreffPH17\"},{\"Ty\":0,\"U\":\"http://www.sciencedirect.com/science/article/pii/S0167642315003585\"},{\"Ty\":0,\"U\":\"http://dl.acm.org/citation.cfm?id=3032863\"}],\"VFN\":\"Science of Computer Programming\",\"V\":134,\"FP\":4,\"LP\":18,\"DOI\":\"10.1016/j.scico.2015.11.006\",\"PR\":[2169631150,1613865581,2045536068,2899875271,2319415934,1643342729,1819020107,2393771521,1581149108,139152171,1497765804,2015346614,2008445937,2543963479,2052097008,2139627310,2114289261,2142730110,1908489462,2580141483,2169631150,1613865581,2045536068,2899875271,2319415934,1643342729,1819020107,2393771521,1581149108,139152171,1497765804,2015346614,2008445937,2543963479,2052097008,2139627310,2114289261,2142730110,1908489462,2580141483],\"ANF\":[{\"FN\":\"Tim\",\"LN\":\"Felgentreff\",\"S\":1},{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":2},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":3}],\"BV\":\"Science of Computer Programming\",\"BT\":\"a\",\"PB\":\"Elsevier\"}"},{"logprob":-22.844,"Id":2015265939,"Ty":"0","Ti":"studying the advancement in debugging practice of professional software developers","Pt":"3","L":"en","Y":2014,"D":"2014-11-03","CC":1,"ECC":1,"RId":[2031648200,2162376048,2036196659,2166007208,2121081915,2123659430,1574060188,2113302524,1767990287,2156357889,2159949130,2010825534,1673079227,1968847337,2132383311,2141109493,1993199499,2137270184,1843474218,2118529754,2127961981,2145064897,2109681145,2000711964,2170485025,2146146233,1572075820,1960390258,2092239677,2155788121,1774013863,1989678938,2147045401,2794372210,1644965812,2798692074,1502739415,107792539,1544344128,151007792],"W":["advancement","debugging","developers","practice","professional","software","studying"],"AA":[{"DAuN":"Benjamin Siegmund","AuN":"benjamin siegmund","AuId":2107713863,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":1},{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"SAP Innovation Center, Potsdam, Germany","S":2},{"DAuN":"Marcel Taeumel","AuN":"marcel taeumel","AuId":83004794,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":3},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":4}],"F":[{"DFN":"Software engineering","FN":"software engineering","FId":115903868},{"DFN":"Software","FN":"software","FId":2777904410},{"DFN":"Program comprehension","FN":"program comprehension","FId":2777561058},{"DFN":"Empirical research","FN":"empirical research","FId":120936955},{"DFN":"Debugging","FN":"debugging","FId":168065819},{"DFN":"Computer science","FN":"computer science","FId":41008148},{"DFN":"Computer engineering","FN":"computer engineering","FId":113775141},{"DFN":"Algorithmic program debugging","FN":"algorithmic program debugging","FId":136388014}],"C":{"CN":"issre","CId":1157832733},"CI":{"CIN":"issre 2014","CIId":173259484},"E":"{\"DN\":\"Studying the Advancement in Debugging Practice of Professional Software Developers\",\"IA\":{\"IndexLength\":150,\"InvertedIndex\":{\"In\":[0],\"1997,\":[1],\"Henry\":[2],\"Lieberman\":[3],\"stated\":[4],\"that\":[5,67,117,141],\"debugging\":[6,19,41,75,102,127,139],\"is\":[7,42,52],\"the\":[8,34,38,71,84,121],\"dirty\":[9],\"little\":[10],\"secret\":[11],\"of\":[12,74],\"computer\":[13],\"science.\":[14],\"Since\":[15],\"then,\":[16],\"several\":[17,98],\"promising\":[18],\"technologies\":[20],\"have\":[21,59],\"been\":[22,60],\"developed\":[23],\"such\":[24],\"as\":[25,120],\"back-in-time\":[26],\"debuggers\":[27],\"and\":[28,49,87,92,103],\"automatic\":[29],\"fault\":[30],\"localization\":[31],\"methods.\":[32],\"However,\":[33],\"last\":[35],\"study\":[36,93],\"about\":[37,89,106],\"state-of-the-art\":[39],\"in\":[40,62,76],\"still\":[43],\"more\":[44],\"than\":[45],\"15\":[46],\"years\":[47],\"old\":[48],\"so\":[50],\"it\":[51],\"not\":[53],\"clear\":[54],\"whether\":[55],\"these\":[56,111,132],\"new\":[57,78,136,145],\"approaches\":[58,91],\"applied\":[61],\"practice\":[63,140],\"or\":[64],\"not.\":[65],\"For\":[66],\"reason,\":[68],\"we\":[69,82,96,113,134],\"investigate\":[70],\"current\":[72,90],\"state\":[73],\"a\":[77,115,124],\"comprehensive\":[79],\"study.\":[80],\"First,\":[81],\"review\":[83],\"available\":[85],\"literature\":[86],\"learn\":[88],\"results.\":[94],\"Second,\":[95],\"observe\":[97],\"professional\":[99],\"developers\":[100],\"while\":[101],\"interview\":[104],\"them\":[105],\"their\":[107],\"experiences.\":[108],\"Based\":[109],\"on\":[110],\"results,\":[112,133],\"create\":[114],\"questionnaire\":[116],\"should\":[118],\"serve\":[119],\"basis\":[122],\"for\":[123,147],\"large-scale\":[125],\"online\":[126],\"survey\":[128],\"later\":[129],\"on.\":[130],\"With\":[131],\"expect\":[135],\"insights\":[137],\"into\":[138],\"help\":[142],\"to\":[143],\"suggest\":[144],\"directions\":[146],\"future\":[148],\"research.\":[149]}},\"S\":[{\"Ty\":3,\"U\":\"http://doi.ieeecomputersociety.org/10.1109/ISSREW.2014.36\"},{\"Ty\":1,\"U\":\"https://link.springer.com/article/10.1007/s11219-015-9294-2\"},{\"Ty\":1,\"U\":\"http://dblp.uni-trier.de/db/conf/issre/issre2014w.html#SiegmundPTH14\"},{\"Ty\":1,\"U\":\"http://dl.acm.org/citation.cfm?id=2706272\"}],\"VFN\":\"International Symposium on Software Reliability Engineering\",\"VSN\":\"ISSRE\",\"FP\":269,\"LP\":274,\"DOI\":\"10.1109/ISSREW.2014.36\",\"CC\":{\"107792539\":[\"” [7].\"],\"1502739415\":[\"The earliest studies trying to understand how debugging works date as far back as 1974 [3].\",\"Gould and Drongowski [3] conducted a lab study with 30 participants.\"],\"1843474218\":[\"For example, there have been multiple approaches to automate parts of the fault localization process [23]–[40], a categorization and overview can be found in [10].\"],\"1960390258\":[\"“Debugging is twice as hard as writing the program in the first place” [1].\"],\"1989678938\":[\"A year later, the same authors studied developers equipped with a symbolic debugger [11].\"],\"2000711964\":[\"In 1997, Eisenstadt [14] collected 59 bug anecdotes from experts and proposed a three dimensional classification of bug stories:\",\"However, to the best of our knowledge, the latest general purpose debugging study amongst professional software developers is more than 15 years old [14].\",\"We ask them to position it in all three dimensions of a bug war story Eisenstadt [14] defined: The type of the bug, why it was especially hard to debug, and what technique turned out to be most helpful to find it.\"],\"2092239677\":[\"In 1985, Vessey found evidence that programming experts and novices differ in their debugging strategies [13].\"],\"2132383311\":[\"Since 2000, many researchers have tried to improve the understanding of specific aspects of debugging [9], [15]–[22], but these focus mostly on the introduction of new tools or how debugging can be taught to students.\"],\"2141109493\":[\"In 1982, Weiser introduced the notion of program slicing [12].\"],\"2156357889\":[\"For example, there have been multiple approaches to automate parts of the fault localization process [23]–[40], a categorization and overview can be found in [10].\"],\"2794372210\":[\"In the following years, debugging tools have been improved and the lack of knowledge has been tackled [2], [4]–[6].\",\"“Debugging: The 9 Indispensable Rules for Finding Even the Most Elusive Software and Hardware Problems” [6] was one of the first general purpose debugging books.\"],\"2798692074\":[\"“Debugging by Thinking” [5] relates debugging with other domains of problem solving and tries to apply their methods.\"]},\"PR\":[2069592207,2803318815,2128288368,293185363,1975205392,1544966256,1993978434,1996631623,603019370,2137440139,2100406974,2070712617,2890502052,150374354,1605945674,2514084604,2606310092,2605175330,2160423649,2112350673,2069592207,2803318815,2128288368,293185363,1975205392,1544966256,1993978434,1996631623,603019370,2137440139,2100406974,2070712617,2890502052,150374354,1605945674,2514084604,2606310092,2605175330,2160423649,2112350673],\"ANF\":[{\"FN\":\"Benjamin\",\"LN\":\"Siegmund\",\"S\":1},{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":2},{\"FN\":\"Marcel\",\"LN\":\"Taeumel\",\"S\":3},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":4}],\"BV\":\"ISSREW '14 Proceedings of the 2014 IEEE International Symposium on Software Reliability Engineering Workshops\",\"BT\":\"p\",\"PB\":\"IEEE\"}"},{"logprob":-23.54,"Id":2021886098,"Ty":"0","Ti":"orca a single language web framework for collaborative development","Pt":"3","L":"en","Y":2012,"D":"2012-01-01","CC":0,"ECC":0,"RId":[1489021242,2105842205,2104594675,2062340141,2172147300,2129596343,2156010380,2141221569,298537040,2015092863,2103668392,1964757858,2401896594,2119945887,1998943057,1973788482,2001668586,2112318835,2166901142,2012047726,2506518909,2006987669,1984027169,2066031375,2075188242],"W":["collaborative","development","framework","language","orca","single","web"],"AA":[{"DAuN":"Lauritz Thamsen","AuN":"lauritz thamsen","AuId":2228463212,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":1},{"DAuN":"Anton Gulenko","AuN":"anton gulenko","AuId":2543263647,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":2},{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":3},{"DAuN":"Robert Krahn","AuN":"robert krahn","AuId":1836152203,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":4},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"DAfN":"Hasso Plattner Institute","AfN":"hasso plattner institute","AfId":143288331,"S":5},{"DAuN":"David A. Thomas","AuN":"david a thomas","AuId":2433774774,"DAfN":"Bedarra Res. Labs., ON, Canada","S":6}],"F":[{"DFN":"World Wide Web","FN":"world wide web","FId":136764020},{"DFN":"Web page","FN":"web page","FId":21959979},{"DFN":"Web modeling","FN":"web modeling","FId":130436687},{"DFN":"Web engineering","FN":"web engineering","FId":97200028},{"DFN":"Web development","FN":"web development","FId":79373723},{"DFN":"Web design","FN":"web design","FId":521306242},{"DFN":"Web application","FN":"web application","FId":118643609},{"DFN":"Interactive programming","FN":"interactive programming","FId":2779125210},{"DFN":"Hypertext Transfer Protocol","FN":"hypertext transfer protocol","FId":149672775},{"DFN":"Human–computer interaction","FN":"human computer interaction","FId":107457646},{"DFN":"Computer science","FN":"computer science","FId":41008148}],"C":{"CN":"c5","CId":1201766282},"CI":{"CIN":"c5 2012","CIId":98471374},"E":"{\"DN\":\"Orca: A Single-Language Web Framework for Collaborative Development\",\"IA\":{\"IndexLength\":161,\"InvertedIndex\":{\"In\":[0,33],\"the\":[1,5,24,35,38,41,47,79,93,113,148,156],\"last\":[2],\"few\":[3,73],\"years,\":[4],\"Web\":[6,18,25,88,159],\"has\":[7,26],\"been\":[8,27],\"established\":[9],\"as\":[10],\"a\":[11,72,106,123,129],\"platform\":[12],\"for\":[13],\"interactive\":[14],\"applications.\":[15],\"However,\":[16],\"creating\":[17],\"applications\":[19,104],\"involves\":[20],\"numerous\":[21],\"challenges\":[22],\"since\":[23],\"created\":[28],\"to\":[29,54,99,119],\"serve\":[30],\"static\":[31],\"content.\":[32],\"particular,\":[34],\"separation\":[36],\"of\":[37,74,82,150,158],\"client-\":[39,139],\"and\":[40,63,122,136,140,147],\"server-side,\":[42],\"being\":[43],\"only\":[44],\"connected\":[45],\"through\":[46],\"unidirectional\":[48],\"Hypertext\":[49],\"Transfer\":[50],\"Protocol,\":[51],\"forces\":[52],\"developers\":[53,98],\"apply\":[55],\"two\":[56],\"programming\":[57,109,115],\"languages\":[58],\"including\":[59],\"different\":[60],\"libraries,\":[61,121],\"conventions,\":[62],\"tools.\":[64],\"Developers\":[65],\"create\":[66],\"expert\":[67,145],\"knowledge\":[68,81,146],\"by\":[69],\"specializing\":[70],\"on\":[71,102,112],\"all\":[75],\"involved\":[76],\"technologies.\":[77],\"Consequently,\":[78],\"diverse\":[80],\"team\":[83],\"members\":[84],\"makes\":[85],\"collaboration\":[86,157],\"in\":[87,105,138],\"development\":[89,151],\"laboriously.\":[90],\"We\":[91],\"present\":[92],\"Orca\":[94,127],\"framework\":[95],\"that\":[96,132],\"allows\":[97],\"work\":[100],\"collaboratively\":[101],\"client-server\":[103],\"single\":[107],\"object-oriented\":[108],\"language.\":[110],\"Based\":[111],\"Smalltalk\":[114],\"language,\":[116],\"full\":[117],\"access\":[118],\"existing\":[120],\"bidirectional\":[124],\"messaging\":[125],\"abstraction,\":[126],\"provides\":[128],\"consistent\":[130],\"environment\":[131],\"supports\":[133],\"common\":[134],\"idioms\":[135],\"patterns\":[137],\"server-side\":[141],\"code.\":[142],\"It\":[143],\"reduces\":[144],\"number\":[149],\"tools\":[152],\"and,\":[153],\"thus,\":[154],\"facilitates\":[155],\"developers.\":[160]}},\"S\":[{\"Ty\":3,\"U\":\"http://www.hirschfeld.org/writings/media/ThamsenGulenkoPerscheidKrahnHirschfeldThomas_2012_OrcaASingleLanguageWebFrameworkForCollaborativeDevelopment_IEEE.pdf\"},{\"Ty\":3,\"U\":\"http://www.cm.is.ritsumei.ac.jp/c5-12/proc/papers/thamsen-et-al-C5-12_7.pdf\"},{\"Ty\":1,\"U\":\"http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000006195221\"},{\"Ty\":1,\"U\":\"http://ieeexplore.ieee.org/document/6195221/\"},{\"Ty\":1,\"U\":\"https://www.semanticscholar.org/paper/Orca%3A-A-Single-Language-Web-Framework-for-Thamsen-Gulenko/2b46e330fbbdf5c700d9f9625af285dae0600833\"}],\"VFN\":\"Conference on Creating, Connecting and Collaborating through Computing\",\"VSN\":\"C5\",\"FP\":45,\"LP\":52,\"DOI\":\"10.1109/C5.2012.9\",\"CC\":{\"1964757858\":[\"The Morphic user interface environment [25] and the absence of separation between design-time and run-time allow rapid application development through direct composition and immediate feedback, while its wiki-like deployment [26] supports collaborative development efforts.\"],\"1973788482\":[\"Orca implements transparent message passing as in Distributed Smalltalk [14] to allow code to invoke local and remote methods.\"],\"1984027169\":[\"3) HOP: The HOP programming language [21] is a Scheme-dialect for developing multimedia Web applications.\"],\"1998943057\":[\"This is important since executing logic on client-side can increase interface responsiveness and reduce network reliance [13].\"],\"2001668586\":[\"1) Server-centric Web Frameworks: Numerous Web frameworks support the development of database-driven, servercentric Web applications [18].\"],\"2006987669\":[\"5) Lively Kernel: The Lively Kernel [24] is an open and self-supporting JavaScript environment that runs completely in the browser.\"],\"2012047726\":[\"We could apply similar techniques as used by optimizing compilers of polymorphic code [16].\"],\"2015092863\":[\"First, the chosen application demonstrates all aspects of a typical Web application as it is interactive and collaborative [9].\"],\"2062340141\":[\"7) Native Client: Native Client [29] is a sandbox for multithreaded execution of untrusted x86 native code in browsers.\"],\"2066031375\":[\"In the future, we will reduce the performance penalties through the proposed optimizations and will experiment with different type analysis tools such as TypeHarvester [17].\"],\"2075188242\":[\"To measure the performance of the generated code, we implemented the ackermann(3, 4) [15] function with Orca and compared its execution time to that of native JavaScript.\"],\"2103668392\":[\"clients run self-supporting systems and display interactive user interfaces [2], and polling idioms allow servers to send data spontaneously to clients [3].\"],\"2104594675\":[\"js [27], the client-side and the server-side are less integrated than their counterparts in Orca.\"],\"2112318835\":[\"since there is no broadly established way to expose Web application interfaces without exposing implementation details [4].\"],\"2119945887\":[\"Such frameworks as, for example, Ruby on Rails, Django, and Seaside [19] run on the server-side and generate HTML for the browser.\"],\"2129596343\":[\"If developers write JavaScript by hand, they can accidentally inject security threats [8].\"],\"2156010380\":[\"Although using multiple languages can alleviate programming of applications if specific languages are chosen for their eligibility as, for example, Domain Specific Languages (DSLs), the languages of the Web are either general purpose as JavaScript or no longer applied as originally intended as HTML and CSS [12].\"],\"2166901142\":[\"low rapid application development through direct composition and immediate feedback, while its wiki-like deployment [26] supports collaborative development efforts.\"],\"2172147300\":[\"Our Smalltalk/Squeak [6] implementation automatically translates client-side parts of the Web application into readable JavaScript code.\"],\"2401896594\":[\"HOP provides a Scheme-to-JavaScript compiler [22], syntax to escape inline between both strata, and bidirectional communication through an event loop and remote function invocation.\"]},\"PR\":[2170769459,2171035719,68907256,2095300834,2131050047,1968141708,2259749548,206813859,2241911998,1536133276,2138776225,2011903900,2056515551,2272366041,2752385779,1499896328,1582367319,2045750587,2157371698,810714860,2170769459,2171035719,68907256,2095300834,2131050047,1968141708,2259749548,206813859,2241911998,1536133276,2138776225,2011903900,2056515551,2272366041,2752385779,1499896328,1582367319,2045750587,2157371698,810714860],\"ANF\":[{\"FN\":\"Lauritz\",\"LN\":\"Thamsen\",\"S\":1},{\"FN\":\"Anton\",\"LN\":\"Gulenko\",\"S\":2},{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":3},{\"FN\":\"Robert\",\"LN\":\"Krahn\",\"S\":4},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":5},{\"FN\":\"David A.\",\"LN\":\"Thomas\",\"S\":6}],\"BV\":\"2012 10th International Conference on Creating, Connecting and Collaborating through Computing\",\"BT\":\"p\",\"PB\":\"IEEE\"}"},{"logprob":-23.969,"Id":162129185,"Ty":"0","Ti":"populaid in memory test data generation","Pt":"0","L":"en","Y":2014,"D":"2014-08-05","CC":0,"ECC":0,"RId":[2141499038,1544148736,2038552970,1506075075,2294546257,2082323325,206771271],"W":["data","generation","memory","populaid","test"],"AA":[{"DAuN":"Ralf Teusner","AuN":"ralf teusner","AuId":1971313364,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":1},{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"SAP Innovation Center","S":2},{"DAuN":"Malte Appeltauer","AuN":"malte appeltauer","AuId":135591984,"DAfN":"SAP Innovation Center","S":3},{"DAuN":"Jonas Enderlein","AuN":"jonas enderlein","AuId":2165840458,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":4},{"DAuN":"Thomas Klingbeil","AuN":"thomas klingbeil","AuId":212836417,"DAfN":"SAP Innovation Center","S":5},{"DAuN":"Michael Kusber","AuN":"michael kusber","AuId":653492364,"DAfN":"SAP Innovation Center","S":6}],"F":[{"DFN":"restrict","FN":"restrict","FId":2779521362},{"DFN":"Test data generation","FN":"test data generation","FId":47980962},{"DFN":"Test data","FN":"test data","FId":16910744},{"DFN":"Software development","FN":"software development","FId":529173508},{"DFN":"Scalability","FN":"scalability","FId":48044578},{"DFN":"Legal policies","FN":"legal policies","FId":2909724172},{"DFN":"Information sensitivity","FN":"information sensitivity","FId":137822555},{"DFN":"In-memory database","FN":"in memory database","FId":2779613562},{"DFN":"Database","FN":"database","FId":77088390},{"DFN":"Computer science","FN":"computer science","FId":41008148}],"E":"{\"DN\":\"PopulAid: In-Memory Test Data Generation\",\"IA\":{\"IndexLength\":76,\"InvertedIndex\":{\"During\":[0],\"software\":[1],\"development,\":[2],\"it\":[3],\"is\":[4],\"often\":[5,25],\"necessary\":[6],\"to\":[7,14,28,37,55],\"access\":[8,27],\"real\":[9,33],\"customer\":[10],\"data\":[11,44,71],\"in\":[12],\"order\":[13],\"validate\":[15],\"requirements\":[16],\"and\":[17,22,58],\"performance\":[18],\"thoroughly.\":[19],\"However,\":[20],\"company\":[21],\"legal\":[23],\"policies\":[24],\"restrict\":[26],\"such\":[29],\"sensitive\":[30],\"information.\":[31],\"Without\":[32],\"data,\":[34],\"developers\":[35],\"have\":[36],\"either\":[38],\"create\":[39],\"their\":[40],\"own\":[41],\"customized\":[42],\"test\":[43],\"manually\":[45],\"or\":[46],\"rely\":[47],\"on\":[48],\"standardized\":[49],\"benchmarks.\":[50],\"While\":[51],\"the\":[52,61,69],\"first\":[53],\"tends\":[54],\"lack\":[56],\"scalability\":[57],\"edge\":[59],\"cases,\":[60],\"latter\":[62],\"solves\":[63],\"these\":[64],\"issues\":[65],\"but\":[66],\"cannot\":[67],\"reflect\":[68],\"productive\":[70],\"distributions\":[72],\"of\":[73],\"a\":[74],\"company.\":[75]}},\"S\":[{\"Ty\":3,\"U\":\"https://link.springer.com/content/pdf/10.1007%2F978-3-319-20233-4_10.pdf\"},{\"Ty\":3,\"U\":\"https://rd.springer.com/content/pdf/10.1007%2F978-3-319-20233-4_10.pdf\"},{\"Ty\":1,\"U\":\"https://link.springer.com/chapter/10.1007%2F978-3-319-20233-4_10\"}],\"VFN\":\"Workshop on Big Data Benchmarks\",\"FP\":101,\"LP\":108,\"DOI\":\"10.1007/978-3-319-20233-4_10\",\"PR\":[1987785403,175221152,1555823722,1538469196,624366154,2183930450,2621021030,2007002790,2309069030,2888937027,1931705586,2575198900,2791947637,2890951016,2124819012,87526489,1579107606,1485400967,1481755037,2801169824,1987785403,175221152,1555823722,1538469196,624366154,2183930450,2621021030,2007002790,2309069030,2888937027,1931705586,2575198900,2791947637,2890951016,2124819012,87526489,1579107606,1485400967,1481755037,2801169824],\"ANF\":[{\"FN\":\"Ralf\",\"LN\":\"Teusner\",\"S\":1},{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":2},{\"FN\":\"Malte\",\"LN\":\"Appeltauer\",\"S\":3},{\"FN\":\"Jonas\",\"LN\":\"Enderlein\",\"S\":4},{\"FN\":\"Thomas\",\"LN\":\"Klingbeil\",\"S\":5},{\"FN\":\"Michael\",\"LN\":\"Kusber\",\"S\":6}],\"BV\":\"Workshop on Big Data Benchmarks\",\"BT\":\"a\",\"PB\":\"Springer International Publishing\"}"},{"logprob":-24.1,"Id":41567778,"Ty":"0","Ti":"tours and traps complex software with simple tools in time","Pt":"0","Y":2007,"D":"2007-01-01","CC":0,"ECC":0,"W":["complex","simple","software","time","tools","tours","traps"],"AA":[{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"S":1},{"DAuN":"Michael Haupt","AuN":"michael haupt","AuId":2146662369,"S":2},{"DAuN":"Peter Osburg","AuN":"peter osburg","AuId":319726736,"S":3},{"DAuN":"MichaelPerscheid","AuN":"michaelperscheid","AuId":231534572,"S":4},{"DAuN":"Martin Beck","AuN":"martin beck","AuId":2309158709,"S":5},{"DAuN":"Stefan Berger","AuN":"stefan berger","AuId":2423549385,"S":6},{"DAuN":"Gregor Gabrysiak","AuN":"gregor gabrysiak","AuId":688069449,"S":7},{"DAuN":"Thomas Kowark","AuN":"thomas kowark","AuId":2307272893,"S":8},{"DAuN":"Dominic Letz","AuN":"dominic letz","AuId":1972621547,"S":9},{"DAuN":"David Tibbe","AuN":"david tibbe","AuId":273462452,"S":10},{"DAuN":"Matthias Wagner","AuN":"matthias wagner","AuId":2121224653,"S":11},{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"S":12}],"F":[{"DFN":"User interface","FN":"user interface","FId":89505385},{"DFN":"Software","FN":"software","FId":2777904410},{"DFN":"Smalltalk","FN":"smalltalk","FId":2777293101},{"DFN":"Point of interest","FN":"point of interest","FId":150140777},{"DFN":"Mobile search","FN":"mobile search","FId":40161942},{"DFN":"Mobile phone","FN":"mobile phone","FId":2777421447},{"DFN":"Human–computer interaction","FN":"human computer interaction","FId":107457646},{"DFN":"Extreme programming","FN":"extreme programming","FId":122944926},{"DFN":"Computer science","FN":"computer science","FId":41008148},{"DFN":"Agile software development","FN":"agile software development","FId":14185376}],"E":"{\"DN\":\"Tours and Traps---Complex Software, with Simple Tools, in Time\",\"VFN\":\"\",\"PR\":[2000153354,2109492515,2022317205,1567954893,2293045535,2752571941,1487633427,2136451454,2045048480,2066312303,2130925385,2019209746,2012417496,1988554626,2164555494,2004851609,2043405143,122441201,2565797821,2893951783,2000153354,2109492515,2022317205,1567954893,2293045535,2752571941,1487633427,2136451454,2045048480,2066312303,2130925385,2019209746,2012417496,1988554626,2164555494,2004851609,2043405143,122441201,2565797821,2893951783],\"ANF\":[{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":1},{\"FN\":\"Michael\",\"LN\":\"Haupt\",\"S\":2},{\"FN\":\"Peter\",\"LN\":\"Osburg\",\"S\":3},{\"FN\":\"\",\"LN\":\"MichaelPerscheid\",\"S\":4},{\"FN\":\"Martin\",\"LN\":\"Beck\",\"S\":5},{\"FN\":\"Stefan\",\"LN\":\"Berger\",\"S\":6},{\"FN\":\"Gregor\",\"LN\":\"Gabrysiak\",\"S\":7},{\"FN\":\"Thomas\",\"LN\":\"Kowark\",\"S\":8},{\"FN\":\"Dominic\",\"LN\":\"Letz\",\"S\":9},{\"FN\":\"David\",\"LN\":\"Tibbe\",\"S\":10},{\"FN\":\"Matthias\",\"LN\":\"Wagner\",\"S\":11},{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":12}],\"BT\":\"a\"}"},{"logprob":-24.182,"Id":156232669,"Ty":"0","Ti":"1 1 dynamic service analysis test driven views for enhancing software maintenance","Pt":"0","Y":2011,"D":"2011-01-01","CC":0,"ECC":0,"W":["1","driven","dynamic","enhancing","maintenance","service","software","test","views"],"AA":[{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":1}],"F":[{"DFN":"Test case","FN":"test case","FId":128942645},{"DFN":"Systems engineering","FN":"systems engineering","FId":201995342},{"DFN":"Software verification and validation","FN":"verification and validation","FId":161743704},{"DFN":"Software system","FN":"software system","FId":149091818},{"DFN":"Software peer review","FN":"software peer review","FId":74579156},{"DFN":"Software development","FN":"software development","FId":529173508},{"DFN":"Software construction","FN":"software construction","FId":186846655},{"DFN":"Program comprehension","FN":"program comprehension","FId":2777561058},{"DFN":"Package development process","FN":"package development process","FId":123551368},{"DFN":"Computer science","FN":"computer science","FId":41008148}],"E":"{\"DN\":\"1.1 Dynamic Service Analysis: Test-Driven Views for Enhancing Software Maintenance\",\"IA\":{\"IndexLength\":368,\"InvertedIndex\":{\"Although\":[0],\"service\":[1],\"implementations\":[2],\"spend\":[3],\"most\":[4,12],\"of\":[5,41,71,96,109,161,179,218,251,324,344],\"their\":[6,42],\"life\":[7],\"time\":[8,43,269],\"in\":[9,33,104,268,355],\"software\":[10,102,153,171,184,225],\"maintenance,\":[11],\"practices,\":[13],\"artifacts,\":[14],\"and\":[15,29,83,101,175,201,216,230,271,298,342,361],\"tools\":[16],\"slightly\":[17],\"support\":[18,183,336],\"this\":[19,110],\"phase.\":[20],\"Typical\":[21],\"activities\":[22,155,186],\"include\":[23],\"fixing\":[24],\"bugs,\":[25],\"adding\":[26,278],\"new\":[27,273,283],\"features,\":[28,279],\"assuring\":[30],\"quality\":[31,226],\"but\":[32,123,332],\"fact\":[34],\"developers\":[35,211,240,315],\"require\":[36],\"more\":[37],\"than\":[38],\"50\":[39],\"%\":[40],\"for\":[44,98,244,364],\"understanding\":[45],\"a\":[46,272,282,310,356],\"possibly\":[47],\"unknown\":[48],\"system.\":[49],\"For\":[50,208,277,348],\"supporting\":[51,365],\"program\":[52,99,180,209],\"comprehension,\":[53,210],\"they\":[54],\"rely\":[55],\"primarily\":[56],\"on\":[57,170,203],\"external\":[58],\"documentation,\":[59],\"former\":[60],\"developers,\":[61],\"source\":[62,78,95],\"code\":[63,79],\"or\":[64,247],\"tests.\":[65,294],\"Unfortunately,\":[66],\"documentation\":[67,122],\"is\":[68,80,193,254],\"often\":[69],\"out\":[70],\"date,\":[72],\"previous\":[73],\"stakeholders\":[74],\"have\":[75],\"forgotten\":[76],\"details,\":[77],\"laboriously\":[81],\"readable\":[82],\"test\":[84,90,114,162,345],\"cases\":[85,91,115],\"only\":[86,117],\"verify\":[87],\"functionality.\":[88],\"However,\":[89],\"are\":[92,306],\"an\":[93],\"underestimated\":[94],\"information\":[97,354],\"comprehension\":[100],\"maintenance\":[103,154,185],\"general.\":[105],\"Within\":[106],\"the\":[107,133,137,158,197,219,234,318,321],\"scope\":[108],\"work,\":[111],\"we\":[112,150,280,305,335,350],\"consider\":[113],\"not\":[116,333],\"as\":[118,125,146],\"never\":[119],\"outdated\":[120],\"interface\":[121],\"rather\":[124],\"entry\":[126],\"points\":[127],\"into\":[128,196,300],\"behavior\":[129,215,343],\"which\":[130],\"reveal\":[131],\"how\":[132],\"system\":[134,220,319],\"works.\":[135],\"Thus,\":[136,314],\"question\":[138],\"that\":[139,261,287],\"leads\":[140],\"our\":[141,188,257],\"research\":[142],\"can\":[143,149,212,316],\"be\":[144],\"stated\":[145],\"follows:\":[147],\"How\":[148],\"enhance\":[151],\"typical\":[152],\"by\":[156,173,187,227,256,338],\"considering\":[157],\"hidden\":[159],\"knowledge\":[160],\"case\":[163,346],\"behavior?\":[164],\"We\":[165,182,223],\"investigate\":[166],\"various\":[167],\"test-driven\":[168,258],\"views\":[169],\"systems\":[172],\"observing\":[174],\"enriching\":[176],\"concrete\":[177],\"examples\":[178],\"executions.\":[181,347],\"Path\":[189],\"tool\":[190],\"suite.\":[191],\"It\":[192],\"seamlessly\":[194],\"integrated\":[195],\"Squeak/Smalltalk\":[198],\"development\":[199],\"environment\":[200],\"based\":[202],\"elaborated\":[204],\"dynamic\":[205,231],\"analysis\":[206],\"techniques.\":[207],\"introspect\":[213],\"exemplified\":[214],\"state\":[217,341],\"under\":[221],\"test.\":[222],\"ensure\":[224],\"merging\":[228],\"static\":[229],\"metrics\":[232],\"at\":[233],\"architectural\":[235],\"level.\":[236],\"New\":[237],\"perspectives\":[238],\"guide\":[239],\"to\":[241,308],\"potential\":[242],\"locations\":[243],\"caching,\":[245],\"refactoring,\":[246],\"unused\":[248],\"methods.\":[249],\"Debugging\":[250],\"reproducible\":[252],\"failures\":[253],\"simplified\":[255],\"fault\":[259,264],\"navigation\":[260],\"combines\":[262,288],\"spectrum-based\":[263],\"localization\":[265,290],\"with\":[266,292],\"back\":[267],\"debugging\":[270],\"developer\":[274],\"ranking\":[275],\"metric.\":[276],\"propose\":[281],\"requirements\":[284,299],\"traceability\":[285],\"approach\":[286],\"feature\":[289],\"techniques\":[291],\"acceptance\":[293],\"By\":[295],\"unifying\":[296],\"tests\":[297],\"one\":[301],\"first\":[302],\"class\":[303],\"entity,\":[304],\"able\":[307],\"offer\":[309],\"completely\":[311],\"automatic\":[312],\"approach.\":[313],\"comprehend\":[317],\"from\":[320],\"user’s\":[322],\"point\":[323],\"view\":[325],\"without\":[326],\"creating\":[327],\"any\":[328],\"manual\":[329],\"link.\":[330],\"Last\":[331],\"least,\":[334],\"verification\":[337],\"generalizing\":[339],\"sane\":[340],\"instance,\":[349],\"harvest\":[351],\"run-time\":[352],\"type\":[353],\"dynamically\":[357],\"typed\":[358],\"programming\":[359],\"language\":[360],\"abstract\":[362],\"it\":[363],\"implementation\":[366],\"tasks.\":[367]}},\"VFN\":\"\",\"PR\":[2164242361,2384942976,16315887,2012845894,2153415988,1982290510,2171489187,2032482654,51199295,2151755507,2140909864,2129438119,2136025314,2100590412,2385249134,2115885958,2071833968,2068000224,2148814440,2160841549,2164242361,2384942976,16315887,2012845894,2153415988,1982290510,2171489187,2032482654,51199295,2151755507,2140909864,2129438119,2136025314,2100590412,2385249134,2115885958,2071833968,2068000224,2148814440,2160841549],\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":1}],\"BT\":\"a\"}"},{"logprob":-24.285,"Id":2182059493,"Ty":"0","Ti":"a practical approach to obtaining typing information in dynamic programming languages","Pt":"0","Y":2011,"D":"2011-01-01","CC":0,"ECC":0,"RId":[2148357053,2172147300,1574060188,2135536553,2058213389,2093334386,2031627901,2165046128,2170311191,2149539713,2048486205,2120363698,2133468633,1577728776,2053664570,2088772524,2138732532,1513058800,2091556182,1580606833],"W":["approach","dynamic","information","languages","obtaining","practical","programming","typing"],"AA":[{"DAuN":"Michael Haupt","AuN":"michael haupt","AuId":2146662369,"S":1},{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"S":2},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"S":3}],"F":[{"DFN":"Unit testing","FN":"unit testing","FId":148027188},{"DFN":"Type system","FN":"type system","FId":20740285},{"DFN":"Type inference","FN":"type inference","FId":198370458},{"DFN":"Theoretical computer science","FN":"theoretical computer science","FId":80444323},{"DFN":"Software development","FN":"software development","FId":529173508},{"DFN":"Program comprehension","FN":"program comprehension","FId":2777561058},{"DFN":"Data type","FN":"data type","FId":138958017},{"DFN":"Computer science","FN":"computer science","FId":41008148},{"DFN":"Complex data type","FN":"complex data type","FId":35288925},{"DFN":"Code generation","FN":"code generation","FId":133162039}],"E":"{\"DN\":\"A Practical Approach to Obtaining Typing Information in Dynamic Programming Languages\",\"IA\":{\"IndexLength\":132,\"InvertedIndex\":{\"Dynamically\":[0],\"typed\":[1],\"programming\":[2],\"languages\":[3,39],\"are\":[4,13],\"powerful\":[5],\"tools\":[6],\"for\":[7,96,105],\"rapid\":[8],\"software\":[9],\"development.\":[10],\"However,\":[11],\"there\":[12],\"scenarios\":[14],\"that\":[15,123],\"would\":[16],\"benet\":[17],\"from\":[18],\"actual\":[19],\"type\":[20,49,64,71,103,124],\"information\":[21,104],\"being\":[22],\"available|e.\":[23],\"g.,\":[24],\"code\":[25,35,78,82,107],\"generation\":[26],\"and\":[27],\"optimisation\":[28],\"as\":[29,31],\"well\":[30,54],\"program\":[32],\"comprehension.\":[33],\"Since\":[34],\"written\":[36],\"in\":[37,83,91,114],\"such\":[38],\"usually\":[40],\"makes\":[41],\"little\":[42],\"or\":[43],\"no\":[44],\"explicit\":[45],\"assumptions\":[46],\"about\":[47],\"types,\":[48],\"inference\":[50],\"is\":[51,74],\"not\":[52],\"particularly\":[53],\"suited\":[55],\"to\":[56,69,100],\"obtain\":[57,102],\"the\":[58,81,87],\"desired\":[59],\"information.\":[60,72],\"This\":[61],\"paper\":[62],\"introduces\":[63],\"harvesting,\":[65],\"a\":[66,106],\"practical\":[67],\"approach\":[68,110],\"obtaining\":[70],\"It\":[73],\"based\":[75],\"on\":[76],\"stepwise\":[77],\"execution\":[79],\"of\":[80,89],\"question,\":[84],\"closely\":[85],\"observing\":[86],\"types\":[88],\"entities\":[90],\"question.\":[92],\"Type\":[93],\"harvesting\":[94,125],\"allows\":[95],\"exploiting\":[97],\"unit\":[98],\"tests\":[99],\"automatically\":[101],\"base.\":[108],\"The\":[109],\"has\":[111],\"been\":[112],\"implemented\":[113],\"Squeak/Smalltalk.\":[115],\"Its\":[116],\"evaluation,\":[117],\"using\":[118],\"several\":[119],\"complex\":[120],\"applications,\":[121],\"shows\":[122],\"yields\":[126],\"excellent\":[127],\"results\":[128],\"with\":[129],\"high\":[130],\"precision.\":[131]}},\"VFN\":\"\",\"PR\":[1650556305,2784036423,2799518198,18078622,2189600031,1974608873,2107497316,18851295,2901461314,1577622183,2564382737,10224931,2605090082,155936315,2054733273,2003968261,2308615245,2898650027,2198660300,2112486798,1650556305,2784036423,2799518198,18078622,2189600031,1974608873,2107497316,18851295,2901461314,1577622183,2564382737,10224931,2605090082,155936315,2054733273,2003968261,2308615245,2898650027,2198660300,2112486798],\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Haupt\",\"S\":1},{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":2},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":3}],\"BT\":\"a\"}"},{"logprob":-24.365,"Id":2097164440,"Ty":"0","Ti":"requirements traceability in service oriented computing","Pt":"0","Y":2009,"D":"2009-01-01","CC":0,"ECC":0,"RId":[2133254703,2128581098,2163960678,2129559874,2157130167,2098807159,2132089926,2121234902,57946486,2171144693,2120385275,2134866950,2043224646,2042360592,2077997855,1859141437,2005546948,2134384693,1758159143,2001258366,2803343605,1973223562,7347573,149861366,152925115],"W":["computing","oriented","requirements","service","traceability"],"AA":[{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"DAfN":"University of Potsdam","AfN":"university of potsdam","AfId":176453806,"S":1}],"F":[{"DFN":"Traceability matrix","FN":"traceability matrix","FId":160449927},{"DFN":"Systems engineering","FN":"systems engineering","FId":201995342},{"DFN":"Software requirements specification","FN":"software requirements specification","FId":102780508},{"DFN":"Requirements traceability","FN":"requirements traceability","FId":35084680},{"DFN":"Requirements engineering","FN":"requirements engineering","FId":6604083},{"DFN":"Requirements analysis","FN":"requirements analysis","FId":59488412},{"DFN":"Requirement","FN":"requirement","FId":135475081},{"DFN":"Non-functional testing","FN":"non functional testing","FId":26336911},{"DFN":"Computer science","FN":"computer science","FId":41008148},{"DFN":"Business requirements","FN":"business requirements","FId":123247970}],"E":"{\"DN\":\"Requirements Traceability in Service-oriented Computing\",\"IA\":{\"IndexLength\":99,\"InvertedIndex\":{\"Software\":[0],\"understanding,\":[1],\"as\":[2],\"a\":[3,28,45,56],\"primary\":[4],\"cost\":[5],\"in\":[6,31,70,96],\"software\":[7,94],\"engineering,\":[8],\"becomes\":[9],\"more\":[10],\"difficult\":[11],\"since\":[12],\"the\":[13,22,73],\"complexity\":[14],\"of\":[15,24,48,75],\"service-based\":[16],\"applications\":[17],\"is\":[18,26],\"steadily\":[19],\"growing.\":[20],\"Although\":[21],\"post-traceability\":[23],\"requirements\":[25,62],\"considered\":[27],\"critical\":[29],\"component\":[30],\"program\":[32],\"comprehension,\":[33],\"current\":[34],\"approaches\":[35],\"often\":[36],\"comprise\":[37],\"only\":[38],\"manual,\":[39],\"tedious,\":[40],\"and\":[41,67,82],\"laborious\":[42],\"processes\":[43],\"with\":[44,72],\"small\":[46,88],\"degree\":[47],\"automation.\":[49],\"In\":[50],\"this\":[51],\"paper,\":[52],\"we\":[53,78],\"present\":[54],\"Gears,\":[55],\"programming\":[57],\"language-independent\":[58],\"approach\":[59],\"for\":[60,93],\"automated\":[61],\"traceability.\":[63],\"Based\":[64],\"on\":[65],\"dynamic\":[66],\"static\":[68],\"analysis\":[69],\"correspondence\":[71],\"execution\":[74],\"acceptance\":[76],\"tests,\":[77],\"connect\":[79],\"requirements,\":[80],\"architecture,\":[81],\"implementation\":[83],\"artifacts\":[84],\"closer\":[85],\"together.\":[86],\"A\":[87],\"example\":[89],\"illustrates\":[90],\"our\":[91],\"idea\":[92],\"understanding\":[95],\"service-oriented\":[97],\"computing.\":[98]}},\"S\":[{\"Ty\":3,\"U\":\"http://www.michaelperscheid.de/publications/papers/Perscheid_2009_ResearchSchool.pdf\"}],\"VFN\":\"\",\"PR\":[2899746943,2724119512,2242343055,2782529059,2808596061,65917576,2189372476,1787007045,2027872751,2739062903,156177950,2181776998,2528957959,1488319902,2750632035,193556413,2549390102,2188665259,2578948051,196426909,2899746943,2724119512,2242343055,2782529059,2808596061,65917576,2189372476,1787007045,2027872751,2739062903,156177950,2181776998,2528957959,1488319902,2750632035,193556413,2549390102,2188665259,2578948051,196426909],\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":1}],\"BT\":\"a\"}"},{"logprob":-24.388,"Id":2181736355,"Ty":"0","Ti":"crossing the border from virtual to real world objects","Pt":"0","Y":2010,"D":"2010-01-01","CC":0,"ECC":0,"RId":[1529323856,2133368199,2119673170,2114657742,1563045389,2172147300,220870191,9402527,2125813862],"W":["border","crossing","objects","real","virtual","world"],"AA":[{"DAuN":"Michael Haupt","AuN":"michael haupt","AuId":2146662369,"S":1},{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":698431335,"S":2},{"DAuN":"Robert Hirschfeld","AuN":"robert hirschfeld","AuId":2154319088,"S":3},{"DAuN":"Lysann Kessler","AuN":"lysann kessler","AuId":2123091698,"S":4},{"DAuN":"Thomas Klingbeil","AuN":"thomas klingbeil","AuId":212836417,"S":5},{"DAuN":"Stephanie Platz","AuN":"stephanie platz","AuId":2119395961,"S":6},{"DAuN":"Frank Schlegel","AuN":"frank schlegel","AuId":2132997099,"S":7},{"DAuN":"Philipp Tessenow","AuN":"philipp tessenow","AuId":228457620,"S":8}],"F":[{"DFN":"Visual programming language","FN":"visual programming language","FId":128644962},{"DFN":"Simulation","FN":"simulation","FId":44154836},{"DFN":"Sight","FN":"sight","FId":1517167},{"DFN":"Realisation","FN":"realisation","FId":2779462738},{"DFN":"Multimedia","FN":"multimedia","FId":49774154},{"DFN":"Etoys","FN":"etoys","FId":2776396814},{"DFN":"Engineering","FN":"engineering","FId":127413603},{"DFN":"Electronic component","FN":"electronic component","FId":81060104}],"E":"{\"DN\":\"Crossing the Border from Virtual to Real-World Objects\",\"IA\":{\"IndexLength\":132,\"InvertedIndex\":{\"Teaching\":[0],\"pupils\":[1],\"the\":[2,55,73,79,97,111,114,121],\"ideas\":[3],\"behind\":[4],\"objects\":[5,37,48,90],\"in\":[6,103],\"programming\":[7,28,42,62],\"languages\":[8],\"can\":[9,49],\"be\":[10,51],\"difficult\":[11],\"since\":[12],\"these\":[13,47],\"concepts\":[14],\"are\":[15,92],\"mostly\":[16],\"abstract\":[17],\"and\":[18,38,119],\"not\":[19],\"comprehensible\":[20],\"at\":[21],\"first\":[22],\"sight.\":[23],\"Etoys\":[24,74],\"as\":[25],\"a\":[26,61,104,127],\"visual\":[27],\"environment\":[29,63],\"counters\":[30],\"such\":[31],\"issues\":[32],\"by\":[33],\"in-\":[34],\"troducing\":[35],\"visible\":[36],\"simple\":[39],\"tiles\":[40],\"for\":[41,64],\"them.\":[43],\"However,\":[44],\"all\":[45],\"of\":[46,72,113,123,130],\"only\":[50],\"experienced\":[52],\"virtually\":[53],\"on\":[54,70],\"screen.\":[56],\"This\":[57],\"paper\":[58],\"presents\":[59],\"PhidgetLab,\":[60],\"electronic\":[65],\"components\":[66],\"(Phid-\":[67],\"gets)\":[68],\"realised\":[69],\"top\":[71],\"environment.\":[75],\"PhidgetLab\":[76,100],\"helps\":[77],\"crossing\":[78],\"border\":[80],\"from\":[81],\"virtual\":[82],\"to\":[83,96],\"real-world\":[84],\"objects.\":[85],\"Pupils\":[86],\"interact\":[87],\"with\":[88,107],\"tangible\":[89],\"that\":[91],\"seamlessly\":[93],\"con-\":[94],\"nected\":[95],\"digital\":[98],\"world.\":[99],\"was\":[101],\"evaluated\":[102],\"case\":[105],\"study\":[106],\"22\":[108],\"pupils,\":[109],\"following\":[110],\"principles\":[112],\"De-\":[115],\"sign\":[116],\"Thinking\":[117],\"methodology\":[118],\"comprised\":[120],\"realisation\":[122],\"five\":[124],\"prototypes\":[125],\"within\":[126],\"short\":[128],\"period\":[129],\"time.\":[131]}},\"S\":[{\"Ty\":3,\"U\":\"http://www.hirschfeld.org/writings/media/HauptPerscheidHirschfeldKesslerKlingbeilPlatzSchlegelTessenow_2010_PhidgetLab_AcmDL.pdf\"}],\"VFN\":\"\",\"PR\":[2610583282,2806277143,1997348640,1969614802,2005898242,2063747589,2888207011,2092515338,2772327008,2163641272,137924770,203825193,2136654752,2039311637,2055346424,2182543339,2187517232,2205944142,148089522,23161408,2610583282,2806277143,1997348640,1969614802,2005898242,2063747589,2888207011,2092515338,2772327008,2163641272,137924770,203825193,2136654752,2039311637,2055346424,2182543339,2187517232,2205944142,148089522,23161408],\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Haupt\",\"S\":1},{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":2},{\"FN\":\"Robert\",\"LN\":\"Hirschfeld\",\"S\":3},{\"FN\":\"Lysann\",\"LN\":\"Kessler\",\"S\":4},{\"FN\":\"Thomas\",\"LN\":\"Klingbeil\",\"S\":5},{\"FN\":\"Stephanie\",\"LN\":\"Platz\",\"S\":6},{\"FN\":\"Frank\",\"LN\":\"Schlegel\",\"S\":7},{\"FN\":\"Philipp\",\"LN\":\"Tessenow\",\"S\":8}],\"BT\":\"a\"}"},{"logprob":-24.884,"Id":2413913266,"Ty":"0","Ti":"pendel knickgelenkte baumaschine","Pt":"2","L":"de","Y":2014,"D":"2014-02-13","CC":0,"ECC":0,"RId":[1493171142,2463447311],"W":["baumaschine","knickgelenkte","pendel"],"AA":[{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":2409102183,"DAfN":"BOMAG GmbH, 56154 (DE)","S":1},{"DAuN":"Hagen Brenner","AuN":"hagen brenner","AuId":2409054555,"DAfN":"BOMAG GmbH, 56154 (DE)","S":2}],"E":"{\"DN\":\"Pendel-/knickgelenkte Baumaschine\",\"IA\":{\"IndexLength\":120,\"InvertedIndex\":{\"Die\":[0,66],\"Erfindung\":[1],\"betrifft\":[2],\"eine\":[3,77,98],\"Pendel-/knickgelenkte\":[4],\"Baumaschine\":[5],\"(1),\":[6],\"die\":[7,70,95],\"einen\":[8,12],\"Vorderwagen\":[9,18,32],\"(2)\":[10,19,33],\"und\":[11,20,34,54,57,75],\"Hinterwagen\":[13,22,37],\"(3)\":[14,23,38],\"aufweist,\":[15],\"wobei\":[16],\"der\":[17,21,85,86,91],\"uber\":[24,113],\"ein\":[25],\"Pendel-/Knickgelenk\":[26],\"(4)\":[27],\"verbunden\":[28],\"sind.\":[29],\"Zwischen\":[30],\"dem\":[31,36],\"an\":[35,46],\"sind\":[39,44],\"Hydraulikschlauche\":[40,71,96],\"(9)\":[41,72,97],\"gefuhrt.\":[42],\"Ferner\":[43],\"sie\":[45,105],\"einem\":[47],\"Ende\":[48,60],\"mit\":[49],\"einer\":[50,62],\"Fixiereinrichtung\":[51,87],\"(10)\":[52,88],\"rotatorisch\":[53],\"axial\":[55],\"fixiert\":[56,69],\"am\":[58],\"anderen\":[59],\"in\":[61,73,103],\"Schlauchsicherung\":[63,67],\"(17)\":[64,68],\"gefuhrt\":[65],\"Axialrichtung\":[74],\"lasst\":[76],\"Bewegung\":[78],\"um\":[79,110],\"ihre\":[80],\"eigene\":[81],\"Achse\":[82],\"zu.\":[83],\"Auf\":[84],\"abgewandten\":[89],\"Seite\":[90],\"Fuhrungseinrichtung\":[92],\"(11)\":[93],\"weisen\":[94],\"vorgegebene\":[99],\"Ausgleichslange\":[100,115],\"(L)\":[101,116],\"auf,\":[102],\"welcher\":[104],\"sich\":[106],\"ungehindert\":[107],\"verdrehen\":[108],\"konnen,\":[109],\"eventuelle\":[111],\"Torsionsbewegungen\":[112],\"diese\":[114],\"ausgleichen\":[117],\"zu\":[118],\"konnen.\":[119]}},\"S\":[{\"Ty\":999,\"U\":\"http://www.freepatentsonline.com/DE102012015888.html\"},{\"Ty\":999,\"U\":\"https://lens.org/021-858-327-914-867\"}],\"VFN\":\"\",\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":1},{\"FN\":\"Hagen\",\"LN\":\"Brenner\",\"S\":2}]}"},{"logprob":-25.09,"Id":2783261105,"Ty":"0","Ti":"pendel knickgelenkte baumaschine pendant articulated construction machine","Pt":"2","L":"en","Y":2012,"D":"2012-08-10","CC":0,"ECC":0,"W":["articulated","baumaschine","construction","knickgelenkte","machine","pendant","pendel"],"AA":[{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":2409102183,"S":1},{"DAuN":"Hagen Brenner","AuN":"hagen brenner","AuId":2409054555,"S":2}],"F":[{"DFN":"Geology","FN":"geology","FId":127313418},{"DFN":"Computer hardware","FN":"computer hardware","FId":9390403},{"DFN":"Axial symmetry","FN":"axial symmetry","FId":35377427}],"E":"{\"DN\":\"Pendel-/knickgelenkte Baumaschine Pendant / articulated construction machine\",\"IA\":{\"IndexLength\":269,\"InvertedIndex\":{\"Die\":[0,125],\"Erfindung\":[1],\"betrifft\":[2],\"eine\":[3,136,206],\"pendel-/knickgelenkte\":[4],\"Baumaschine\":[5],\"(1),\":[6],\"die\":[7,129,203],\"einen\":[8,12],\"Vorderwagen\":[9,18,73],\"(2)\":[10,19,45,57,74,88],\"und\":[11,20,75,113,116,134],\"Hinterwagen\":[13,22,78],\"(3)\":[14,23,62,79,94],\"aufweist,\":[15],\"wobei\":[16],\"der\":[17,21,193,194,199],\"uber\":[24,221],\"ein\":[25],\"Pendel-/Knickgelenk\":[26],\"(4)\":[27,69],\"verbunden\":[28],\"sind.\":[29],\"The\":[30],\"invention\":[31],\"relates\":[32],\"to\":[33,53,90,150,175,258],\"a\":[34,42,47,64,151,161,186,247],\"shuttle\":[35,65],\"/\":[36,66],\"articulated\":[37],\"construction\":[38],\"machine\":[39],\"(1)\":[40],\"having\":[41],\"front\":[43,55,86],\"body\":[44],\"and\":[46,58,89,157,159,184],\"rear\":[48,60,92],\"carriage\":[49,56,61,93],\"(3),\":[50],\"are\":[51,95,145],\"connected\":[52],\"the\":[54,59,85,91,98,165,171,176,181,229,238],\"via\":[63],\"buckling\":[67],\"joint\":[68],\",\":[70],\"Zwischen\":[71],\"dem\":[72,77],\"an\":[76,105],\"sind\":[80,103],\"Hydraulikschlauche\":[81,130,204],\"(9)\":[82,131,179,205,245],\"gefuhrt.\":[83],\"Between\":[84],\"car\":[87],\"guided\":[96],\"in\":[97,120,132,155,160,180,211,252],\"hydraulic\":[99,177,243],\"hoses\":[100,178,244],\"(9).\":[101],\"Ferner\":[102],\"sie\":[104,213],\"einem\":[106],\"Ende\":[107,119],\"mit\":[108],\"einer\":[109,121],\"Fixiereinrichtung\":[110,195],\"(10)\":[111,154,196,233],\"rotatorisch\":[112],\"axial\":[114,182],\"fixiert\":[115,128],\"am\":[117],\"anderen\":[118],\"Schlauchsicherung\":[122,126],\"(17)\":[123,127,168,173],\"gefuhrt\":[124],\"Axialrichtung\":[133],\"lasst\":[135],\"Bewegung\":[137],\"um\":[138,218],\"ihre\":[139],\"eigene\":[140],\"Achse\":[141],\"zu.\":[142],\"Further,\":[143],\"they\":[144,254],\"fixed\":[146,174],\"at\":[147,164],\"one\":[148],\"end\":[149,167],\"fixing\":[152,231],\"device\":[153],\"rotation\":[156],\"axially\":[158],\"tube\":[162],\"fuse\":[163],\"other\":[166],\"out\":[169],\"securing\":[170],\"hose\":[172],\"direction\":[183],\"allows\":[185],\"movement\":[187],\"around\":[188],\"its\":[189],\"own\":[190],\"axis.\":[191],\"Auf\":[192],\"abgewandten\":[197],\"Seite\":[198],\"Fuhrungseinrichtung\":[200],\"(11)\":[201,241],\"weisen\":[202],\"vorgegebene\":[207],\"Ausgleichslange\":[208,223],\"(L)\":[209,224],\"auf,\":[210],\"welcher\":[212],\"sich\":[214],\"ungehindert\":[215],\"verdrehen\":[216],\"konnen,\":[217],\"eventuelle\":[219],\"Torsionsbewegungen\":[220],\"diese\":[222],\"ausgleichen\":[225],\"zu\":[226],\"konnen.\":[227],\"On\":[228],\"said\":[230],\"means\":[232,240],\"side\":[234],\"facing\":[235],\"away\":[236],\"from\":[237],\"guide\":[239],\"comprise\":[242],\"has\":[246],\"predetermined\":[248],\"equalization\":[249],\"length\":[250,267],\"(L),\":[251],\"which\":[253],\"can\":[255],\"rotate\":[256],\"freely,\":[257],\"compensate\":[259],\"for\":[260],\"any\":[261],\"torsional\":[262],\"movements\":[263],\"about\":[264],\"this\":[265],\"compensating\":[266],\"(L).\":[268]}},\"VFN\":\"\",\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":1},{\"FN\":\"Hagen\",\"LN\":\"Brenner\",\"S\":2}]}"},{"logprob":-25.09,"Id":2493736781,"Ty":"0","Ti":"pendulum articulated construction machine","Pt":"2","L":"en","Y":2012,"D":"2012-08-10","CC":0,"ECC":0,"RId":[1524555236,2241380440,38550423,2283522360,2402289433],"W":["articulated","construction","machine","pendulum"],"AA":[{"DAuN":"Hagen Brenner","AuN":"hagen brenner","AuId":2409054555,"DAfN":"BOMAG GmbH (Hellerwald, 56154 Boppard, DE)","S":1},{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":2409102183,"DAfN":"BOMAG GmbH (Hellerwald, 56154 Boppard, DE)","S":2}],"F":[{"DFN":"Performance art","FN":"performance art","FId":554144382},{"DFN":"Pendulum","FN":"pendulum","FId":110639684},{"DFN":"Engineering drawing","FN":"engineering drawing","FId":199639397},{"DFN":"Engineering","FN":"engineering","FId":127413603}],"E":"{\"DN\":\"Pendulum/articulated construction machine\",\"IA\":{\"IndexLength\":126,\"InvertedIndex\":{\"Die\":[0,70],\"Erfindung\":[1],\"betrifft\":[2],\"eine\":[3,81,104],\"pendel-/knickgelenkte\":[4],\"Baumaschine\":[5],\"(1),\":[6],\"die\":[7,74,101],\"einen\":[8,12],\"Vorderwagen\":[9,18,34],\"(2)\":[10,19,35],\"und\":[11,20,36,58,61,79],\"Hinterwagen\":[13,22,39],\"(3)\":[14,23,40],\"aufweist,\":[15],\"wobei\":[16],\"der\":[17,21,91,92,97],\"uber\":[24,119],\"ein\":[25],\"Pendel-/Knickgelenk\":[26],\"(4)\":[27],\"verbunden\":[28],\"sind.\":[29],\"Zwischen\":[32],\"dem\":[33,38],\"an\":[37,50],\"sind\":[41,48],\"Hydraulikschlauche\":[42,75,102],\"(9)\":[43,76,103],\"gefuhrt.\":[44],\"Ferner\":[47],\"sie\":[49,111],\"einem\":[51],\"Ende\":[52,64],\"mit\":[53],\"einer\":[54,66],\"Fixiereinrichtung\":[55,93],\"(10)\":[56,94],\"rotatorisch\":[57],\"axial\":[59],\"fixiert\":[60,73],\"am\":[62],\"anderen\":[63],\"in\":[65,77,109],\"Schlauchsicherung\":[67,71],\"(17)\":[68,72],\"gefuhrt\":[69],\"Axialrichtung\":[78],\"lasst\":[80],\"Bewegung\":[82],\"um\":[83,116],\"ihre\":[84],\"eigene\":[85],\"Achse\":[86],\"zu.\":[87],\"Auf\":[90],\"abgewandten\":[95],\"Seite\":[96],\"Fuhrungseinrichtung\":[98],\"(11)\":[99],\"weisen\":[100],\"vorgegebene\":[105],\"Ausgleichslange\":[106,121],\"(L)\":[107,122],\"auf,\":[108],\"welcher\":[110],\"sich\":[112],\"ungehindert\":[113],\"verdrehen\":[114],\"konnen,\":[115],\"eventuelle\":[117],\"Torsionsbewegungen\":[118],\"diese\":[120],\"ausgleichen\":[123],\"zu\":[124],\"konnen.\":[125]}},\"S\":[{\"Ty\":999,\"U\":\"https://lens.org/096-968-279-650-278\"},{\"Ty\":1,\"U\":\"https://patents.google.com/patent/DE102012015888B4/en\"},{\"Ty\":1,\"U\":\"http://www.freepatentsonline.com/EP2695799.html\"}],\"VFN\":\"\",\"ANF\":[{\"FN\":\"Hagen\",\"LN\":\"Brenner\",\"S\":1},{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":2}]}"},{"logprob":-25.303,"Id":149302956,"Ty":"0","Ti":"dynamic service analysis","Pt":"0","Y":2010,"D":"2010-01-01","CC":0,"ECC":0,"W":["dynamic","service"],"AA":[{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":2715582174,"S":1}],"E":"{\"DN\":\"Dynamic Service Analysis.\",\"S\":[{\"Ty\":1,\"U\":\"http://dblp.uni-trier.de/db/conf/dagstuhl/algosyn2010.html#Perscheid10\"}],\"VFN\":\"AlgoSyn\",\"FP\":204,\"PR\":[2865417795,2328684833,2844931035,1504205837,2879730830,1555515751,2822090361,2836422869,2022915552,2612272072,2830369694,91049396,149875431,2057269934,15741350,659401613,2029148349,1774557550,2760820793,2080028291,2865417795,2328684833,2844931035,1504205837,2879730830,1555515751,2822090361,2836422869,2022915552,2612272072,2830369694,91049396,149875431,2057269934,15741350,659401613,2029148349,1774557550,2760820793,2080028291],\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":1}],\"BV\":\"AlgoSyn\",\"BT\":\"a\"}"},{"logprob":-25.303,"Id":203065603,"Ty":"0","Ti":"dynamic service analysis understanding service implementations through behavioral examples","Pt":"0","Y":2010,"D":"2010-01-01","CC":0,"ECC":0,"W":["behavioral","dynamic","examples","implementations","service","understanding"],"AA":[{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":1519213368,"S":1}],"F":[{"DFN":"Systems engineering","FN":"systems engineering","FId":201995342},{"DFN":"Management science","FN":"management science","FId":539667460},{"DFN":"Implementation","FN":"implementation","FId":26713055},{"DFN":"Computer science","FN":"computer science","FId":41008148}],"E":"{\"DN\":\"Dynamic Service Analysis: Understanding Service Implementations Through Behavioral Examples\",\"VFN\":\"\",\"PR\":[189752295,1265512788,149632748,1496562760,172752784,1626900544,2047297846,2275280616,2102172936,412180771,1601385935,2048741132,1963572118,2097143278,1481256567,1708948262,2104287086,2754027663,2745847191,1983514918,189752295,1265512788,149632748,1496562760,172752784,1626900544,2047297846,2275280616,2102172936,412180771,1601385935,2048741132,1963572118,2097143278,1481256567,1708948262,2104287086,2754027663,2745847191,1983514918],\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":1}],\"BT\":\"a\"}"},{"logprob":-25.715,"Id":79713940,"Ty":"0","Ti":"eclipse plug ins","Pt":"0","Y":2006,"D":"2006-01-01","CC":0,"ECC":0,"W":["eclipse","ins","plug"],"AA":[{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":1134381073,"S":1}],"F":[{"DFN":"Plug-in","FN":"plug in","FId":4924752},{"DFN":"Operating system","FN":"operating system","FId":111919701},{"DFN":"Eclipse","FN":"eclipse","FId":2778505590},{"DFN":"Computer science","FN":"computer science","FId":41008148}],"E":"{\"DN\":\"Eclipse Plug-ins\",\"VFN\":\"\",\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":1}],\"BT\":\"a\"}"},{"logprob":-26.759,"Id":2525493921,"Ty":"0","Ti":"aerober abbau von endosulfan durch bodenmikroorganismen aerobic degradation of endosulfan by microorganisms","Pt":"1","L":"en","Y":1973,"D":"1973-01-01","CC":1,"ECC":1,"W":["abbau","aerober","aerobic","bodenmikroorganismen","degradation","durch","endosulfan","microorganisms"],"AA":[{"DAuN":"Michael Perscheid","AuN":"michael perscheid","AuId":2654982855,"S":1},{"DAuN":"H Orst Schlüter","AuN":"h orst schluter","AuId":2525325588,"S":2},{"DAuN":"Karlheinz Ballschmiter","AuN":"karlheinz ballschmiter","AuId":2665215209,"S":3}],"F":[{"DFN":"Pseudomonas","FN":"pseudomonas","FId":2781463711},{"DFN":"Microorganism","FN":"microorganism","FId":175605896},{"DFN":"Endosulfan","FN":"endosulfan","FId":2779680598},{"DFN":"Biology","FN":"biology","FId":86803240},{"DFN":"Biodegradation","FN":"biodegradation","FId":157021035},{"DFN":"Biochemistry","FN":"biochemistry","FId":55493867}],"J":{"JN":"zeitschrift fur naturforschung c","JId":67401564},"E":"{\"DN\":\"Aerober Abbau von Endosulfan durch Bodenmikroorganismen / Aerobic Degradation of Endosulfan by Microorganisms\",\"S\":[{\"Ty\":1,\"U\":\"https://www.degruyter.com/view/j/znc.1973.28.issue-11-12/znc-1973-11-1221/znc-1973-11-1221.xml\"}],\"VFN\":\"Zeitschrift für Naturforschung C\",\"V\":28,\"FP\":761,\"LP\":763,\"DOI\":\"10.1515/znc-1973-11-1221\",\"PR\":[1976082898,2031774961,2105366256,307242006,2028153094,2121220175,2145554323,2071442183,2158874531,2362511931,2059310723,2033288743,2016586508,900519965,2096120773,2376254360,1992924974,2030970829,2880863048,229094980,1976082898,2031774961,2105366256,307242006,2028153094,2121220175,2145554323,2071442183,2158874531,2362511931,2059310723,2033288743,2016586508,900519965,2096120773,2376254360,1992924974,2030970829,2880863048,229094980],\"ANF\":[{\"FN\":\"Michael\",\"LN\":\"Perscheid\",\"S\":1},{\"FN\":\"H Orst\",\"LN\":\"Schlüter\",\"S\":2},{\"FN\":\"Karlheinz\",\"LN\":\"Ballschmiter\",\"S\":3}],\"BV\":\"Zeitschrift für Naturforschung C\",\"BT\":\"a\",\"PB\":\"Verlag der Zeitschrift für Naturforschung\"}"}]}