COBISS Kooperativni online bibliografski sistem in servisi COBISS
dr. Sewon Park [61238]
Osebna bibliografija za obdobje 2021-2026
ČLANKI IN DRUGI SESTAVNI DELI
1.01 Izvirni znanstveni članek
1.
KONEČNÝ, Michal, PARK, Sewon, THIES, Holger. Extracting efficient exact real number
computation from proofs in constructive type theory. Journal of logic and computation. Sep. 2025, vol. 35, iss. 6, exae066, 41 str., ilustr. ISSN 0955-792X. https://academic.oup.com/logcom/article/35/6/exae066/7824790, DOI: 10.1093/logcom/exae066. [COBISS.SI-ID 274135299], [JCR, SNIP, WoS do 4. 4. 2026: št. citatov (TC): 2, čistih citatov (CI): 2, čistih citatov na avtorja
(CIAu): 0.67, Scopus do 4. 4. 2026: št. citatov (TC): 2, čistih citatov (CI): 2, čistih citatov na avtorja
(CIAu): 0.67]
2.
PARK, Sewon, BRAUSSE, Franz, COLLINS, Pieter, KIM, SunYoung, KONEČNÝ, Michal, LEE,
Gyesik, MÜLLER, Norbert, NEUMANN, Eike, PREINING, Norbert, ZIEGLER, Martin. Semantics,
specification logic, and Hoare logic of exact real computation. Logical methods in computer science. 2024, vol. 20, iss. 2, [article no.] 17, str. 17:1-17:55. ISSN 1860-5974. https://lmcs.episciences.org/13822, DOI: 10.46298/lmcs-20(2:17)2024. [COBISS.SI-ID 274315523], [JCR, SNIP]
1.08 Objavljeni znanstveni prispevek na konferenci
3.
PARK, Sewon, IGARASHI, Atsushi. Making Rabbit run for security verification of networked
systems with unbounded loops. V: IRFAN, Ahmed (ur.), KAUFMANN, Daniela (ur.). Proceedings of the 25th Conference on Formal Methods in Computer-Aided Design - FMCAD
2025. Wien: TU Wien Academic Press, 2025. Str. 178-187. Formal methods in computer-aided
design, vol. 6. ISBN 978-3-85448-084-6. ISSN 2708-7824. https://doi.org/10.34727/2025/isbn.978-3-85448-084-6_24, DOI: 10.34727/2025/isbn.978-3-85448-084-6_24. [COBISS.SI-ID 274408963]
4.
PARK, Sewon, THIES, Holger. A Coq formalization of Taylor models and power series
for solving ordinary differential equations. V: BERTOT, Yves (ur.), KUTSIA, Temur
(ur.), NORRISH, Michael (ur.). 15th International Conference on Interactive Theorem Proving : ITP 2024, September
9-14, 2024, Tbilisi, Georgia. Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl
Publishing, 2024. Str. 30:1-30:19. Leibniz international proceedings in informatics,
vol. 309. ISBN 978-3-95977-337-9. ISSN 1868-8969. https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2024.30, DOI: 10.4230/LIPIcs.ITP.2024.30. [COBISS.SI-ID 274332931], [SNIP, WoS do 8. 4. 2026: št. citatov (TC): 1, čistih citatov (CI): 1, čistih citatov na avtorja
(CIAu): 0.50, Scopus do 8. 4. 2026: št. citatov (TC): 2, čistih citatov (CI): 2, čistih citatov na avtorja
(CIAu): 1.00]
5.
KONEČNÝ, Michal, PARK, Sewon, THIES, Holger. Formalizing hyperspaces for extracting
efficient exact real computation. V: LEROUX, Jérôme (ur.), LOMBARDY, Sylvain (ur.),
PELEG, David (ur.). 48th International Symposium on Mathematical Foundations of Computer Science : MFCS
2023, August 28 to September 1, 2023, Bordeaux, France. Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl
Publishing, 2023. Str. 59:1-59:16, ilustr. Leibniz international proceedings in informatics,
vol. 272. ISBN 978-3-95977-292-1. ISSN 1868-8969. https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.59, DOI: 10.4230/LIPIcs.MFCS.2023.59. [COBISS.SI-ID 274346499], [SNIP, Scopus do 8. 4. 2026: št. citatov (TC): 2, čistih citatov (CI): 1, čistih citatov na avtorja
(CIAu): 0.33]
6.
PARK, Sewon. Verified exact real computation with nondeterministic functions and limits.
V: FERNAU, Henning (ur.), JANSEN, Klaus (ur.). Fundamentals of computation theory : 24th International Symposium, FCT 2023, Trier,
Germany, September 18-21, 2023 : proceedings. Cham: Springer, cop. 2023. Str. 363-377. Lecture notes in computer science, Advanced
research in computing and software science, 14292. ISBN 978-3-031-43587-4. ISSN 1611-3349.
https://link.springer.com/chapter/10.1007/978-3-031-43587-4_26, DOI: 10.1007/978-3-031-43587-4_26. [COBISS.SI-ID 275624707], [SNIP, WoS, Scopus]
7.
KONEČNÝ, Michal, PARK, Sewon, THIES, Holger. Certified computation of nondeterministic
limits. V: DESHMUKH, Jyotirmoy V. (ur.), HAVELUND, Klaus (ur.), PEREZ, Ivan (ur.).
NASA formal methods : 14th International Symposium, NFM 2022, Pasadena, CA, USA, May
24-27, 2022 : proceedings. Cham: Springer, cop. 2022. Str. 771-789, ilustr. Lecture notes in computer science,
Formal methods, 13260. ISBN 978-3-031-06773-0. ISSN 1611-3349. https://link.springer.com/chapter/10.1007/978-3-031-06773-0_41, DOI: 10.1007/978-3-031-06773-0_41. [COBISS.SI-ID 275618563], [SNIP, WoS do 18. 4. 2026: št. citatov (TC): 5, čistih citatov (CI): 2, čistih citatov na avtorja
(CIAu): 0.67, Scopus do 18. 4. 2026: št. citatov (TC): 6, čistih citatov (CI): 2, čistih citatov na avtorja
(CIAu): 0.67]
8.
KONEČNÝ, Michal, PARK, Sewon, THIES, Holger. Axiomatic reals and certified efficient
exact real computation. V: SILVA, Alexandra (ur.), WASSERMANN, Renata (ur.), QUEIROZ,
Ruy de (ur.). Logic, language, information, and computation : 27th International Workshop, WoLLIC
2021, Virtual Event, October 5-8, 2021 : proceedings. Cham: Springer, cop. 2021. Str. 252-268. Lecture notes in computer science, 13038.
ISBN 978-3-030-88853-4. ISSN 1611-3349. https://link.springer.com/chapter/10.1007/978-3-030-88853-4_16, DOI: 10.1007/978-3-030-88853-4_16. [COBISS.SI-ID 275762691], [SNIP]