- A WorkEfficient Distributed Algorithm for Reachability Analysis
- A GameBased Framework for CTL CounterExamples and 3Valued AbstractionRefinement
- A New Approach to Bounded Model Checking for Branching Time Logics
- SyntaxDirected Model Checking of Sequential Karen Yorav Orna Grumberg
- 2-Valued and 3-Valued Abstraction-Refinement in Model
- [SP89] R. Sherman and A. Pnueli. Model checking for linear temporal logic: An efficient implementation. Technical report, USC/ISI, 1989.
- G 2 . In addition, all states with location P that satisfy B have a transition into I 1 and those that do not satisfy B have a transition into I 2 . Finally, states from end(P 1 ) and end(P 2 ) are
- Memory Efficient AllSolutions SAT Solver and its Application for Reachability Analysis
- Verification Tools for FiniteState Concurrent Systems ?
- Combining Symmetry Reduction and UnderApproximation for Symbolic Model Checking
- A Heuristic for the Automatic Generation of Ranking Functions Dennis Dams z Rob Gerth x Orna Grumberg {
- Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits
- 3-Valued Abstraction: More Precision at Less Cost Sharon Shoham Orna Grumberg
- What if Model Checking Must Be Truly Symbolic \Lambda Hardi Hungar
- Distributed Symbolic Model Checking for --calculus Orna Grumberg 1 , Tamir Heyman 1,2 , and Assaf Schuster 1
- Applicability of Fair Simulation Doron Bustan and Orna Grumberg
- P Sat p ! q P Sat p ! :q
- Modular Minimization of Deterministic FiniteState Machines Doron Bustan and Orna Grumberg \Lambda
- Modular Minimization of Finite State Machines Doron Bustan and Orna Grumberg
- [ASSSV94] A. Aziz, V. Singhal, T.R. Shiple, and A.L. SangiovanniVincentelli. Formuladependent equivalence for compositional ctl model checking. In
- Let s 0t be an initial state of T (/). Since UnImplementedStartState is empty, there must be an initial state s 0i of M such that (s 0i ; s 0t ) 2 ReachSIM . Thus,
- C.6 Verifying #(P rimes; Communication) 1. Using the jigsaw rule and the specifications verified for Primes and Communication we
- Abstract Interpretation of Reactive Systems DENNIS DAMS and ROB GERTH
- A Framework for Translating Models and Specifications ?
- Interpolation-Sequence Based Model Checking Yakir Vizel1,2 Orna Grumberg1
- Verification of the Futurebus+ Cache Coherence E. Clarke 1 O. Grumberg 2 H. Hiraishi 3
- Making Predicate Abstraction Efficient: How to eliminate redundant predicates ?
- Scalable Distributed OntheFly Symbolic Model Shoham BenDavid 2 , Tamir Heyman 1;2 , Orna Grumberg 1 , and Assaf Schuster 1
- Automatic Refinement and Vacuity Detection for Symbolic Trajectory Evaluation
- MultiValued Model Checking Games Sharon Shoham and Orna Grumberg
- Symbolic Trajectory Evaluation (STE): Automatic Refinement and Vacuity Detection
- Achieving Speedups in Distributed Symbolic Reachability Analysis through Asynchronous
- Regular Vacuity Doron Bustan2
- Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations
- Compositional Verification and 3-Valued Abstractions Join Forces
- Verifying Very Large Industrial Circuits Using 100 Processes , Orna Grumberg1
- 3-Valued Circuit SAT for STE with Automatic Refinement Orna Grumberg, Assaf Schuster, and Avi Yadgar
- Translations Between Textual Transition Systems and Petri Katerina Korenblat, Orna Grumberg, and Shmuel Katz
- Bounded Model Checking of Concurrent Ishai Rabinovitz 1,2 and Orna Grumberg 1
- FirstOrderCTL Model Checking ? Jurgen Bohn 1 Werner Damm 1 Orna Grumberg 2 Hardi Hungar 1 Karen Laster 2
- ProofGuided UnderapproximationWidening for MultiProcess Systems
- Enhanced Vacuity Detection in Linear Temporal Logic Roy Armoni 1 , Limor Fix 1 , Alon Flaisher 1;2 , Orna Grumberg 2 , Nir Piterman 1 ,
- Monotonic AbstractionRefinement for CTL Sharon Shoham and Orna Grumberg
- A Summery of the equivalences A.1 Equivalences for Rule R5.
- [ASSB94] A. Aziz, V. Singhal, G.M. Swamy, and R.K. Brayton. Minimizing interacting finite state machines: A compositional approach to language containment. In In
- A Framework For Compositional Verification of Multi-Valued Systems Via Abstraction-Refinement
- Model Checking and Modular Verification \Lambda Orna Grumberg
- [EJS93] E.A. Emerson, C. Jutla, and A.P. Sistla. On modelchecking for fragments of calculus. In Computer Aided Verification, Proc. 5th Int. Workshop, volume 697, pages 385--396, Elounda,
