The following pages link to Sharon Shoham (Q259064):
Displaying 43 items.
- A framework for compositional verification of multi-valued systems via abstraction-refinement (Q259065) (← links)
- Symbolic automata for representing big code (Q300407) (← links)
- Multi-valued model checking games (Q414899) (← links)
- Putting the squeeze on array programs: loop verification via inductive rank reduction (Q784119) (← links)
- Solving \(\mathrm{LIA}^\star\) using approximations (Q784151) (← links)
- 3-valued abstraction: More precision at less cost (Q958307) (← links)
- Game semantics for the Lambek-calculus: Capturing directionality and the absence of structural rules (Q1005955) (← links)
- Automated circular assume-guarantee reasoning (Q1673656) (← links)
- Property-directed inference of universal invariants or proving their absence (Q1702932) (← links)
- Temporal prophecy for proving temporal properties of infinite-state systems (Q2058382) (← links)
- Synthesis with abstract examples (Q2151254) (← links)
- Global guidance for local generalization in model checking (Q2226726) (← links)
- Run-time complexity bounds using squeezers (Q2233463) (← links)
- Compositional verification and 3-valued abstractions join forces (Q2266991) (← links)
- Programming by predicates: a formal model for interactive synthesis (Q2303879) (← links)
- Some complexity results for stateful network verification (Q2335903) (← links)
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus (Q2643076) (← links)
- Property Directed Abstract Interpretation (Q2796039) (← links)
- $$D^3$$ : Data-Driven Disjunctive Abstraction (Q2796047) (← links)
- Decentralizing SDN Policies (Q2819856) (← links)
- Decidability of inferring inductive invariants (Q2828258) (← links)
- Symbolic Automata for Static Specification Mining (Q2870768) (← links)
- Property Directed Reachability for Proving Absence of Concurrent Modification Errors (Q2961566) (← links)
- IC3 - Flipping the E in ICE (Q2961586) (← links)
- Property-Directed Inference of Universal Invariants or Proving Their Absence (Q3177887) (← links)
- Abstraction-Based Interaction Model for Synthesis (Q3296340) (← links)
- Bounded Quantifier Instantiation for Checking Inductive Invariants (Q3303891) (← links)
- Compositional Verification and 3-Valued Abstractions Join Forces (Q3611995) (← links)
- A Framework for Compositional Verification of Multi-valued Systems via Abstraction-Refinement (Q3648705) (← links)
- Automated Circular Assume-Guarantee Reasoning with N-way Decomposition and Alphabet Refinement (Q4633543) (← links)
- (Q5090915) (← links)
- Automated Circular Assume-Guarantee Reasoning (Q5206947) (← links)
- (Q5232900) (← links)
- Thread-Local Semantics and Its Efficient Sequential Abstractions for Race-Free Programs (Q5233246) (← links)
- A game-based framework for CTL counterexamples and 3-valued abstraction-refinement (Q5277790) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5308433) (← links)
- Intertwined Forward-Backward Reachability Analysis Using Interpolants (Q5326333) (← links)
- Automated Technology for Verification and Analysis (Q5491877) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5711492) (← links)
- Computer Aided Verification (Q5900684) (← links)
- Fast approximations of quantifier elimination (Q6535528) (← links)
- Inferring invariants with quantifier alternations: taming the search space explosion (Q6535571) (← links)
- Global guidance for local generalization in model checking (Q6632197) (← links)
