TY  - CHAP
AU  - Babati, Bence
AU  - Pataki, Norbert
ED  - Theodore, Simos
ED  - Charalambos, Tsitouras
TI  - Static analysis of functors’ mathematical properties in C++ source code
T2  - Proceedings of the International Conference on Numerical Analysis and Applied Mathematics (ICNAAM-2018)
PB  - American Institute of Physics (AIP)
CY  - College Park (MD)
SN  - 9780735418547
T3  - AIP Conference Proceedings, ISSN 0094-243X ; 2116.
PY  - 2019
PG  - 4
DO  - 10.1063/1.5114355
UR  - https://m2.mtmt.hu/api/publication/30746433
ID  - 30746433
LA  - English
DB  - MTMT
ER  - 

TY  - CHAP
AU  - Babati, Bence
AU  - Horváth, Gábor
AU  - Pataki, Norbert
AU  - Attila, Páter-Részeg
ED  - Eleftherakis, G.
ED  - Lazarova, M.
ED  - Aleksieva-Petrova, A.
ED  - Tasheva, A.
TI  - On the Validated Usage of the C++ Standard Template Library
T2  - Proceedings of the 9th Balkan Conference on Informatics - BCI'19
PB  - Association for Computing Machinery
CY  - New York, New York
SN  - 9781450371933
PY  - 2019
PG  - 8
DO  - 10.1145/3351556.3351570
UR  - https://m2.mtmt.hu/api/publication/30796615
ID  - 30796615
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Horváth, Gábor
AU  - Pataki, Norbert
TI  - Transparent functors for the C++ Standard Template Library
JF  - CEUR WORKSHOP PROCEEDINGS
J2  - CEUR WORKSHOP PROC
VL  - 2046
PY  - 2018
SP  - 96
EP  - 101
PG  - 6
SN  - 1613-0073
UR  - https://m2.mtmt.hu/api/publication/27079068
ID  - 27079068
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Babati, Bence
AU  - Pataki, Norbert
TI  - Analysis of Include Dependencies in C++ Source Code
JF  - ACSIS-ANNALS OF COMPUTER SCIENCE AND INFORMATION SYSTEMS
J2  - ACSIS ANNALS COMP SCI INFORMATION SYST
VL  - 13
PY  - 2017
SP  - 149
EP  - 156
PG  - 8
SN  - 2300-5963
DO  - 10.15439/2017F358
UR  - https://m2.mtmt.hu/api/publication/3272050
ID  - 3272050
LA  - English
DB  - MTMT
ER  - 

TY  - CHAP
AU  - Horváth, Gábor
AU  - Pataki, Norbert
ED  - Stefan, Marr
ED  - Eric, Jul
TI  - Source language representation of function summaries in static analysis
T2  - Proceedings of the 11th Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems
PB  - ACM Press
CY  - New York, New York
SN  - 9781450348379
PY  - 2016
PG  - 9
DO  - 10.1145/3012408.3012414
UR  - https://m2.mtmt.hu/api/publication/3170466
ID  - 3170466
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Horváth, Gábor
AU  - Pataki, Norbert
TI  - Clang matchers for verified usage of the C++ Standard Template Library
JF  - ANNALES MATHEMATICAE ET INFORMATICAE
J2  - ANN MATH INFORM
VL  - 44
PY  - 2015
SP  - 99
EP  - 109
PG  - 11
SN  - 1787-5021
UR  - https://m2.mtmt.hu/api/publication/2906009
ID  - 2906009
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Pataki, Norbert
AU  - Cséri, Tamás
AU  - Szűgyi, Zalán
TI  - Task-specific style verification
JF  - AIP CONFERENCE PROCEEDINGS
J2  - AIP CONF PROC
VL  - 1479
PY  - 2012
SP  - 490
EP  - 493
PG  - 4
SN  - 0094-243X
DO  - 10.1063/1.4756173
UR  - https://m2.mtmt.hu/api/publication/2362920
ID  - 2362920
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Pataki, Norbert
TI  - Advanced Functor Framework for C++ Standard Template Library
JF  - STUDIA UNIVERSITATIS BABES-BOLYAI SERIES INFORMATICA
J2  - STUD UNIV BABES-BOLYAI SER INFO
VL  - 56
PY  - 2011
IS  - 1
SP  - 99
EP  - 113
PG  - 15
SN  - 1224-869X
UR  - https://m2.mtmt.hu/api/publication/1994014
ID  - 1994014
LA  - English
DB  - MTMT
ER  - 

