
Some Complexity Results for Stateful Network Verification
In modern networks, forwarding of packets often depends on the history o...
read it

Temporal Prophecy for Proving Temporal Properties of InfiniteState Systems
Various verification techniques for temporal properties transform tempor...
read it

Putting the Squeeze on Array Programs: Loop Verification via Inductive Rank Reduction
Automatic verification of array manipulating programs is a challenging p...
read it

Modular Verification of Concurrent Programs via Sequential Model Checking
This work utilizes the plethora of work on verification of sequential pr...
read it

Quantifiers on Demand
Automated program verification is a difficult problem. It is undecidable...
read it

Proving HighlyConcurrent Traversals Correct
Modern highlyconcurrent search data structures, such as search trees, o...
read it

A ThreadLocal Semantics and Efficient Static Analyses for Race Free Programs
Data race free (DRF) programs constitute an important class of concurren...
read it

Learning the Boundary of Inductive Invariants
We study the complexity of invariant inference and its connections to ex...
read it

Global Guidance for Local Generalization in Model Checking
SMTbased model checkers, especially IC3style ones, are currently the m...
read it

Complexity and Information in Invariant Inference
This paper addresses the complexity of SATbased invariant inference, a ...
read it

Verification of ThresholdBased Distributed Algorithms by Decomposition to Decidable Logics
Verification of faulttolerant distributed protocols is an immensely dif...
read it

Inferring Inductive Invariants from Phase Structures
Infinitestate systems such as distributed protocols are challenging to ...
read it

Property Directed Self Composition
We address the problem of verifying ksafety properties: properties that...
read it

Undecidability of Inferring Linear Integer Invariants
We show that the problem of determining the existence of an inductive in...
read it

Order out of Chaos: Proving Linearizability Using Local Views
Proving the linearizability of highly concurrent data structures, such a...
read it

Bounded Quantifier Instantiation for Checking Inductive Invariants
We consider the problem of checking whether a proposed invariant ϕ expre...
read it

Paxos Made EPR: Decidable Reasoning about Distributed Protocols
Distributed protocols such as Paxos play an important role in many compu...
read it

Programming Not Only by Example
In recent years, there has been tremendous progress in automated synthes...
read it

Abstractions for Verifying Isolation Properties in Stateful Networks
Modern networks achieve robustness and scalability by maintaining states...
read it

Modular Safety Verification for Stateful Networks
Modern networks achieve robustness and scalability by maintaining states...
read it
Sharon Shoham
is this you? claim profile