default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAli Sezgin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j3]Tatjana Petrov, Claudia Igler
, Ali Sezgin, Thomas A. Henzinger, Calin C. Guet:
Long lived transients in gene regulation. Theor. Comput. Sci. 893: 1-16 (2021)
2010 – 2019
- 2019
- [c14]Calin C. Guet, Thomas A. Henzinger, Claudia Igler, Tatjana Petrov, Ali Sezgin:
Transient Memory in Gene Regulation. CMSB 2019: 155-187 - 2017
- [c13]Shaked Flur, Susmit Sarkar, Christopher Pulte, Kyndylan Nienhuis, Luc Maranget, Kathryn E. Gray, Ali Sezgin, Mark Batty, Peter Sewell:
Mixed-size concurrency: ARM, POWER, C/C++11, and SC. POPL 2017: 429-442 - 2016
- [c12]Andreas Haas, Thomas A. Henzinger, Andreas Holzer, Christoph M. Kirsch, Michael Lippautz, Hannes Payer, Ali Sezgin, Ana Sokolova, Helmut Veith:
Local Linearizability for Concurrent Container-Type Data Structures. CONCUR 2016: 6:1-6:15 - [c11]Shaked Flur, Kathryn E. Gray, Christopher Pulte, Susmit Sarkar, Ali Sezgin, Luc Maranget, Will Deacon, Peter Sewell:
Modelling the ARMv8 architecture, operationally: concurrency and ISA. POPL 2016: 608-621 - 2015
- [j2]Soham Chakraborty, Thomas A. Henzinger, Ali Sezgin, Viktor Vafeiadis:
Aspect-oriented linearizability proofs. Log. Methods Comput. Sci. 11(1) (2015) - [c10]Ali Sezgin, Serdar Tasiran:
Moving Around: Lipton's Reduction for TSO - (Regular Submission). VSTTE 2015: 165-182 - [i3]Andreas Haas, Thomas A. Henzinger, Andreas Holzer, Christoph M. Kirsch, Michael Lippautz, Hannes Payer, Ali Sezgin, Ana Sokolova, Helmut Veith:
Local Linearizability. CoRR abs/1502.07118 (2015) - [i2]Ali Sezgin:
Sequential Consistency and Concurrent Data Structures. CoRR abs/1506.04910 (2015) - 2013
- [c9]Andreas Haas, Michael Lippautz, Thomas A. Henzinger, Hannes Payer, Ana Sokolova, Christoph M. Kirsch, Ali Sezgin:
Distributed queues in shared memory: multicore performance and scalability through quantitative relaxation. Conf. Computing Frontiers 2013: 17:1-17:9 - [c8]Thomas A. Henzinger, Ali Sezgin, Viktor Vafeiadis:
Aspect-Oriented Linearizability Proofs. CONCUR 2013: 242-256 - [c7]Thomas A. Henzinger, Christoph M. Kirsch, Hannes Payer, Ali Sezgin, Ana Sokolova:
Quantitative relaxation of concurrent data structures. POPL 2013: 317-328 - 2012
- [c6]Calin C. Guet, Ashutosh Gupta, Thomas A. Henzinger, Maria Mateescu, Ali Sezgin:
Delayed Continuous-Time Markov Chains for Genetic Regulatory Circuits. CAV 2012: 294-309 - 2010
- [c5]Ali Sezgin, Serdar Tasiran, Kivanç Muslu, Shaz Qadeer:
Run-Time Verification of Optimistic Concurrency. RV 2010: 384-398 - [c4]Tayfun Elmas, Shaz Qadeer, Ali Sezgin, Omer Subasi, Serdar Tasiran:
Simplifying Linearizability Proofs with Reduction and Abstraction. TACAS 2010: 296-311 - [c3]Ali Sezgin, Serdar Tasiran, Shaz Qadeer:
Tressa: Claiming the Future. VSTTE 2010: 25-39
2000 – 2009
- 2009
- [c2]Tayfun Elmas, Ali Sezgin, Serdar Tasiran, Shaz Qadeer:
An annotation assistant for interactive debugging of programs with common synchronization idioms. PADTAD 2009 - [i1]Serdar Tasiran, Ali Sezgin, Shaz Qadeer:
Verifying Optimistic Concurrency: Prophecy Variables and Backward Reasoning. Design and Validation of Concurrent Systems 2009 - 2005
- [j1]Ali Sezgin, Ganesh Gopalakrishnan:
On the definition of sequential consistency. Inf. Process. Lett. 96(6): 193-196 (2005) - [c1]Ali Sezgin, Ganesh Gopalakrishnan:
On the decidability of shared memory consistency verification. MEMOCODE 2005: 199-208 - 2004
- [b1]Ali Sezgin:
Formalization and Verification of Shared Memory. University of Utah, USA, 2004
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-04-25 05:42 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:
