@INPROCEEDINGS{Gueheneuc02-ASE-Caffeine,
   AUTHOR       = {Yann-Ga�l Gu�h�neuc and R�mi Douence and 
      Narendra Jussien},
   BOOKTITLE    = {Proceedings of the 17<sup>th</sup> Conference on Automated Software Engineering (ASE)},
   TITLE        = {No Java Without Caffeine -- A Tool for Dynamic Analysis 
      of Java Programs},
   YEAR         = {2002},
   OPTADDRESS   = {},
   OPTCROSSREF  = {},
   EDITOR       = {Wolfgang Emmerich and Dave Wile},
   MONTH        = {September},
   NOTE         = {10 pages.},
   OPTNUMBER    = {},
   OPTORGANIZATION = {},
   PAGES        = {117--126},
   PUBLISHER    = {IEEE CS Press},
   OPTSERIES    = {},
   OPTVOLUME    = {},
   KEYWORDS     = {Topic: <b>Binary class relations</b>, Venue: <c>ASE</c>},
   URL          = {http://www.ptidej.net/publications/documents/ASE02.doc.pdf},
   PDF          = {http://www.ptidej.net/publications/documents/ASE02.ppt.pdf},
   ABSTRACT     = {To understand the behavior of a program, a maintainer 
      reads some code, asks a question about this code, conjectures an 
      answer, and searches the code and the documentation for confirmation 
      of her conjecture. However, the confirmation of the conjecture can be 
      error-prone and time-consuming because the maintainer has only static 
      information at her disposal. She would benefit from dynamic 
      information. In this paper, we present Caffeine{}, an assistant that 
      helps the maintainer in checking her conjecture about the behavior of 
      a Java{} program. Our assistant is a dynamic analysis tool that uses 
      the Java{} platform debug architecture to generate a trace, \ie{} an 
      execution history, and a \Prolog{} engine to perform queries over the 
      trace. We present a usage scenario based on the n-queens problem, and 
      two real-life examples based on the Singleton design pattern and on 
      the composition relationship.}
}

{"_id":"CutWEPJ9yecY3Gi5F","bibbaseid":"guhneuc-douence-jussien-nojavawithoutcaffeineatoolfordynamicanalysisofjavaprograms-2002","downloads":0,"creationDate":"2018-01-17T20:29:42.614Z","title":"No Java Without Caffeine – A Tool for Dynamic Analysis of Java Programs","author_short":["Gu�h�neuc, Y.","Douence, R.","Jussien, N."],"year":2002,"bibtype":"inproceedings","biburl":"http://www.yann-gael.gueheneuc.net/Work/Publications/Biblio/complete-bibliography.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Yann-Ga�l"],"propositions":[],"lastnames":["Gu�h�neuc"],"suffixes":[]},{"firstnames":["R�mi"],"propositions":[],"lastnames":["Douence"],"suffixes":[]},{"firstnames":["Narendra"],"propositions":[],"lastnames":["Jussien"],"suffixes":[]}],"booktitle":"Proceedings of the 17^th Conference on Automated Software Engineering (ASE)","title":"No Java Without Caffeine – A Tool for Dynamic Analysis of Java Programs","year":"2002","optaddress":"","optcrossref":"","editor":[{"firstnames":["Wolfgang"],"propositions":[],"lastnames":["Emmerich"],"suffixes":[]},{"firstnames":["Dave"],"propositions":[],"lastnames":["Wile"],"suffixes":[]}],"month":"September","note":"10 pages.","optnumber":"","optorganization":"","pages":"117–126","publisher":"IEEE CS Press","optseries":"","optvolume":"","keywords":"Topic: <b>Binary class relations</b>, Venue: <c>ASE</c>","url":"http://www.ptidej.net/publications/documents/ASE02.doc.pdf","pdf":"http://www.ptidej.net/publications/documents/ASE02.ppt.pdf","abstract":"To understand the behavior of a program, a maintainer reads some code, asks a question about this code, conjectures an answer, and searches the code and the documentation for confirmation of her conjecture. However, the confirmation of the conjecture can be error-prone and time-consuming because the maintainer has only static information at her disposal. She would benefit from dynamic information. In this paper, we present Caffeine, an assistant that helps the maintainer in checking her conjecture about the behavior of a Java program. Our assistant is a dynamic analysis tool that uses the Java platform debug architecture to generate a trace, ıe an execution history, and a ¶rolog engine to perform queries over the trace. We present a usage scenario based on the n-queens problem, and two real-life examples based on the Singleton design pattern and on the composition relationship.","bibtex":"@INPROCEEDINGS{Gueheneuc02-ASE-Caffeine,\r\n AUTHOR = {Yann-Ga�l Gu�h�neuc and R�mi Douence and \r\n Narendra Jussien},\r\n BOOKTITLE = {Proceedings of the 17^th Conference on Automated Software Engineering (ASE)},\r\n TITLE = {No Java Without Caffeine -- A Tool for Dynamic Analysis \r\n of Java Programs},\r\n YEAR = {2002},\r\n OPTADDRESS = {},\r\n OPTCROSSREF = {},\r\n EDITOR = {Wolfgang Emmerich and Dave Wile},\r\n MONTH = {September},\r\n NOTE = {10 pages.},\r\n OPTNUMBER = {},\r\n OPTORGANIZATION = {},\r\n PAGES = {117--126},\r\n PUBLISHER = {IEEE CS Press},\r\n OPTSERIES = {},\r\n OPTVOLUME = {},\r\n KEYWORDS = {Topic: <b>Binary class relations</b>, Venue: <c>ASE</c>},\r\n URL = {http://www.ptidej.net/publications/documents/ASE02.doc.pdf},\r\n PDF = {http://www.ptidej.net/publications/documents/ASE02.ppt.pdf},\r\n ABSTRACT = {To understand the behavior of a program, a maintainer \r\n reads some code, asks a question about this code, conjectures an \r\n answer, and searches the code and the documentation for confirmation \r\n of her conjecture. However, the confirmation of the conjecture can be \r\n error-prone and time-consuming because the maintainer has only static \r\n information at her disposal. She would benefit from dynamic \r\n information. In this paper, we present Caffeine{}, an assistant that \r\n helps the maintainer in checking her conjecture about the behavior of \r\n a Java{} program. Our assistant is a dynamic analysis tool that uses \r\n the Java{} platform debug architecture to generate a trace, \\ie{} an \r\n execution history, and a \\Prolog{} engine to perform queries over the \r\n trace. We present a usage scenario based on the n-queens problem, and \r\n two real-life examples based on the Singleton design pattern and on \r\n the composition relationship.}\r\n}\r\n\r\n","author_short":["Gu�h�neuc, Y.","Douence, R.","Jussien, N."],"editor_short":["Emmerich, W.","Wile, D."],"key":"Gueheneuc02-ASE-Caffeine","id":"Gueheneuc02-ASE-Caffeine","bibbaseid":"guhneuc-douence-jussien-nojavawithoutcaffeineatoolfordynamicanalysisofjavaprograms-2002","role":"author","urls":{"Paper":"http://www.ptidej.net/publications/documents/ASE02.doc.pdf"},"keyword":["Topic: <b>Binary class relations</b>","Venue: <c>ASE</c>"],"metadata":{"authorlinks":{"gu�h�neuc, y":"https://bibbase.org/show?bib=http%3A%2F%2Fwww.yann-gael.gueheneuc.net%2FWork%2FPublications%2FBiblio%2Fcomplete-bibliography.bib&msg=embed","guéhéneuc, y":"https://bibbase.org/show?bib=http://www.yann-gael.gueheneuc.net/Work/BibBase/guehene%20(automatically%20cleaned).bib"}},"downloads":0},"search_terms":["java","without","caffeine","tool","dynamic","analysis","java","programs","gu�h�neuc","douence","jussien"],"keywords":["topic: <b>binary class relations</b>","venue: <c>ase</c>"],"authorIDs":["AfJhKcg96muyPdu7S","xkviMnkrGBneANvMr"],"dataSources":["Sed98LbBeGaXxenrM","8vn5MSGYWB4fAx9Z4"]}