resume: add publications

3 files changed, 77 insertions, 0 deletions

diff --git a/src/js/showhide.js b/src/js/showhide.js
new file mode 100644
index 0000000..afc9c06
--- /dev/null
+++ b/src/js/showhide.js
@@ -0,0 +1,27 @@
+/*
+http://www.tutorialhelpdesk.com/tutorials/web-development/javascript/how-to-show-hide-a-dhtml-div-using-onclick()-event.html
+*/
+
+function ShowHide(elementId)
+{
+	var element = document.getElementById(elementId);
+	if(element.style.display != "block")
+	{
+		element.style.display = "block";
+	}
+	else
+	{
+		element.style.display = "none";
+	}
+}
+function UpdateText(element)
+{
+	if(element.innerHTML.indexOf("Hide") == -1)
+	{
+		element.innerHTML = "Hide Abstract";
+	}
+	else
+	{
+		element.innerHTML = "Abstract";
+	}
+}
diff --git a/src/resume-da.md b/src/resume-da.md
index 8f5da75..9cf7d48 100644
--- a/src/resume-da.md
+++ b/src/resume-da.md
@@ -1,3 +1,5 @@
+<script type="text/javascript" language="javascript" src="js/showhide.js"></script>
+
 #### [ [English](/resume) / Dansk ]
 
 # Adam Stück
@@ -72,6 +74,29 @@
 * Kandidat i Datalogi - 2-årig uddannelse <small>(undervejs)</small>
 * Bachelor i Datalogi - 3-årig uddannelse
 
+## Publikationer
+
+[1] **Potency-Based Heuristic Search with Randomness for Explicit Model Checking**<br>
+by E.G.Henriksen, A.M. Khorsid, E. Nielsen, Th. Risager, [J. Srba](http://www.cs.aau.dk/~srba), **A.M. Stück**, S. Sørensen<br>
+In Proceedings of the 29th International SPIN Symposium on Model Checking of Software (SPIN'23), LNCS, pages 1--8, Springer-Verlag, 2023.<br>
+*To appear.*<br>
+[PDF](http://www.cs.aau.dk/~srba/files/HKNRSSS:SPIN:23.pdf) &nbsp; [BibTex](https://homes.cs.aau.dk/~srba/srba.html#HKNRSSS:SPIN:23) 
+&nbsp; <a onclick="ShowHide('HKNRSSS:SPIN:23');UpdateText(this);" href="javascript:void(0)">Abstract</a>
+
+<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>
+
 ## Konkurrencer
 
 * 2022: Senior Qualifier i De Danske Cybermesterskaber
diff --git a/src/resume.md b/src/resume.md
index 91bce10..d13cf89 100644
--- a/src/resume.md
+++ b/src/resume.md
@@ -1,3 +1,5 @@
+<script type="text/javascript" language="javascript" src="js/showhide.js"></script>
+
 #### [ English / [Dansk](/resume-da) ]
 
 # Adam Stück
@@ -72,6 +74,29 @@
 * Masters Degree in Computer Science - 2 Year Program <small>(In progress)</small>
 * Bachelors Degree in Computer Science - 3 Year Program
 
+## Publications
+
+[1] **Potency-Based Heuristic Search with Randomness for Explicit Model Checking**<br>
+by E.G.Henriksen, A.M. Khorsid, E. Nielsen, Th. Risager, [J. Srba](http://www.cs.aau.dk/~srba), **A.M. Stück**, S. Sørensen<br>
+In Proceedings of the 29th International SPIN Symposium on Model Checking of Software (SPIN'23), LNCS, pages 1--8, Springer-Verlag, 2023.<br>
+*To appear.*<br>
+[PDF](http://www.cs.aau.dk/~srba/files/HKNRSSS:SPIN:23.pdf) &nbsp; [BibTex](https://homes.cs.aau.dk/~srba/srba.html#HKNRSSS:SPIN:23) 
+&nbsp; <a onclick="ShowHide('HKNRSSS:SPIN:23');UpdateText(this);" href="javascript:void(0)">Abstract</a>
+
+<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>
+
 ## Competitions
 
 * 2022: Senior Qualifier in the Danish Cyber Championships