TY  - CHAP
AU  - Pataki, Norbert
ED  - Pop, Horia
ED  - Antal, Bege
TI  - C++ Standard Template Library by Safe Functors
T2  - MaCS 2010
PB  - Novadat
CY  - Győr
SN  - 9789639056381
PY  - 2011
SP  - 363
EP  - 374
PG  - 12
UR  - https://m2.mtmt.hu/api/publication/1993993
ID  - 1993993
LA  - English
DB  - MTMT
ER  - 

TY  - CHAP
AU  - Pataki, Norbert
AU  - Porkoláb, Zoltán
ED  - Maria, Ganzha
ED  - Leszek, A Maciaszek
ED  - Marcin, Paprzycki
TI  - Extension of iterator traits in the C++ standard template library. 2011 Federated Conference on Computer Science and Information Systems, FedCSIS 2011
TS  - 2011 Federated Conference on Computer Science and Information Systems, FedCSIS 2011
T2  - 2011 Federated Conference on Computer Science and Information Systems, FedCSIS 2011
PB  - IEEE Computer Society Press
CY  - Szczecin
SN  - 9781457700415
PY  - 2011
SP  - 911
EP  - 914
PG  - 4
UR  - https://m2.mtmt.hu/api/publication/1995782
ID  - 1995782
AB  - The C++ Standard Template Library is the flagship example for libraries based on the generic programming paradigm. The usage of this library is intended to minimize classical C/C++ error, but does not warrant bug-free programs. Furthermore, many new kinds of errors may arise from the inaccurate use of the generic programming paradigm, like dereferencing invalid iterators or misunderstanding remove-like algorithms. In this paper we present typical scenarios, that can cause runtime problems. We emit warnings while these constructs are used without any modification in the compiler. We argue for an extension of the STL's iterator traits in order to emit these warnings. We also present a general approach to emit "customized" warnings. We support the so-called believe-me marks to disable warnings. © 2011 Polish Info Processing Soc.
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Pataki, Norbert
AU  - Szűgyi, Zalán
AU  - Dévai, Gergely
TI  - Measuring the overhead of C++ standard template library safe variants
JF  - ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE
J2  - ELECTR NOTES COMPUT SCI
VL  - 264
PY  - 2011
IS  - 5
SP  - 71
EP  - 83
PG  - 13
SN  - 1571-0661
DO  - 10.1016/j.entcs.2011.06.005
UR  - https://m2.mtmt.hu/api/publication/1996312
ID  - 1996312
AB  - The C++ Standard Template Library is a widely-used library that is based on the generic programming paradigm. The usage of this library does not warrant bug-free programs. Furthermore, many new errors may arise from the inaccurate use of the generic programming paradigm, like dereferencing invalid iterators or misunderstanding remove-like algorithms. Most of the STL algorithms have preconditions which are checked neither at compilation time nor at runtime. Violation of such a precondition results in undefined behaviour. In this paper we propose solutions for a subset of these problems. The techniques we describe help programmers use generic algorithms on sorted intervals in a safer way. We present a new iterator adaptor type and tag as well as safe containers which keep track their iterators validness. We measure the runtime overhead of these extensions. © 2011 Elsevier B.V. All rights reserved.
LA  - English
DB  - MTMT
ER  -