Laura Kovács. Reasoning Algebraically About P-Solvable Loops. In C. R. Ramakrishnan, Jakob Rehof, editors, Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceed. Volume 4963 of Lecture Notes in Computer Science, pages 249-264, Springer, 2008. [doi]
@inproceedings{Kovacs08:1,
title = {Reasoning Algebraically About P-Solvable Loops},
author = {Laura Kovács},
year = {2008},
doi = {10.1007/978-3-540-78800-3_18},
url = {http://dx.doi.org/10.1007/978-3-540-78800-3_18},
tags = { algebra},
researchr = {https://researchr.org/publication/Kovacs08%3A1},
cites = {0},
citedby = {0},
pages = {249-264},
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceed},
editor = {C. R. Ramakrishnan and Jakob Rehof},
volume = {4963},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-78799-0},
}