Search Results - "Sagiv, Mooly"

Temporal prophecy for proving temporal properties of infinite-state systems by Padon, Oded, Hoenicke, Jochen, McMillan, Kenneth L., Podelski, Andreas, Sagiv, Mooly, Shoham, Sharon

“…Various verification techniques for temporal properties transform temporal verification to safety verification. For infinite-state systems, these…”
Get full text

Bounded Quantifier Instantiation for Checking Inductive Invariants by Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, Sharon Shoham

“…We consider the problem of checking whether a proposed invariant $\varphi$ expressed in first-order logic with quantifier alternation is inductive, i.e…”
Get full text

Simulating reachability using first-order logic with applications to verification of linked data structures by Lev-Ami, Tal, Immerman, Neil, Reps, Thomas, Sagiv, Mooly, Srivastava, Siddharth, Yorsh, Greta

“…This paper shows how to harness existing theorem provers for first-order logic to automatically verify safety properties of imperative programs that perform…”
Get full text

Relaxed Effective Callback Freedom: A Parametric Correctness Condition for Sequential Modules With Callbacks by Albert, Elvira, Grossman, Shelly, Rinetzky, Noam, Rodriguez-Nunez, Clara, Rubio, Albert, Sagiv, Mooly

“…Callbacks are an essential mechanism for event-driven programming. Unfortunately, callbacks make reasoning challenging because they introduce behaviors where…”
Get full text

Synthesis of circular compositional program proofs via abduction by Dillig, Isil, Dillig, Thomas, Li, Boyang, McMillan, Ken, Sagiv, Mooly

“…This paper presents a new technique for synthesizing circular compositional proofs of program correctness. Our technique uses abductive inference to decompose…”
Get full text

Some complexity results for stateful network verification by Alpernas, Kalev, Panda, Aurojit, Rabinovich, Alexander, Sagiv, Mooly, Shenker, Scott, Shoham, Sharon, Velner, Yaron

“…In modern networks, forwarding of packets often depends on the history of previously transmitted traffic. Such networks contain stateful middleboxes, whose…”
Get full text

Decidable fragments of many-sorted logic by Abadi, Aharon, Rabinovich, Alexander, Sagiv, Mooly

“…Many natural specifications use types. We investigate the decidability of fragments of many-sorted first-order logic. We identified some decidable fragments…”
Get full text

A Decidable Case of Query Determinacy: Project-Select Views by Zhang, Wen, Panda, Aurojit, Sagiv, Mooly, Shenker, Scott

“…Query determinacy is decidable for project-select views and a project-select-join query with no self joins, as long as the selection predicates are in a…”
Get full text

This is not the End: Rethinking Serverless Function Termination by Alpernas, Kalev, Panda, Aurojit, Sagiv, Mooly

“…Elastic scaling is one of the central benefits provided by serverless platforms, and requires that they scale resource up and down in response to changing…”
Get full text

Precise interprocedural dataflow analysis with applications to constant propagation by Sagiv, Mooly, Reps, Thomas, Horwitz, Susan

“…This paper concerns interprocedural dataflow-analysis problems in which the dataflow information at a program point is represented by an environment (i.e., a…”
Get full text

Summing Up Smart Transitions by Elad, Neta, Rain, Sophie, Immerman, Neil, Kovács, Laura, Sagiv, Mooly

“…Some of the most significant high-level properties of currencies are the sums of certain account balances. Properties of such sums can ensure the integrity of…”
Get full text

Scaling model checking of dataraces using dynamic information by Shacham, Ohad, Sagiv, Mooly, Schuster, Assaf

“…Dataraces in multithreaded programs often indicate severe bugs and can cause unexpected behaviors when different thread interleavings are executed. Because…”
Get full text

Blockaid: Data Access Policy Enforcement for Web Applications by Zhang, Wen, Sheng, Eric, Chang, Michael, Panda, Aurojit, Sagiv, Mooly, Shenker, Scott

“…Modern web applications serve large amounts of sensitive user data, access to which is typically governed by data-access policies. Enforcing such policies is…”
Get full text

Property-Directed Reachability as Abstract Interpretation in the Monotone Theory by Feldman, Yotam M. Y, Sagiv, Mooly, Shoham, Sharon, Wilcox, James R

“…Inferring inductive invariants is one of the main challenges of formal verification. The theory of abstract interpretation provides a rich framework to devise…”
Get full text

Complexity and Information in Invariant Inference by Feldman, Yotam M. Y, Immerman, Neil, Sagiv, Mooly, Shoham, Sharon

“…This paper addresses the complexity of SAT-based invariant inference, a prominent approach to safety verification. We consider the problem of inferring an…”
Get full text

Phoenix: A Formally Verified Regenerating Vault by Kirstein, Uri, Grossman, Shelly, Mirkin, Michael, Wilcox, James, Eyal, Ittay, Sagiv, Mooly

“…An attacker that gains access to a cryptocurrency user's private keys can perform any operation in her stead. Due to the decentralized nature of most…”
Get full text

Some Complexity Results for Stateful Network Verification by Alpernas, Kalev, Panda, Aurojit, Rabinovich, Alexander, Sagiv, Mooly, Shenker, Scott, Shoham, Sharon, Velner, Yaron

“…Formal Methods in System Design 54 (2019) 191-231 In modern networks, forwarding of packets often depends on the history of previously transmitted traffic…”
Get full text

Temporal Prophecy for Proving Temporal Properties of Infinite-State Systems by Padon, Oded, Hoenicke, Jochen, McMillan, Kenneth L, Podelski, Andreas, Sagiv, Mooly, Shoham, Sharon

“…Various verification techniques for temporal properties transform temporal verification to safety verification. For infinite-state systems, these…”
Get full text

Temporal Prophecy for Proving Temporal Properties of Infinite-State Systems by Padon, Oded, Hoenicke, Jochen, McMillan, Kenneth L., Podelski, Andreas, Sagiv, Mooly, Shoham, Sharon

“…Various verification techniques for temporal properties transform temporal verification to safety verification. For infinite-state systems, these…”
Get full text

Learning the Boundary of Inductive Invariants by Feldman, Yotam M. Y, Sagiv, Mooly, Shoham, Sharon, Wilcox, James R

“…We study the complexity of invariant inference and its connections to exact concept learning. We define a condition on invariants and their geometry, called…”
Get full text