Oded Padon

Orcid: 0009-0006-4209-1635

According to our database1, Oded Padon authored at least 42 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification.
Proc. ACM Program. Lang., January, 2024

Quarl: A Learning-Based Quantum Circuit Optimizer.
Proc. ACM Program. Lang., 2024

A Multi-Level Superoptimizer for Tensor Programs.
CoRR, 2024

Verus: A Practical Foundation for Systems Verification.
Proceedings of the ACM SIGOPS 30th Symposium on Operating Systems Principles, 2024

Clover: Closed-Loop Verifiable Code Generation.
Proceedings of the AI Verification - First International Symposium, 2024

Anvil: Verifying Liveness of Cluster Management Controllers.
Proceedings of the 18th USENIX Symposium on Operating Systems Design and Implementation, 2024

mypyvy: A Research Platform for Verification of Transition Systems in First-Order Logic.
Proceedings of the Computer Aided Verification - 36th International Conference, 2024

Efficient Implementation of an Abstract Domain of Quantified First-Order Formulas.
Proceedings of the Computer Aided Verification - 36th International Conference, 2024

2023
Leaf: Modularity for Temporary Sharing in Separation Logic.
Proc. ACM Program. Lang., October, 2023

Leaf: Modularity for Temporary Sharing in Separation Logic (Extended Version).
CoRR, 2023

Invited Talk: Deductive Verification of Distributed Protocols in Decidable Logics.
Proceedings of the 21st International Workshop on Satisfiability Modulo Theories (SMT 2023) co-located with the 29th International Conference on Automated Deduction (CADE 2023), 2023

2022
Induction duality: primal-dual search for invariants.
Proc. ACM Program. Lang., 2022

Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays.
Log. Methods Comput. Sci., 2022

Quartz: Superoptimization of Quantum Circuits (Extended Version).
CoRR, 2022

Inferring Invariants with Quantifier Alternations: Taming the Search Space Explosion.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

Quartz: superoptimization of Quantum circuits.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

Verification of Distributed Protocols: Decidable Modeling and Invariant Inference.
Proceedings of the 22nd Formal Methods in Computer-Aided Design, 2022

2021
Temporal prophecy for proving temporal properties of infinite-state systems.
Formal Methods Syst. Des., 2021

Quanto: Optimizing Quantum Circuits with Automatic Generation of Circuit Identities.
CoRR, 2021

Adaptive restarts for stochastic synthesis.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

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

Resources: A Safe Language Abstraction for Money.
CoRR, 2020

First-order quantified separators.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

Ivy: A Multi-modal Verification Tool for Distributed Algorithms.
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

2019
Bounded Quantifier Instantiation for Checking Inductive Invariants.
Log. Methods Comput. Sci., 2019

TASO: optimizing deep learning computation with automatic generation of graph substitutions.
Proceedings of the 27th ACM Symposium on Operating Systems Principles, 2019

Semantic program alignment for equivalence checking.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

SPoC: Search-based Pseudocode to Code.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics.
Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2018
Deductive Verification of Distributed Protocols in First-Order Logic
PhD thesis, 2018

Reducing liveness to safety in first-order logic.
Proc. ACM Program. Lang., 2018

Deductive Verification in Decidable Fragments with Ivy.
Proceedings of the Static Analysis - 25th International Symposium, 2018

Modularity for decidability of deductive verification with applications to distributed systems.
Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2018

Deductive Verification of Distributed Protocols in First-Order Logic.
Proceedings of the 2018 Formal Methods in Computer Aided Design, 2018

2017
Paxos made EPR: decidable reasoning about distributed protocols.
Proc. ACM Program. Lang., 2017

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

Property Directed Reachability for Proving Absence of Concurrent Modification Errors.
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

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

2016
Decidability of inferring inductive invariants.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

Ivy: safety verification by interactive generalization.
Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2016

2015
Decentralizing SDN Policies.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015


  Loading...