<?xml version="1.0" encoding="UTF-8"?>
<xml>
<records>
<record>
  <ref-type name="Thesis">32</ref-type>
  <contributors>
    <authors>
      <author>Quirós Araya, Gustavo</author>
    </authors>
    <subsidiary-authors>
      <author>120000</author>
      <author>121310</author>
    </subsidiary-authors>
  </contributors>
  <titles>
    <title>Static byte-code analysis for state space reduction</title>
  </titles>
  <periodical/>
  <publisher>Publikationsserver der RWTH Aachen University</publisher>
  <pub-location>Aachen</pub-location>
  <language>English</language>
  <pages>VIII, 101 S.</pages>
  <number/>
  <volume/>
  <abstract>NIPS is a virtual machine for the generation of state-transition systems of concurrent models, and is designed to serve as a foundation for the development of model checking applications. Like any explicit-state representation, the transition systems produced by NIPS suffer from the state-explosion problem, by which models have exponentially large state spaces. This work is dedicated to the reduction of the effect of the state-explosion problem in NIPS. State space reduction works by obtaining a reduced state-transition system from a model, which is equivalent to the original system under a given specification, or a given set of specifications. Model checking may be applied to the reduced system instead of to the original one, thus obtaining the same result in a more efficient manner. NIPS features a byte-code language for encoding concurrent models. High-level modeling languages may be compiled to this byte-code, and the interpretation of the byte-code by the machine results in the construction of the model’s state space representation. This architecture allows us to implement on-the-fly reductions merely by transforming the byte-code to another whose state-transition system is a reduced version of the original, and employing information gathered from static analysis of the byte-code in the process.</abstract>
  <notes>
    <note>Veröffentlicht auf dem Publikationsserver der RWTH Aachen University ; </note>
    <note>Aachen, Techn. Hochsch., Masterarbeit, 2006 ; </note>
  </notes>
  <label>PUB:(DE-HGF)19, ; 2, ; </label>
  <keywords>
    <keyword>Programmanalyse</keyword>
    <keyword>Compiler</keyword>
    <keyword>Model Checking</keyword>
    <keyword>Zustandsraum</keyword>
    <keyword>Programmoptimierung</keyword>
    <keyword>Verteiltes System</keyword>
  </keywords>
  <accession-num/>
  <work-type>Master Thesis</work-type>
  <dates>
    <pub-dates>
      <year>2011</year>
    </pub-dates>
  </dates>
  <accession-num>RWTH-CONV-144790</accession-num>
  <year>2011</year>
  <urls>
    <related-urls>
      <url>https://publications.rwth-aachen.de/record/229985</url>
    </related-urls>
  </urls>
</record>

</records>
</xml>