default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFilip Niksic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c9]Konstantinos Kallas, Filip Niksic, Caleb Stanford
, Rajeev Alur:
Stream processing with dependency-guided synchronization. PPoPP 2022: 1-16- 2021
- [c8]Rui Abreu, Franjo Ivancic, Filip Niksic, Hadi Ravanbakhsh, Ramesh Viswanathan:
Reducing Time-To-Fix For Fuzzer Bugs. ASE 2021: 1126-1130 - [c7]Rajeev Alur, Phillip Hilliard, Zachary G. Ives, Konstantinos Kallas, Konstantinos Mamouras, Filip Niksic, Caleb Stanford, Val Tannen, Anton Xue:
Synchronization Schemas. PODS 2021: 1-18 - [i3]Konstantinos Kallas, Filip Niksic, Caleb Stanford, Rajeev Alur:
Stream Processing With Dependency-Guided Synchronization. CoRR abs/2104.04512 (2021) - 2020
- [j4]Konstantinos Kallas, Filip Niksic, Caleb Stanford, Rajeev Alur:
DiffStream: differential output testing for stream processing programs. Proc. ACM Program. Lang. 4(OOPSLA): 153:1-153:29 (2020) - [j3]Cezara Dragoi, Constantin Enea, Burcu Kulahcioglu Ozkan, Rupak Majumdar, Filip Niksic:
Testing consensus implementations using communication closure. Proc. ACM Program. Lang. 4(OOPSLA): 210:1-210:29 (2020)
2010 – 2019
- 2019
- [b1]Filip Niksic:
Combinatorial Constructions for Effective Testing. Kaiserslautern University of Technology, Germany, 2019 - [c6]Burcu Kulahcioglu Ozkan, Rupak Majumdar, Filip Niksic:
Checking linearizability using hitting families. PPoPP 2019: 366-377 - 2018
- [j2]Burcu Kulahcioglu Ozkan, Rupak Majumdar, Filip Niksic, Mitra Tabaei Befrouei, Georg Weissenbacher:
Randomized testing of distributed systems with probabilistic guarantees. Proc. ACM Program. Lang. 2(OOPSLA): 160:1-160:28 (2018) - [j1]Rupak Majumdar, Filip Niksic:
Why is random testing effective for partition tolerance bugs? Proc. ACM Program. Lang. 2(POPL): 46:1-46:24 (2018) - 2016
- [c5]Dmitry Chistikov, Rupak Majumdar, Filip Niksic:
Hitting Families of Schedules for Asynchronous Programs. CAV (2) 2016: 157-176 - [i2]Dmitry Chistikov, Rupak Majumdar, Filip Niksic:
Hitting Families of Schedules for Asynchronous Programs. CoRR abs/1602.03755 (2016) - 2015
- [c4]Ivan Gavran, Filip Niksic, Aditya Kanade, Rupak Majumdar, Viktor Vafeiadis:
Rely/Guarantee Reasoning for Asynchronous Programs. CONCUR 2015: 483-496 - [c3]Sumit Gulwani, Mikaël Mayer, Filip Niksic, Ruzica Piskac:
StriSynth: Synthesis for Live Programming. ICSE (2) 2015: 701-704 - 2014
- [c2]Javier Esparza, Ruslán Ledesma-Garza, Rupak Majumdar, Philipp J. Meyer, Filip Niksic:
An SMT-Based Approach to Coverability Analysis. CAV 2014: 603-619 - 2013
- [c1]Johannes Kloos, Rupak Majumdar, Filip Niksic, Ruzica Piskac:
Incremental, Inductive Coverability. CAV 2013: 158-173 - [i1]Johannes Kloos, Rupak Majumdar, Filip Niksic, Ruzica Piskac:
Incremental, Inductive Coverability. CoRR abs/1301.7321 (2013)
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 2025-03-04 21:21 CET 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:
