Jad Hamza

According to our database1, Jad Hamza authored at least 23 papers between 2010 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Coming to Terms with Your Choices: An Existential Take on Dependent Types.
CoRR, 2020

Zippy LL(1) parsing with derivatives.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

2019
System FR: formalized foundations for the stainless verifier.
Proc. ACM Program. Lang., 2019

LL(1) Parsing with Derivatives and Zippers.
CoRR, 2019

Can 100 Machines Agree?
CoRR, 2019

System FR as Foundations for Stainless.
CoRR, 2019

On the complexity of linearizability.
Computing, 2019

Minimal Synthesis of String to String Functions from Examples.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2019

2018
On reducing linearizability to state reachability.
Inf. Comput., 2018

Monotonic Prefix Consistency in Distributed Systems.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2018

2017
Proactive Synthesis of Recursive Tree-to-String Functions from Examples (Artifact).
Dagstuhl Artifacts Ser., 2017

Why You Can't Beat Blockchains: Consistency and High Availability in Distributed Systems.
CoRR, 2017

Polynomial-Time Proactive Synthesis of Tree-to-String Functions from Examples.
CoRR, 2017

On verifying causal consistency.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Proactive Synthesis of Recursive Tree-to-String Functions from Examples.
Proceedings of the 31st European Conference on Object-Oriented Programming, 2017

2016
Optimal Test Sets for Context-Free Languages.
CoRR, 2016

2015
Tractable Refinement Checking for Concurrent Objects.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Monitoring refinement via symbolic reasoning.
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015

Checking Correctness of Concurrent Objects: Tractable Reductions to Reachability (Invited Talk).
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014
Linearizability is EXPSPACE-complete.
CoRR, 2014

Verifying eventual consistency of optimistic replication systems.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

2013
Verifying Concurrent Programs against Sequential Specifications.
Proceedings of the Programming Languages and Systems, 2013

2010
Synthesis for regular specifications over unbounded domains.
Proceedings of 10th International Conference on Formal Methods in Computer-Aided Design, 2010


  Loading...