http://www.bibsonomy.org/burst/tag/thesisBibSonomy BuRST Feed for /tag/thesis2008-07-27T04:09:34+02:00Empirically Studying Software Practitioners — Bridging the Gap between Theory and Practicehttp://www.bibsonomy.org/bibtex/2538560e42ad439499431908d13f9bcdf/grongron2008-07-25T21:23:26+02:00Thesis empirical <span style="color:#555555;">Michael P. <a href="http://www.bibsonomy.org/author/O&#039;Brien">O'Brien</a> and Jim <a href="http://www.bibsonomy.org/author/Buckley">Buckley</a> and Chris <a href="http://www.bibsonomy.org/author/Exton">Exton</a> </span><em>Proceedings of the 21st IEEE International Conference on Software Maintenance, </em><em>00, </em><em>page433-442. </em><em>Los Alamitos, CA, USA, </em><em>IEEE Computer Society, </em>(<em>2005</em>)Fri Jul 25 21:23:26 CEST 2008Los Alamitos, CA, USAProceedings of the 21st IEEE International Conference on Software Maintenance433-442Empirically Studying Software Practitioners — Bridging the Gap between Theory and Practice002005Thesis empirical http://www.bibsonomy.org/bibtex/2cf289c7f1f0feb29989e80bf703d32eb/markus.scheidgenmarkus.scheidgen2008-07-24T14:43:19+02:00thesis project <span style="color:#555555;"> <a href="http://www.bibsonomy.org/author/{Cinderella}">Cinderella</a> </span>(<em>2008</em>)Thu Jul 24 14:43:19 CEST 2008SDL Integrated Tool Environment (SITE)2008thesis project http://www.bibsonomy.org/bibtex/2e045acd9d7a27bfecc275de32e853f05/markus.scheidgenmarkus.scheidgen2008-07-24T14:42:28+02:00thesis project <span style="color:#555555;"> <a href="http://www.bibsonomy.org/author/{Cinderella}">Cinderella</a> </span>(<em>2008</em>)Thu Jul 24 14:42:28 CEST 2008Cinderella SDL2008thesis project http://www.bibsonomy.org/bibtex/2a0bb160fd919f1aa04b870fb232078a1/markus.scheidgenmarkus.scheidgen2008-07-24T14:40:31+02:00project thesis <span style="color:#555555;"> <a href="http://www.bibsonomy.org/author/{PragmaDev}">PragmaDev</a> </span>(<em>2008</em>)Thu Jul 24 14:40:31 CEST 2008Real Time Developer Studio2008project thesis Specification and Analysis of System Architecture Using Rapidehttp://www.bibsonomy.org/bibtex/24353e41d04acd1265d8a271433a4aa39/grongron2008-07-18T21:10:24+02:00Thesis Me:Printed ArchitectureLanguage <span style="color:#555555;">David C. <a href="http://www.bibsonomy.org/author/Luckham">Luckham</a> and John J. <a href="http://www.bibsonomy.org/author/Kenney">Kenney</a> and Larry M. <a href="http://www.bibsonomy.org/author/Augustin">Augustin</a> and James <a href="http://www.bibsonomy.org/author/Vera">Vera</a> and Walter <a href="http://www.bibsonomy.org/author/Mann">Mann</a> and Walter <a href="http://www.bibsonomy.org/author/Mann">Mann</a> and Doug <a href="http://www.bibsonomy.org/author/Bryan">Bryan</a> and Walter <a href="http://www.bibsonomy.org/author/Mann">Mann</a> </span><em>IEEE Transactions on Software Engineering</em><em>21(4):336-355</em>(<em>1995</em>)Fri Jul 18 21:10:24 CEST 2008Los Alamitos, CA, USAIEEE Transactions on Software Engineering4336-355Specification and Analysis of System Architecture Using Rapide211995Thesis Me:Printed ArchitectureLanguage An Event-Based Architecture Definition Languagehttp://www.bibsonomy.org/bibtex/2cacbb8320c1f3d2d097c9788f31ac2b4/grongron2008-07-18T21:07:17+02:00ArchitectureLanguage Me:Printed Thesis <span style="color:#555555;">David C. <a href="http://www.bibsonomy.org/author/Luckham">Luckham</a> and James <a href="http://www.bibsonomy.org/author/Vera">Vera</a> </span><em>IEEE Transactions on Software Engineering</em><em>21(9):717-734</em>(<em>1995</em>)Fri Jul 18 21:07:17 CEST 2008Los Alamitos, CA, USAIEEE Transactions on Software Engineering9717-734An Event-Based Architecture Definition Language211995ArchitectureLanguage Me:Printed Thesis http://www.bibsonomy.org/bibtex/2ece0ba37f31820f8c2bd918990ebfbef/grongron2008-07-15T22:57:23+02:00Thesis Visualization <span style="color:#555555;">AT&amp;T <a href="http://www.bibsonomy.org/author/Research">Research</a> </span>(<em>2008</em>)Tue Jul 15 22:57:23 CEST 2008Graphviz - Graph Visualization Software2008Thesis Visualization http://www.bibsonomy.org/bibtex/24ce61c7170e36659c300c00d7ffe7a70/grongron2008-07-15T22:54:17+02:00languages Thesis <span style="color:#555555;">Guillaume <a href="http://www.bibsonomy.org/author/Laforge">Laforge</a> </span>(<em>2008</em>)Tue Jul 15 22:54:17 CEST 2008Groovy: An agile dynamic language for the Java Platform2008languages Thesis http://www.bibsonomy.org/bibtex/2c98af048c3af5835aa06f3f514715cde/grongron2008-07-15T18:12:44+02:00Thesis VM Java <span style="color:#555555;">Inc. <a href="http://www.bibsonomy.org/author/Sun Microsystems">Sun Microsystems</a> </span><em>July2008. </em>Tue Jul 15 18:12:44 CEST 2008JulyThe HotSpot Group2008Thesis VM Java Welcome to IEEE Xplore 2.0: A Survey of Adaptive Optimization in Virtual Machineshttp://www.bibsonomy.org/bibtex/2c672e1eee2ca4faa6045aa418ac4233c/grongron2008-07-15T14:08:31+02:00Thesis VM Optimization <span style="color:#555555;">Matthew <a href="http://www.bibsonomy.org/author/Arnold">Arnold</a> and Stephen J. <a href="http://www.bibsonomy.org/author/Fink">Fink</a> and David <a href="http://www.bibsonomy.org/author/Grove">Grove</a> and Michael <a href="http://www.bibsonomy.org/author/Hind">Hind</a> and Peter F. <a href="http://www.bibsonomy.org/author/Sweeney">Sweeney</a> </span>(<em>2005</em>)Tue Jul 15 14:08:31 CEST 2008Proceedings of the IEEE449-466A Survey of Adaptive Optimization in Virtual Machines932005Thesis VM Optimization Virtual machines face significant performance challenges beyond those confronted by traditional static optimizers. First, portable program representations and dynamic language features, such as dynamic class loading, force the deferral of most optimizations until runtime, inducing runtime optimization overhead. Second, modular program representations preclude many forms of whole-program interprocedural optimization. Third, virtual machines incur additional costs for runtime services such as security guarantees and automatic memory management. To address these challenges, vendors have invested considerable resources into adaptive optimization systems in production virtual machines. Today, mainstream virtual machine implementations include substantial infrastructure for online monitoring and profiling, runtime compilation, and feedback-directed optimization. As a result, adaptive optimization has begun to mature as a widespread production-level technology. This paper surveys the evolution and current state of adaptive optimization technology in virtual machines.http://www.bibsonomy.org/bibtex/2f5fec031f0f0d6a9a16b1acfaabc24b4/markus.scheidgenmarkus.scheidgen2008-07-15T12:32:59+02:00thesis project <span style="color:#555555;">Michael <a href="http://www.bibsonomy.org/author/Soden">Soden</a> and Hajo <a href="http://www.bibsonomy.org/author/Eichler">Eichler</a> </span>(<em>2008</em>)Tue Jul 15 12:32:59 CEST 2008M3 Actions2008thesis project HotpathVMhttp://www.bibsonomy.org/bibtex/21a4aafe6e1ef0b0232c925a907893bf5/grongron2008-07-14T22:24:33+02:00Trace Compilation VM Thesis <span style="color:#555555;">Andreas <a href="http://www.bibsonomy.org/author/Gal">Gal</a> and Christian W. <a href="http://www.bibsonomy.org/author/Probst">Probst</a> and Michael <a href="http://www.bibsonomy.org/author/Franz">Franz</a> </span><em>VEE '06: Proceedings of the 2nd international conference on Virtual execution environments, </em><em>page144--153. </em><em>New York, NY, USA, </em><em>ACM, </em>(<em>2006</em>)Mon Jul 14 22:24:33 CEST 2008New York, NY, USAVEE '06: Proceedings of the 2nd international conference on Virtual execution environments144--153HotpathVM: An Effective JIT Compiler for Resource-constrained Devices2006Trace Compilation VM Thesis We present a just-in-time compiler for a Java VM that is small enough to fit on resource-constrained devices, yet is surprisingly effective. Our system dynamically identifies traces of frequently executed bytecode instructions (which may span several basic blocks across several methods) and compiles them via Static Single Assignment (SSA) construction. Our novel use of SSA form in this context allows to hoist instructions across trace side-exits without necessitating expensive compensation code in off-trace paths. The overall memory consumption (code and data) of our system is only 150 kBytes, yet benchmarks show a speedup that in some cases rivals heavy-weight just-in-time compilers.SpringerLink - Zeitschriftenbeitraghttp://www.bibsonomy.org/bibtex/2ff6f4a33f941e73fbd9080db80f18b3e/grongron2008-07-14T21:31:56+02:00Thesis VM <span style="color:#555555;">Christopher <a href="http://www.bibsonomy.org/author/Strachey">Strachey</a> and Christopher P. <a href="http://www.bibsonomy.org/author/Wadsworth">Wadsworth</a> </span><em>Higher-Order and Symbolic Computation</em><em>13(1):135--152</em><em>April2000. </em>Mon Jul 14 21:31:56 CEST 2008Higher-Order and Symbolic ComputationApril1135--152Continuations: A Mathematical Semantics for Handling Full Jumps132000Thesis VM This paper describes a method of giving the mathematical semantics of programming languages which include the most general form of jumps. ER -A LISP garbage-collector for virtual-memory computer systemshttp://www.bibsonomy.org/bibtex/274d69f5fc071dc538a6a60fd8db17757/grongron2008-07-14T20:41:10+02:00VM Thesis GC <span style="color:#555555;">Robert R. <a href="http://www.bibsonomy.org/author/Fenichel">Fenichel</a> and Jerome C. <a href="http://www.bibsonomy.org/author/Yochelson">Yochelson</a> </span><em>Communications of the ACM</em><em>12(11):611--612</em>(<em>1969</em>)Mon Jul 14 20:41:10 CEST 2008New York, NY, USACommunications of the ACM11611--612A LISP Garbage-Collector for Virtual-Memory Computer Systems121969VM Thesis GC An efficient, incremental, automatic garbage collectorhttp://www.bibsonomy.org/bibtex/2ca960b49122a7331645257d915a89851/grongron2008-07-14T20:10:22+02:00GC Thesis VM <span style="color:#555555;">L. <a href="http://www.bibsonomy.org/author/Peter Deutsch">Peter Deutsch</a> and Daniel G. <a href="http://www.bibsonomy.org/author/Bobrow">Bobrow</a> </span><em>Communications of the ACM</em><em>19(9):522--526</em>(<em>1976</em>)Mon Jul 14 20:10:22 CEST 2008New York, NY, USACommunications of the ACM9522--526An Efficient, Incremental, Automatic Garbage Collector191976GC Thesis VM This paper describes a new way of solving the storage reclamation problem for a system such as Lisp that allocates storage automatically from a heap, and does not require the programmer to give any indication that particular items are no longer useful or accessible. A reference count scheme for reclaiming non-self-referential structures, and a linearizing, compacting, copying scheme to reorganize all storage at the users discretion are proposed. The algorithms are designed to work well in systems which use multiple levels of storage, and large virtual address space. They depend on the fact that most cells are referenced exactly once, and that reference counts need only be accurate when storage is about to be reclaimed. A transaction file stores changes to reference counts, and a multiple reference table stores the count for items which are referenced more than once.Implementing Jalapeño in Javahttp://www.bibsonomy.org/bibtex/22454e90029fd0dc40161fb0501c08826/grongron2008-07-10T20:40:34+02:00Thesis Jikes RelatedWork VM <span style="color:#555555;">Bowen <a href="http://www.bibsonomy.org/author/Alpern">Alpern</a> and C. R. <a href="http://www.bibsonomy.org/author/Attanasio">Attanasio</a> and Anthony <a href="http://www.bibsonomy.org/author/Cocchi">Cocchi</a> and Derek <a href="http://www.bibsonomy.org/author/Lieber">Lieber</a> and Stephen <a href="http://www.bibsonomy.org/author/Smith">Smith</a> and Ton <a href="http://www.bibsonomy.org/author/Ngo">Ngo</a> and John J. <a href="http://www.bibsonomy.org/author/Barton">Barton</a> and Susan Flynn <a href="http://www.bibsonomy.org/author/Hummel">Hummel</a> and Janice C. <a href="http://www.bibsonomy.org/author/Sheperd">Sheperd</a> and Mark <a href="http://www.bibsonomy.org/author/Mergen">Mergen</a> </span><em>SIGPLAN Not.</em><em>34(10):314--324</em>(<em>1999</em>)Thu Jul 10 20:40:34 CEST 2008New York, NY, USASIGPLAN Not.10314--324Implementing Jalapeño in Java341999Thesis Jikes RelatedWork VM Jalapeño is a virtual machine for Java™ servers written in Java.A running Java program involves four layers of functionality: the user code, the virtual-machine, the operating system, and the hardware. By drawing the Java / non-Java boundary below the virtual machine rather than above it, Jalapeño reduces the boundary-crossing overhead and opens up more opportunities for optimization.To get Jalapeño started, a boot image of a working Jalapeño virtual machine is concocted and written to a file. Later, this file can be loaded into memory and executed. Because the boot image consists entirely of Java objects, it can be concocted by a Java program that runs in any JVM. This program uses reflection to convert the boot image into Jalapeño's object format.A special MAGIC class allows unsafe casts and direct access to the hardware. Methods of this class are recognized by Jalapeño's three compilers, which ignore their bytecodes and emit special-purpose machine code. User code will not be allowed to call MAGIC methods so Java's integrity is preserved.A small non-Java program is used to start up a boot image and as an interface to the operating system.Java's programming features — object orientation, type safety, automatic memory management — greatly facilitated development of Jalapeño. However, we also discovered some of the language's limitations.Constructing a metacircular Virtual machine in an exploratory programming environmenthttp://www.bibsonomy.org/bibtex/27ad875c098ada3fa59d035dbae5f8d23/grongron2008-07-10T20:32:49+02:00MetaCircular VM Thesis <span style="color:#555555;">David <a href="http://www.bibsonomy.org/author/Ungar">Ungar</a> and Adam <a href="http://www.bibsonomy.org/author/Spitz">Spitz</a> and Alex <a href="http://www.bibsonomy.org/author/Ausch">Ausch</a> </span><em>OOPSLA '05: Companion to the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, </em><em>page11--20. </em><em>New York, NY, USA, </em><em>ACM, </em>(<em>2005</em>)Thu Jul 10 20:32:49 CEST 2008New York, NY, USAOOPSLA '05: Companion to the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications11--20Constructing a Metacircular Virtual Machine in an Exploratory Programming Environment2005MetaCircular VM Thesis Can virtual machine developers benefit from religiously observing the principles more often embraced for exploratory programming? To find out, we are concurrently constructing two artifacts--a Self VM entirely in Self (the Klein VM), and a specialized development environment--with strict adherence to pure object-orientation, metacircularity, heavy code reuse, reactivity, and mirror-based reflection. Although neither artifact is yet complete, the environ-ment supports many remote debugging and incremental update operations, and the exported virtual machine has successfully run the whole compiler.As a result of our adherence to these principles, there have been both positive and negative consequences. We have been able to find and exploit many opportunities for parsimony. For example, the very same code creates objects in the bootstrap image, builds ob-jects in the running VM, and implements a remote debugger. On the other hand, we have been forced to expend effort to optimize the performance of the environment. Overall, this approach trades off the performance of the environment against the architectural sim-plicity and ease of development of the resulting VM artifact. As computers continue to improve in performance, we believe that this approach will increase in value.PyPy’s Approach to Virtual Machine Constructionhttp://www.bibsonomy.org/bibtex/24020af24a7b0342a43bedc72a3f92d9d/grongron2008-07-10T20:21:56+02:00Python VM Thesis <span style="color:#555555;">Armin <a href="http://www.bibsonomy.org/author/Rigo">Rigo</a> and Samuele <a href="http://www.bibsonomy.org/author/Pedroni">Pedroni</a> </span><em>OOPSLA '06: Companion to the 21st ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications, </em><em>page944--953. </em><em>New York, NY, USA, </em><em>ACM, </em>(<em>2006</em>)Thu Jul 10 20:21:56 CEST 2008New York, NY, USAOOPSLA '06: Companion to the 21st ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications944--953PyPy’s Approach to Virtual Machine Construction2006Python VM Thesis The PyPy project seeks to prove both on a research and a practical level the feasibility of constructing a virtual machine (VM) for a dynamic language in a dynamic language - in this case, Python. The aim is to translate (i.e. compile) the VM to arbitrary target environments, ranging in level from C/Posix to Smalltalk/Squeak via Java and CLI/.NET, while still being of reasonable efficiency within these environments.A key tool to achieve this goal is the systematic reuse of the Python language as a system programming language at various levels of our architecture and translation process. For each level, we design a corresponding type system and apply a generic type inference engine - for example, the garbage collector is written in a style that manipulates simulated pointer and address objects, and when translated to C these operations become C-level pointer and address instructions.Back to the futurehttp://www.bibsonomy.org/bibtex/250b93585dec0fa09363d8c8fde98d893/grongron2008-07-10T20:13:00+02:00Thesis VM RelatedWork Smalltalk <span style="color:#555555;">Dan <a href="http://www.bibsonomy.org/author/Ingalls">Ingalls</a> and Ted <a href="http://www.bibsonomy.org/author/Kaehler">Kaehler</a> and John <a href="http://www.bibsonomy.org/author/Maloney">Maloney</a> and Scott <a href="http://www.bibsonomy.org/author/Wallace">Wallace</a> and Alan <a href="http://www.bibsonomy.org/author/Kay">Kay</a> </span><em>SIGPLAN Not.</em><em>32(10):318--326</em>(<em>1997</em>)Thu Jul 10 20:13:00 CEST 2008New York, NY, USASIGPLAN Not.10318--326Back to the Future: The Story of Squeak, A Practical Smalltalk Written in Itself321997Thesis VM RelatedWork Smalltalk Squeak is an open, highly-portable Smalltalk implementation whose virtual machine is written entirely in Smalltalk, making it easy to. debug, analyze, and change. To achieve practical performance, a translator produces an equivalent C program whose performance is comparable to commercial Smalltalks.Other noteworthy aspects of Squeak include: a compact object format that typically requires only a single word of overhead per object; a simple yet efficient incremental garbage collector for 32-bit direct pointers; efficient bulk-mutation of objects; extensions of BitBlt to handle color of any depth and anti-aliased image rotation and scaling; and real-time sound and music synthesis written entirely in Smalltalk.Virtual Machineshttp://www.bibsonomy.org/bibtex/2f62d5ccf414d0f5e75d32e33251a9ca8/grongron2008-07-10T17:09:52+02:00VM Thesis <span style="color:#555555;">James E. <a href="http://www.bibsonomy.org/author/Smith">Smith</a> and Ravi <a href="http://www.bibsonomy.org/author/Nair">Nair</a> </span><em>The Morgan Kaufmann Series in Computer Architecture and Design </em><em>Morgan Kaufmann Publishers Inc., </em><em>San Francisco, CA, USA, </em>(<em>2005</em>)Thu Jul 10 17:09:52 CEST 2008San Francisco, CA, USAThe Morgan Kaufmann Series in Computer Architecture and DesignVirtual Machines: Versatile Platforms for Systems and Processes2005VM Thesis