Skip to content

Commit a52faad

Browse files
committed
update ATVA bibtex
1 parent 1b44b10 commit a52faad

File tree

2 files changed

+19
-7
lines changed

2 files changed

+19
-7
lines changed

_posts/2024-10-24-ATVA.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -9,5 +9,5 @@ math: true
99
mermaid: true
1010
attachment: atva2024.pdf
1111
bibtex: atva2024.txt
12-
doi: https://doi.org/10.48550/arXiv.2411.15194
12+
doi: https://doi.org/10.1007/978-3-031-78709-6_14
1313
---

assets/bibtex/atva2024.txt

Lines changed: 18 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,18 @@
1-
@article{abdulla2024guiding,
2-
title={Guiding Word Equation Solving using Graph Neural Networks (Extended Technical Report)},
3-
author={Abdulla, Parosh Aziz and Atig, Mohamed Faouzi and Cailler, Julie and Liang, Chencheng and R{\"u}mmer, Philipp},
4-
journal={arXiv preprint arXiv:2411.15194},
5-
year={2024}
6-
}
1+
@InProceedings{10.1007/978-3-031-78709-6_14,
2+
author="Abdulla, Parosh Aziz
3+
and Atig, Mohamed Faouzi
4+
and Cailler, Julie
5+
and Liang, Chencheng
6+
and R{\"u}mmer, Philipp",
7+
editor="Akshay, S.
8+
and Niemetz, Aina
9+
and Sankaranarayanan, Sriram",
10+
title="Guiding Word Equation Solving Using Graph Neural Networks",
11+
booktitle="Automated Technology for Verification and Analysis",
12+
year="2025",
13+
publisher="Springer Nature Switzerland",
14+
address="Cham",
15+
pages="279--301",
16+
abstract="This paper proposes a Graph Neural Network-guided algorithm for solving word equations, based on the well-known Nielsen transformation for splitting equations. The algorithm iteratively rewrites the first terms of each side of an equation, giving rise to a tree-like search space. The choice of path at each split point of the tree significantly impacts solving time, motivating the use of Graph Neural Networks (GNNs) for efficient split decision-making. Split decisions are encoded as multi-classification tasks, and five graph representations of word equations are introduced to encode their structural information for GNNs. The algorithm is implemented as a solver named DragonLi. Experiments are conducted on artificial and real-world benchmarks. The algorithm performs particularly well on satisfiable problems. For single word equations, DragonLi can solve significantly more problems than well-established string solvers. For the conjunction of multiple word equations, DragonLi is competitive with state-of-the-art string solvers.",
17+
isbn="978-3-031-78709-6"
18+
}

0 commit comments

Comments
 (0)