Noam Rinetzky

Orcid: 0000-0002-7750-4085

Affiliations:
  • Tel Aviv University, Israel


According to our database1, Noam Rinetzky authored at least 60 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Relaxed Effective Callback Freedom: A Parametric Correctness Condition for Sequential Modules With Callbacks.
IEEE Trans. Dependable Secur. Comput., 2023

State Merging with Quantifiers in Symbolic Execution.
Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2023

2022
Runtime Complexity Bounds Using Squeezers.
ACM Trans. Program. Lang. Syst., 2022

2021
A bounded symbolic-size model for symbolic execution.
Proceedings of the ESEC/FSE '21: 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2021

Address-Aware Query Caching for Symbolic Execution.
Proceedings of the 14th IEEE Conference on Software Testing, Verification and Validation, 2021

Run-time Complexity Bounds Using Squeezers.
Proceedings of the Programming Languages and Systems, 2021

2020
Proving highly-concurrent traversals correct.
Proc. ACM Program. Lang., 2020

Taming callbacks for smart contract modularity.
Proc. ACM Program. Lang., 2020

Shape Analysis.
Found. Trends Program. Lang., 2020

A Thread-Local Semantics and Efficient Static Analyses for Race Free Programs.
CoRR, 2020

Putting the Squeeze on Array Programs: Loop Verification via Inductive Rank Reduction.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2020

Harnessing Static Analysis to Help Learn Pseudo-Inverses of String Manipulating Procedures for Automatic Test Generation.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2020

Past-sensitive pointer analysis for symbolic execution.
Proceedings of the ESEC/FSE '20: 28th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2020

Relocatable addressing model for symbolic execution.
Proceedings of the ISSTA '20: 29th ACM SIGSOFT International Symposium on Software Testing and Analysis, 2020

2019
Hypothetical Reasoning via Provenance Abstraction.
Proceedings of the 2019 International Conference on Management of Data, 2019

Computing summaries of string loops in C for better testing and refactoring.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

Simple and precise static analysis of untrusted Linux kernel extensions.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

COBRA: Compression Via Abstraction of Provenance for Hypothetical Reasoning.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

2018
Online detection of effectively callback free objects with applications to smart contracts.
Proc. ACM Program. Lang., 2018

Characterizing Transactional Memory Consistency Conditions Using Observational Refinement.
J. ACM, 2018

Order out of Chaos: Proving Linearizability Using Local Views.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Safe privatization in transactional memory.
Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018

Chopped symbolic execution.
Proceedings of the 40th International Conference on Software Engineering, 2018

Towards Hypothetical Reasoning Using Distributed Provenance.
Proceedings of the 21st International Conference on Extending Database Technology, 2018

Statistical Reconstruction of Class Hierarchies in Binaries.
Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems, 2018

2017
Property-Directed Inference of Universal Invariants or Proving Their Absence.
J. ACM, 2017

Conjunctive Abstract Interpretation Using Paramodulation.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2017

Thread-Local Semantics and Its Efficient Sequential Abstractions for Race-Free Programs.
Proceedings of the Static Analysis - 24th International Symposium, 2017

On the Automated Verification of Web Applications with Embedded SQL.
Proceedings of the 20th International Conference on Database Theory, 2017

RATCOP: Relational Analysis Tool for Concurrent Programs.
Proceedings of the Hardware and Software: Verification and Testing, 2017

Verifying Equivalence of Spark Programs.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016
Property Directed Abstract Interpretation.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2016

From Shape Analysis to Termination Analysis in Linear Time.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
Modular Verification of Concurrency-Aware Linearizability.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Modularity in Lattices: A Case Study on the Correspondence Between Top-Down and Bottom-Up Analysis.
Proceedings of the Static Analysis - 22nd International Symposium, 2015

A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Pattern-based Synthesis of Synchronization for the C++ Memory Model.
Proceedings of the Formal Methods in Computer-Aided Design, 2015

2014
Safety of Live Transactions in Transactional Memory: TMS is Necessary and Sufficient.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Brief announcement: concurrency-aware linearizability.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

2013
Tightfit: adaptive parallelization with foresight.
Proceedings of the Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, 2013

A programming language perspective on transactional memory consistency.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Verifying Concurrent Memory Reclamation Algorithms with Grace.
Proceedings of the Programming Languages and Systems, 2013

Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs.
Proceedings of the Programming Logics - Essays in Memory of Harald Ganzinger, 2013

2010
Abstraction for concurrent objects.
Theor. Comput. Sci., 2010

Field-sensitive program dependence analysis.
Proceedings of the 18th ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2010

Sequential verification of serializability.
Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2010

Verifying linearizability with hindsight.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2008
Interprocedural and modular local heap shape analysis
PhD thesis, 2008

On the complexity of partially-flow-sensitive alias analysis.
ACM Trans. Program. Lang. Syst., 2008

Verifying dereference safety via expanding-scope analysis.
Proceedings of the ACM/SIGSOFT International Symposium on Software Testing and Analysis, 2008

2007
CGCExplorer: a semi-automated search procedure for provably correct concurrent collectors.
Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, 2007

Modular Shape Analysis for Dynamically Encapsulated Programs.
Proceedings of the Programming Languages and Systems, 2007

Comparison Under Abstraction for Verifying Linearizability.
Proceedings of the Computer Aided Verification, 19th International Conference, 2007

Local Reasoning for Storable Locks and Threads.
Proceedings of the Programming Languages and Systems, 5th Asian Symposium, 2007

2005
Automatic Verification of Strongly Dynamic Software Systems.
Proceedings of the Verified Software: Theories, 2005

Interprocedural Shape Analysis for Cutpoint-Free Programs.
Proceedings of the Static Analysis, 12th International Symposium, 2005

A semantics for procedure local heaps and its abstractions.
Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2005

2003
Towards an Object Stor.
Proceedings of the 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies, 2003

2002
A Two Layered Approach for Securing an Object Store Network.
Proceedings of the First International IEEE Security in Storage Workshop, 2002

2001
Interprocedural Shape Analysis for Recursive Programs.
Proceedings of the Compiler Construction, 10th International Conference, 2001


  Loading...