Jad Hamza

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 28

Top Topics

Symbolic Reasoning

Top Venues

Publications

Rodrigo Raya, Jad Hamza, Viktor Kuncak
On the Complexity of Convex and Reverse Convex Prequadratic Constraints. LPAR (2023)
Rodrigo Raya, Jad Hamza, Viktor Kuncak
NP Decision Procedure for Monomial and Linear Integer Constraints. CoRR (2022)
Jad Hamza, Simon Felix, Viktor Kuncak, Ivo Nussbaumer, Filip Schramka
From Verified Scala to STIX File System Embedded Code Using Stainless. NFM (2022)
Viktor Kuncak, Jad Hamza
Stainless Verification System Tutorial. FMCAD (2021)
Georg Stefan Schmid, Olivier Blanvillain, Jad Hamza, Viktor Kuncak
Coming to Terms with Your Choices: An Existential Take on Dependent Types. CoRR (2020)
Romain Edelmann, Jad Hamza, Viktor Kuncak
Zippy LL(1) parsing with derivatives. PLDI (2020)
Jad Hamza, Nicolas Voirol, Viktor Kuncak
System FR: formalized foundations for the stainless verifier. Proc. ACM Program. Lang. 3 (OOPSLA) (2019)
Jad Hamza, Nicolas Voirol, Viktor Kuncak
System FR as Foundations for Stainless. CoRR (2019)
Rachid Guerraoui, Jad Hamza, Dragos-Adrian Seredinschi, Marko Vukolic
Can 100 Machines Agree? CoRR (2019)
Jad Hamza, Viktor Kuncak
Minimal Synthesis of String to String Functions from Examples. VMCAI (2019)
Romain Edelmann, Jad Hamza, Viktor Kuncak
LL(1) Parsing with Derivatives and Zippers. CoRR (2019)
Jad Hamza
On the complexity of linearizability. Computing 101 (9) (2019)
Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza
On reducing linearizability to state reachability. Inf. Comput. 261 (2018)
Alain Girault, Gregor Gößler, Rachid Guerraoui, Jad Hamza, Dragos-Adrian Seredinschi
Monotonic Prefix Consistency in Distributed Systems. FORTE (2018)
Jad Hamza, Viktor Kuncak
Minimal Synthesis of String To String Functions From Examples. CoRR (2017)
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 (2017)
Mikaël Mayer, Jad Hamza, Viktor Kuncak
Proactive Synthesis of Recursive Tree-to-String Functions from Examples (Artifact). Dagstuhl Artifacts Ser. 3 (2) (2017)
Mikaël Mayer, Jad Hamza, Viktor Kuncak
Proactive Synthesis of Recursive Tree-to-String Functions from Examples. ECOOP (2017)
Ahmed Bouajjani, Constantin Enea, Rachid Guerraoui, Jad Hamza
On verifying causal consistency. POPL (2017)
Mikaël Mayer, Jad Hamza, Viktor Kuncak
Polynomial-Time Proactive Synthesis of Tree-to-String Functions from Examples. CoRR (2017)
Mikaël Mayer, Jad Hamza
Optimal Test Sets for Context-Free Languages. CoRR (2016)
Ahmed Bouajjani, Constantin Enea, Rachid Guerraoui, Jad Hamza
On Verifying Causal Consistency. CoRR (2016)
Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza
On Reducing Linearizability to State Reachability. CoRR (2015)
Michael Emmi, Constantin Enea, Jad Hamza
Monitoring refinement via symbolic reasoning. PLDI (2015)
Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza
On Reducing Linearizability to State Reachability. ICALP (2) (2015)
Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza
Tractable Refinement Checking for Concurrent Objects. POPL (2015)
Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza
Checking Correctness of Concurrent Objects: Tractable Reductions to Reachability (Invited Talk). FSTTCS (2015)
Jad Hamza
On the Complexity of Linearizability. NETYS (2015)
Jad Hamza
Linearizability is EXPSPACE-complete. CoRR (2014)
Ahmed Bouajjani, Constantin Enea, Jad Hamza
Verifying eventual consistency of optimistic replication systems. POPL (2014)
Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza
Verifying Concurrent Programs against Sequential Specifications. ESOP (2013)
Jad Hamza, Barbara Jobstmann, Viktor Kuncak
Synthesis for regular specifications over unbounded domains. FMCAD (2010)