default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTajana Ban Kirigin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Tajana Ban Kirigin
, Jesse Comer, Max I. Kanovich, Andre Scedrov, Carolyn L. Talcott:
Time-Bounded Resilience. WRLA 2024: 22-44- [i5]Tajana Ban Kirigin, Jesse Comer, Max I. Kanovich, Andre Scedrov, Carolyn L. Talcott:
Technical Report: Time-Bounded Resilience. CoRR abs/2401.05585 (2024) - 2023
- [j8]Benedikt Perak, Tajana Ban Kirigin:
Construction Grammar Conceptual Network: Coordination-based graph method for semantic association analysis. Nat. Lang. Eng. 29(3): 584-614 (2023) - 2022
- [j7]Tajana Ban Kirigin, Sanda Bujacic, Benedikt Perak:
Graph-Based Taxonomic Semantic Class Labeling. Future Internet 14(12): 383 (2022) - [j6]Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
On the Security and Complexity of Periodic Systems. SN Comput. Sci. 3(5): 356 (2022) - [c14]Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
On the Formalization and Computational Complexity of Resilience Problems for Cyber-Physical Systems. ICTAC 2022: 96-113 - 2021
- [j5]Abraão Aires Urquiza, Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Resource and timing aspects of security protocols. J. Comput. Secur. 29(3): 299-340 (2021) - [c13]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
On the Complexity of Verification of Time-Sensitive Distributed Systems. Protocols, Strands, and Logic 2021: 251-275 - [c12]Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
On Security Analysis of Periodic Systems: Expressiveness and Complexity. ICISSP 2021: 43-54 - [i4]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
On the Complexity of Verification of Time-Sensitive Distributed Systems: Technical Report. CoRR abs/2105.03531 (2021) - 2020
- [c11]Tajana Ban Kirigin, Benedikt Perak:
There's No Time, The Problem of Conceptualising Time. Logic, Language, and Security 2020: 61-68 - [e1]Vivek Nigam, Tajana Ban Kirigin, Carolyn L. Talcott, Joshua D. Guttman, Stepan L. Kuznetsov, Boon Thau Loo, Mitsuhiro Okada:
Logic, Language, and Security - Essays Dedicated to Andre Scedrov on the Occasion of His 65th Birthday. Lecture Notes in Computer Science 12300, Springer 2020, ISBN 978-3-030-62076-9 [contents]
2010 – 2019
- 2019
- [c10]Musab A. AlTurki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
A Multiset Rewriting Model for Specifying and Verifying Timing Aspects of Security Protocols. Foundations of Security, Protocols, and Equational Reasoning 2019: 192-213 - [c9]Abraão Aires Urquiza, Musab A. AlTurki, Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Resource-Bounded Intruders in Denial of Service Attacks. CSF 2019: 382-396 - 2018
- [c8]Musab A. AlTurki, Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Statistical Model Checking of Distance Fraud Attacks on the Hancke-Kuhn Family of Protocols. CPS-SPC@CCS 2018: 60-71 - [i3]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Compliance in Real Time Multiset Rewriting Models. CoRR abs/1811.04826 (2018) - 2017
- [j4]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Time, computational complexity, and probability in the analysis of distance-bounding protocols. J. Comput. Secur. 25(6): 585-630 (2017) - [j3]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott, Ranko Perovic:
A rewriting framework and logic for activities subject to regulations. Math. Struct. Comput. Sci. 27(3): 332-375 (2017) - [i2]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Time, Computational Complexity, and Probability in the Analysis of Distance-Bounding Protocols. CoRR abs/1702.03504 (2017) - 2016
- [c7]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems. FORMATS 2016: 228-244 - [i1]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems. CoRR abs/1606.07886 (2016) - 2015
- [c6]Tajana Ban Kirigin, Ana Mestrovic, Sanda Martincic-Ipsic:
Towards a Formal Model of Language Networks. ICIST 2015: 469-479 - [c5]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Discrete vs. Dense Times in the Analysis of Cyber-Physical Security Protocols. POST 2015: 259-279 - 2014
- [j2]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov:
Bounded memory protocols. Comput. Lang. Syst. Struct. 40(3-4): 137-154 (2014) - [j1]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov:
Bounded memory Dolev-Yao adversaries in collaborative systems. Inf. Comput. 238: 233-261 (2014) - 2013
- [c4]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov:
Bounded Memory Protocols and Progressing Collaborative Systems. ESORICS 2013: 309-326 - 2012
- [c3]Vivek Nigam, Tajana Ban Kirigin, Andre Scedrov, Carolyn L. Talcott, Max I. Kanovich, Ranko Perovic:
Towards an automated assistant for clinical investigations. IHI 2012: 773-778 - [c2]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott, Ranko Perovic:
A Rewriting Framework for Activities Subject to Regulations. RTA 2012: 305-322 - 2010
- [c1]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov:
Bounded Memory Dolev-Yao Adversaries in Collaborative Systems. Formal Aspects in Security and Trust 2010: 18-33
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
