From ce742445317258ab667e9c5fc1b1091cc0e64b98 Mon Sep 17 00:00:00 2001
From: Adam Stück <adam@adast.xyz>
Date: Sat, 25 Mar 2023 15:19:32 +0100
Subject: resume: add publications

---
 dst/resume.html | 25 +++++++++++++++++++++++++
 1 file changed, 25 insertions(+)

(limited to 'dst/resume.html')

diff --git a/dst/resume.html b/dst/resume.html
index 38bf50f..7ffb293 100644
--- a/dst/resume.html
+++ b/dst/resume.html
@@ -20,6 +20,8 @@
                 <a href="/rss.xml">RSS</a>
             </nav>
         </header><main>
+<script type="text/javascript" language="javascript" src="js/showhide.js"></script>
+
 <h4 id="english-dansk-">[ English &#47; <a href="/resume-da">Dansk</a> ]</h4>
 
 <h1 id="adam-stck">Adam Stück</h1>
@@ -108,6 +110,29 @@
 <li>Bachelors Degree in Computer Science - 3 Year Program</li>
 </ul>
 
+<h2 id="publications">Publications</h2>
+
+<p>[1] <strong>Potency-Based Heuristic Search with Randomness for Explicit Model Checking</strong><br>
+by E.G.Henriksen, A.M. Khorsid, E. Nielsen, Th. Risager, <a href="http://www.cs.aau.dk/~srba">J. Srba</a>, <strong>A.M. Stück</strong>, S. Sørensen<br>
+In Proceedings of the 29th International SPIN Symposium on Model Checking of Software (SPIN&#8217;23), LNCS, pages 1&#8211;8, Springer-Verlag, 2023.<br>
+<em>To appear.</em><br>
+<a href="http://www.cs.aau.dk/~srba/files/HKNRSSS:SPIN:23.pdf">PDF</a> &#160; <a href="https://homes.cs.aau.dk/~srba/srba.html#HKNRSSS:SPIN:23">BibTex</a> 
+&#160; <a onclick="ShowHide('HKNRSSS:SPIN:23');UpdateText(this);" href="javascript:void(0)">Abstract</a></p>
+
+<div class="abstract" style="display:none" id="HKNRSSS:SPIN:23">Efficient state-space exploration
+has a significant impact on reachability analysis in explicit model checking
+and existing tools use several variants of search heuristics and random walks
+in order to overcome the state-space explosion problem. We contribute with a
+novel approach based on a random search strategy, where actions are assigned
+dynamically (on-the-fly) updated potencies, changing according to the
+variations of a heuristic distance to the goal configuration as encountered
+during the state-space search. We implement our general idea into a Petri net
+model checker TAPAAL and document its efficiency on a large benchmark of Petri
+net models from the annual Model Checking Contest. The experiments show that
+our heuristic search outperforms the standard search approaches in multiple
+metrics and that it constitutes a worthy addition to the portfolio of classical
+search strategies. </div>
+
 <h2 id="competitions">Competitions</h2>
 
 <ul>
-- 
cgit v1.2.3-70-g09d2