The following pages link to Orna Grumberg (Q259063):
Displaying 50 items.
- A framework for compositional verification of multi-valued systems via abstraction-refinement (Q259065) (← links)
- Multi-valued model checking games (Q414899) (← links)
- Modular abstractions for verifying real-time distributed systems (Q685095) (← links)
- Distributed symbolic model checking for \(\mu\)-calculus (Q816198) (← links)
- Combining symmetry reduction and under-approximation for symbolic model checking (Q816210) (← links)
- (Q921982) (redirect page) (← links)
- Reasoning about networks with many identical finite state processes (Q921983) (← links)
- 3-valued abstraction: More precision at less cost (Q958307) (← links)
- Efficient Craig interpolation for linear Diophantine (dis)equations and linear modular equations (Q1039847) (← links)
- A complete rule for equifair termination (Q1088401) (← links)
- Infinite trees, markings, and well-foundedness (Q1112586) (← links)
- Characterizing finite Kripke structures in propositional temporal logic (Q1123183) (← links)
- Fairness and hyperfairness in multi-party interactions (Q1261113) (← links)
- Program composition via unification (Q1331925) (← links)
- Automated circular assume-guarantee reasoning (Q1673656) (← links)
- State space reduction using partial order techniques (Q1856177) (← links)
- Syntax-directed model checking of sequential programs (Q1858441) (← links)
- A scalable parallel algorithm for reachability analysis of very large circuits (Q1871864) (← links)
- Static analysis for state-space reductions preserving temporal logics (Q1878929) (← links)
- Applicability of fair simulation (Q1886036) (← links)
- Branching-time temporal logic and tree automata (Q1917081) (← links)
- Must fault localization for program repair (Q2226765) (← links)
- Compositional model checking for multi-properties (Q2234059) (← links)
- Compositional verification and 3-valued abstractions join forces (Q2266991) (← links)
- Sound and complete mutation-based program repair (Q2281653) (← links)
- An automata-theoretic approach to model-checking systems and specifications over infinite data domains (Q2331081) (← links)
- A work-efficient distributed algorithm for reachability analysis (Q2431764) (← links)
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus (Q2643076) (← links)
- Which branching-time properties are effectively linear? (Q2720312) (← links)
- (Q2723424) (← links)
- (Q2754071) (← links)
- (Q2754081) (← links)
- (Q3028984) (← links)
- (Q3060979) (← links)
- Abstraction and Abstraction Refinement (Q3176371) (← links)
- (Q3347265) (← links)
- VERIFYING VERY LARGE INDUSTRIAL CIRCUITS USING 100 PROCESSES AND BEYOND (Q3426787) (← links)
- Counterexample-guided abstraction refinement for symbolic model checking (Q3452508) (← links)
- A Game-Theoretic Approach to Simulation of Data-Parameterized Systems (Q3457808) (← links)
- Analyzing Internet Routing Security Using Model Checking (Q3460047) (← links)
- A New Approach to Bounded Model Checking for Branching Time Logics (Q3510810) (← links)
- 3-Valued Circuit SAT for STE with Automatic Refinement (Q3510816) (← links)
- Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations (Q3512498) (← links)
- Variable Automata over Infinite Alphabets (Q3564896) (← links)
- Abstraction and Refinement in Model Checking (Q3591392) (← links)
- Compositional Verification and 3-Valued Abstractions Join Forces (Q3611995) (← links)
- Hybrid BDD and All-SAT Method for Model Checking (Q3630184) (← links)
- A Framework for Compositional Verification of Multi-valued Systems via Abstraction-Refinement (Q3648705) (← links)
- A proof rule for fair termination of guarded commands (Q3698284) (← links)
- (Q3698285) (← links)
