Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Tomás Cerný

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Jacob Curtis

> Home > Persons > Tomás Cerný

Publications

2023
[c83]
- view
  authority control:
- export record
  dblp key:
  - conf/closer/AbdelfattahSCCS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/closer/AbdelfattahSCCS23
Amr S. Abdelfattah, Micah Schiewe, Jacob Curtis, Tomás Cerný, Eunjee Song:
Towards Security-Aware Microservices: On Extracting Endpoint Data Access Operations to Determine Access Rights. CLOSER 2023: 15-23
2022
[j19]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/access/SchieweCBC22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/access/SchieweCBC22
Micah Schiewe, Jacob Curtis, Vincent Bushong, Tomás Cerný:
Advancing Static Code Analysis With Language-Agnostic Component Identification. IEEE Access 10: 30743-30761 (2022)
2020
[c46]
- view
  authority control:
- export record
  dblp key:
  - conf/racs/BushongSCDCFBTS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/racs/BushongSCDCFBTS20
Vincent Bushong, Russell Sanders, Jacob Curtis, Mark Du, Tomás Cerný, Karel Frajták, Miroslav Bures, Pavel Tisnovsky, Dongwan Shin:
On Matching Log Analysis to Source Code: A Systematic Mapping Study. RACS 2020: 181-187

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.