default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Aleksandar Nanevski
Edificio IMDEA Software, Madrid, Spain
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 52 matches
- 2023
- Jesús Domínguez, Aleksandar Nanevski:
Visibility and Separability for a Declarative Linearizability Proof of the Timestamped Stack. CONCUR 2023: 30:1-30:16 - Jesús Domínguez, Aleksandar Nanevski:
Declarative Linearizability Proofs for Descriptor-Based Concurrent Helping Algorithms. CoRR abs/2307.04653 (2023) - Jesús Domínguez, Aleksandar Nanevski:
Visibility and Separability for a Declarative Linearizability Proof of the Timestamped Stack: Extended Version. CoRR abs/2307.04720 (2023) - 2022
- Joakim Öhman, Aleksandar Nanevski:
Visibility reasoning for concurrent snapshot algorithms. Proc. ACM Program. Lang. 6(POPL): 1-30 (2022) - 2021
- Frantisek Farka, Aleksandar Nanevski, Anindya Banerjee, Germán Andrés Delbianco, Ignacio Fábregas:
On algebraic abstractions for concurrent separation logics. Proc. ACM Program. Lang. 5(POPL): 1-32 (2021) - Nikita Zyuzin, Aleksandar Nanevski:
Contextual modal types for algebraic effects and handlers. Proc. ACM Program. Lang. 5(ICFP): 1-29 (2021) - Nikita Zyuzin, Aleksandar Nanevski:
Contextual Modal Types for Algebraic Effects and Handlers. CoRR abs/2103.02976 (2021) - Joakim Öhman, Aleksandar Nanevski:
Visibility Reasoning for Concurrent Snapshot Algorithms. CoRR abs/2110.02769 (2021) - 2020
- Yotam M. Y. Feldman, Artem Khyzha, Constantin Enea, Adam Morrison, Aleksandar Nanevski, Noam Rinetzky, Sharon Shoham:
Proving highly-concurrent traversals correct. Proc. ACM Program. Lang. 4(OOPSLA): 128:1-128:29 (2020) - Yotam M. Y. Feldman, Artem Khyzha, Constantin Enea, Adam Morrison, Aleksandar Nanevski, Noam Rinetzky, Sharon Shoham:
Proving Highly-Concurrent Traversals Correct. CoRR abs/2010.00911 (2020) - Frantisek Farka, Aleksandar Nanevski, Anindya Banerjee, Germán Andrés Delbianco, Ignacio Fábregas:
On Algebraic Abstractions for Concurrent Separation Logics. CoRR abs/2010.12686 (2020) - 2019
- Aleksandar Nanevski, Anindya Banerjee, Germán Andrés Delbianco, Ignacio Fábregas:
Specifying concurrent programs in separation logic: morphisms and simulations. Proc. ACM Program. Lang. 3(OOPSLA): 161:1-161:30 (2019) - Aleksandar Nanevski, Anindya Banerjee, Germán Andrés Delbianco, Ignacio Fábregas:
Specifying Concurrent Programs in Separation Logic: Morphisms and Simulations. CoRR abs/1904.07136 (2019) - 2017
- Germán Andrés Delbianco, Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee:
Concurrent Data Structures Linked in Time (Artifact). Dagstuhl Artifacts Ser. 3(2): 04:1-04:4 (2017) - Germán Andrés Delbianco, Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee:
Concurrent Data Structures Linked in Time. ECOOP 2017: 8:1-8:30 - Aleksandar Nanevski, Anindya Banerjee, Germán Andrés Delbianco:
Subjective Simulation as a Notion of Morphism for Composing Concurrent Resources. CoRR abs/1709.07741 (2017) - 2016
- Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee, Germán Andrés Delbianco:
Hoare-style specifications as correctness conditions for non-linearizable concurrent objects. OOPSLA 2016: 92-110 - Germán Andrés Delbianco, Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee:
Concurrent Data Structures Linked in Time. CoRR abs/1604.08080 (2016) - Anton Podkopaev, Ilya Sergey, Aleksandar Nanevski:
Operational Aspects of C/C++ Concurrency. CoRR abs/1606.01400 (2016) - 2015
- Beta Ziliani, Derek Dreyer, Neelakantan R. Krishnaswami, Aleksandar Nanevski, Viktor Vafeiadis:
Mtac: A monad for typed tactic programming in Coq. J. Funct. Program. 25 (2015) - Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee:
Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity. ESOP 2015: 333-358 - Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee:
Mechanized verification of fine-grained concurrent programs. PLDI 2015: 77-87 - Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee, Germán Andrés Delbianco:
Hoare-style Specifications as Correctness Conditions for Non-linearizable Concurrent Objects. CoRR abs/1509.06220 (2015) - 2014
- Aleksandar Nanevski, Ruy Ley-Wild, Ilya Sergey, Germán Andrés Delbianco:
Communicating State Transition Systems for Fine-Grained Concurrent Resources. ESOP 2014: 290-310 - Shachar Itzhaky, Anindya Banerjee, Neil Immerman, Ori Lahav, Aleksandar Nanevski, Mooly Sagiv:
Modular reasoning about heap paths via effectively propositional formulas. POPL 2014: 385-396 - Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee:
Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity. CoRR abs/1410.0306 (2014) - 2013
- Murdoch James Gabbay, Aleksandar Nanevski:
Denotation of contextual modal type theory (CMTT): Syntax and meta-programming. J. Appl. Log. 11(1): 1-29 (2013) - Georges Gonthier, Beta Ziliani, Aleksandar Nanevski, Derek Dreyer:
How to make ad hoc proof automation less ad hoc. J. Funct. Program. 23(4): 357-401 (2013) - Aleksandar Nanevski, Anindya Banerjee, Deepak Garg:
Dependent Type Theory for Verification of Information Flow and Access Control Policies. ACM Trans. Program. Lang. Syst. 35(2): 6:1-6:41 (2013) - Shachar Itzhaky, Anindya Banerjee, Neil Immerman, Aleksandar Nanevski, Mooly Sagiv:
Effectively-Propositional Reasoning about Reachability in Linked Data Structures. CAV 2013: 756-772
skipping 22 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-07 07:15 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint