default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJad Hamza
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j4]Jad Hamza
:
On the complexity of linearizability. Computing 101(9): 1227-1240 (2019)- [j3]Jad Hamza, Nicolas Voirol, Viktor Kuncak:
System FR: formalized foundations for the stainless verifier. Proc. ACM Program. Lang. 3(OOPSLA): 166:1-166:30 (2019) - 2018
- [j2]Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza:
On reducing linearizability to state reachability. Inf. Comput. 261: 383-400 (2018) - 2017
- [j1]Mikaël Mayer, Jad Hamza, Viktor Kuncak:
Proactive Synthesis of Recursive Tree-to-String Functions from Examples (Artifact). Dagstuhl Artifacts Ser. 3(2): 16:1-16:2 (2017)
Conference and Workshop Papers
- 2023
- [c16]Rodrigo Raya, Jad Hamza, Viktor Kuncak:
On the Complexity of Convex and Reverse Convex Prequadratic Constraints. LPAR 2023: 350-368 - 2022
- [c15]Jad Hamza, Simon Felix, Viktor Kuncak, Ivo Nussbaumer, Filip Schramka:
From Verified Scala to STIX File System Embedded Code Using Stainless. NFM 2022: 393-410 - 2021
- [c14]Viktor Kuncak, Jad Hamza:
Stainless Verification System Tutorial. FMCAD 2021: 2-7 - 2020
- [c13]Romain Edelmann, Jad Hamza, Viktor Kuncak:
Zippy LL(1) parsing with derivatives. PLDI 2020: 1036-1051 - 2019
- [c12]Jad Hamza, Viktor Kuncak:
Minimal Synthesis of String to String Functions from Examples. VMCAI 2019: 48-69 - 2018
- [c11]Alain Girault, Gregor Gößler, Rachid Guerraoui, Jad Hamza, Dragos-Adrian Seredinschi:
Monotonic Prefix Consistency in Distributed Systems. FORTE 2018: 41-57 - 2017
- [c10]Mikaël Mayer, Jad Hamza, Viktor Kuncak:
Proactive Synthesis of Recursive Tree-to-String Functions from Examples. ECOOP 2017: 19:1-19:30 - [c9]Ahmed Bouajjani, Constantin Enea, Rachid Guerraoui, Jad Hamza:
On verifying causal consistency. POPL 2017: 626-638 - 2015
- [c8]Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza:
Checking Correctness of Concurrent Objects: Tractable Reductions to Reachability (Invited Talk). FSTTCS 2015: 2-4 - [c7]Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza:
On Reducing Linearizability to State Reachability. ICALP (2) 2015: 95-107 - [c6]Jad Hamza:
On the Complexity of Linearizability. NETYS 2015: 308-321 - [c5]Michael Emmi, Constantin Enea, Jad Hamza:
Monitoring refinement via symbolic reasoning. PLDI 2015: 260-269 - [c4]Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza:
Tractable Refinement Checking for Concurrent Objects. POPL 2015: 651-662 - 2014
- [c3]Ahmed Bouajjani, Constantin Enea, Jad Hamza:
Verifying eventual consistency of optimistic replication systems. POPL 2014: 285-296 - 2013
- [c2]Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza:
Verifying Concurrent Programs against Sequential Specifications. ESOP 2013: 290-309 - 2010
- [c1]Jad Hamza, Barbara Jobstmann, Viktor Kuncak:
Synthesis for regular specifications over unbounded domains. FMCAD 2010: 101-109
Informal and Other Publications
- 2022
- [i12]Rodrigo Raya, Jad Hamza, Viktor Kuncak:
NP Decision Procedure for Monomial and Linear Integer Constraints. CoRR abs/2208.02713 (2022) - 2020
- [i11]Georg Stefan Schmid, Olivier Blanvillain, Jad Hamza, Viktor Kuncak:
Coming to Terms with Your Choices: An Existential Take on Dependent Types. CoRR abs/2011.07653 (2020) - 2019
- [i10]Jad Hamza, Nicolas Voirol, Viktor Kuncak:
System FR as Foundations for Stainless. CoRR abs/1904.03482 (2019) - [i9]Rachid Guerraoui, Jad Hamza, Dragos-Adrian Seredinschi, Marko Vukolic:
Can 100 Machines Agree? CoRR abs/1911.07966 (2019) - [i8]Romain Edelmann, Jad Hamza, Viktor Kuncak:
LL(1) Parsing with Derivatives and Zippers. CoRR abs/1911.12737 (2019) - 2017
- [i7]Mikaël Mayer, Jad Hamza, Viktor Kuncak:
Polynomial-Time Proactive Synthesis of Tree-to-String Functions from Examples. CoRR abs/1701.04288 (2017) - [i6]Jad Hamza, Viktor Kuncak:
Minimal Synthesis of String To String Functions From Examples. CoRR abs/1710.09208 (2017) - [i5]Alain Girault, Gregor Gößler, Rachid Guerraoui, Jad Hamza, Dragos-Adrian Seredinschi:
Why You Can't Beat Blockchains: Consistency and High Availability in Distributed Systems. CoRR abs/1710.09209 (2017) - 2016
- [i4]Ahmed Bouajjani, Constantin Enea, Rachid Guerraoui, Jad Hamza:
On Verifying Causal Consistency. CoRR abs/1611.00580 (2016) - [i3]Mikaël Mayer, Jad Hamza:
Optimal Test Sets for Context-Free Languages. CoRR abs/1611.06703 (2016) - 2015
- [i2]Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza:
On Reducing Linearizability to State Reachability. CoRR abs/1502.06882 (2015) - 2014
- [i1]Jad Hamza:
Linearizability is EXPSPACE-complete. CoRR abs/1410.5000 (2014)
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-24 23:06 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:
