<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-21T14:14:04Z</responseDate>
  <request identifier="2507" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2507</identifier>
        <datestamp>2024-03-06T11:09:04Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Towards Model Validation and Verification with SAT Techniques</dc:title>
          <dc:creator>Gogolla, Martin</dc:creator>
          <dc:subject>UML</dc:subject>
          <dc:subject>OCL</dc:subject>
          <dc:subject>Invariant</dc:subject>
          <dc:subject>Pre- and postcondition</dc:subject>
          <dc:subject>Model validation</dc:subject>
          <dc:subject>Model verification</dc:subject>
          <dc:description>After sketching how system development and the UML (Unified Modeling&#13;
Language) and the OCL (Object Constraint Language) are related,&#13;
validation and verification with the tool USE (UML-based Specification&#13;
Environment) is demonstrated. As a more efficient alternative for&#13;
verification tasks, two approaches using SAT-based techniques are put&#13;
forward: First, a direct encoding of UML and OCL with Boolean&#13;
variables and propositional formulas, and second, an encoding&#13;
employing an intermediate, higher-level language (KODKOD, stongly&#13;
connected to ALLOY). A number of further, presently not realized&#13;
verification and validation tasks and the transformation of&#13;
higher-level modeling concepts into simple UML/OCL models, which are&#13;
checkable with SAT-based techniques, are shortly discussed. Finally,&#13;
the potential of SAT-based techniques for model development is again&#13;
emphasized.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Martin Gogolla</dc:contributor>
          <dc:date>2010</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 9461, Algorithms and Applications for Next Generation SAT Solvers (2010)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.09461.6</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-25078</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09461.6</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
