diff options
| -rw-r--r-- | dst/js/showhide.js | 27 | ||||
| -rw-r--r-- | dst/resume-da.html | 25 | ||||
| -rw-r--r-- | dst/resume.html | 25 | ||||
| -rw-r--r-- | dst/sitemap.xml | 20 | ||||
| -rw-r--r-- | src/js/showhide.js | 27 | ||||
| -rw-r--r-- | src/resume-da.md | 25 | ||||
| -rw-r--r-- | src/resume.md | 25 |
7 files changed, 164 insertions, 10 deletions
diff --git a/dst/js/showhide.js b/dst/js/showhide.js new file mode 100644 index 0000000..afc9c06 --- /dev/null +++ b/dst/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/dst/resume-da.html b/dst/resume-da.html index fcd7e4b..ba8a627 100644 --- a/dst/resume-da.html +++ b/dst/resume-da.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-">[ <a href="/resume">English</a> / Dansk ]</h4> <h1 id="adam-stck">Adam Stück</h1> @@ -108,6 +110,29 @@ <li>Bachelor i Datalogi - 3-årig uddannelse</li> </ul> +<h2 id="publikationer">Publikationer</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’23), LNCS, pages 1–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>   <a href="https://homes.cs.aau.dk/~srba/srba.html#HKNRSSS:SPIN:23">BibTex</a> +  <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="konkurrencer">Konkurrencer</h2> <ul> 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 / <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’23), LNCS, pages 1–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>   <a href="https://homes.cs.aau.dk/~srba/srba.html#HKNRSSS:SPIN:23">BibTex</a> +  <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> diff --git a/dst/sitemap.xml b/dst/sitemap.xml index 6dbc78e..f84abdb 100644 --- a/dst/sitemap.xml +++ b/dst/sitemap.xml @@ -4,14 +4,14 @@ xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9 http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd" xmlns="http://www.sitemaps.org/schemas/sitemap/0.9"> -<url><loc>https://adast.xyz/uses.html</loc><lastmod>2023-03-24</lastmod><priority>1.0</priority></url> -<url><loc>https://adast.xyz/resume.html</loc><lastmod>2023-03-24</lastmod><priority>1.0</priority></url> -<url><loc>https://adast.xyz/2023-02-log.html</loc><lastmod>2023-03-24</lastmod><priority>1.0</priority></url> -<url><loc>https://adast.xyz/projects.html</loc><lastmod>2023-03-24</lastmod><priority>1.0</priority></url> -<url><loc>https://adast.xyz/resume-da.html</loc><lastmod>2023-03-24</lastmod><priority>1.0</priority></url> -<url><loc>https://adast.xyz/arena.html</loc><lastmod>2023-03-24</lastmod><priority>1.0</priority></url> -<url><loc>https://adast.xyz/donate.html</loc><lastmod>2023-03-24</lastmod><priority>1.0</priority></url> -<url><loc>https://adast.xyz/now.html</loc><lastmod>2023-03-24</lastmod><priority>1.0</priority></url> -<url><loc>https://adast.xyz/services.html</loc><lastmod>2023-03-24</lastmod><priority>1.0</priority></url> -<url><loc>https://adast.xyz/index.html</loc><lastmod>2023-03-24</lastmod><priority>1.0</priority></url> +<url><loc>https://adast.xyz/uses.html</loc><lastmod>2023-03-25</lastmod><priority>1.0</priority></url> +<url><loc>https://adast.xyz/resume.html</loc><lastmod>2023-03-25</lastmod><priority>1.0</priority></url> +<url><loc>https://adast.xyz/2023-02-log.html</loc><lastmod>2023-03-25</lastmod><priority>1.0</priority></url> +<url><loc>https://adast.xyz/projects.html</loc><lastmod>2023-03-25</lastmod><priority>1.0</priority></url> +<url><loc>https://adast.xyz/resume-da.html</loc><lastmod>2023-03-25</lastmod><priority>1.0</priority></url> +<url><loc>https://adast.xyz/arena.html</loc><lastmod>2023-03-25</lastmod><priority>1.0</priority></url> +<url><loc>https://adast.xyz/donate.html</loc><lastmod>2023-03-25</lastmod><priority>1.0</priority></url> +<url><loc>https://adast.xyz/now.html</loc><lastmod>2023-03-25</lastmod><priority>1.0</priority></url> +<url><loc>https://adast.xyz/services.html</loc><lastmod>2023-03-25</lastmod><priority>1.0</priority></url> +<url><loc>https://adast.xyz/index.html</loc><lastmod>2023-03-25</lastmod><priority>1.0</priority></url> </urlset> 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) [BibTex](https://homes.cs.aau.dk/~srba/srba.html#HKNRSSS:SPIN:23) + <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) [BibTex](https://homes.cs.aau.dk/~srba/srba.html#HKNRSSS:SPIN:23) + <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 |