| Translating Omega-Regular Specifications to Average Objectives for Model-Free Reinforcement Learning. | 0 | 0.34 | 2022 |
| Model-Free Reinforcement Learning for Lexicographic Omega-Regular Objectives | 0 | 0.34 | 2021 |
| Formal Controller Synthesis for Continuous-Space MDPs via Model-Free Reinforcement Learning | 1 | 0.35 | 2020 |
| Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning. | 0 | 0.34 | 2020 |
| Model-Free Reinforcement Learning for Stochastic Parity Games. | 0 | 0.34 | 2020 |
| Omega-Regular Objectives in Model-Free Reinforcement Learning. | 0 | 0.34 | 2019 |
| Global Almost-Sure Reachability in Stochastic Constant-Rate Multi-Mode Systems. | 0 | 0.34 | 2018 |
| Omega-Regular Objectives in Model-Free Reinforcement Learning. | 3 | 0.38 | 2018 |
| The Reach-Avoid Problem for Constant-Rate Multi-Mode Systems. | 1 | 0.34 | 2017 |
| Sparse statistical model inference for analog circuits under process variations | 3 | 0.43 | 2014 |
| Statistically Sound Verification and Optimization for Complex Systems. | 6 | 0.61 | 2014 |
| Efficient handling of obligation constraints in synthesis from omega-regular specifications | 0 | 0.34 | 2013 |
| From statistical model checking to statistical model inference: characterizing the effect of process variations in analog circuits | 3 | 0.54 | 2013 |
| Safety first: a two-stage algorithm for the synthesis of reactive systems. | 14 | 0.62 | 2013 |
| An incremental approach to model checking progress properties | 22 | 1.00 | 2011 |
| A Study of Sweeping Algorithms in the Context of Model Checking. | 0 | 0.34 | 2011 |
| Safety first: A two-stage algorithm for LTL games | 20 | 1.00 | 2009 |
| On-the-Fly Clause Improvement | 19 | 0.69 | 2009 |
| Application of Formal Word-Level Analysis to Constrained Random Simulation | 10 | 0.70 | 2008 |
| Improved visibility in one-to-many trace concretization | 1 | 0.37 | 2008 |
| Alembic: An Efficient Algorithm For Cnf Preprocessing | 14 | 0.78 | 2007 |
| Disequality Management in Integer Difference Logic via Finite Instantiations | 0 | 0.34 | 2007 |
| Efficient abstraction refinement in interpolation-based unbounded model checking | 12 | 0.74 | 2006 |
| Guiding simulation with increasingly refined abstract traces | 25 | 1.18 | 2006 |
| Decomposing Image Computation for Symbolic Reachability Analysis Using Control Flow Information | 5 | 0.50 | 2006 |
| Strong Conflict Analysis for Propositional Satisfiability | 8 | 0.62 | 2006 |
| Compositional SCC Analysis for Language Emptiness | 6 | 0.41 | 2006 |
| An Incremental Algorithm to Check Satisfiability for Bounded Model Checking | 31 | 1.43 | 2005 |
| Prime clauses for fast enumeration of satisfying assignments to boolean circuits | 24 | 1.33 | 2005 |
| Efficient conflict analysis for finding all satisfying assignments of a boolean circuit | 25 | 1.64 | 2005 |
| Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure | 15 | 0.71 | 2005 |
| Efficient computation of small abstraction refinements | 4 | 0.45 | 2004 |
| Fine-Grain Abstraction and Sequential Don't Cares for Large Scale Model Checking | 4 | 0.43 | 2004 |
| Refining the SAT decision ordering for bounded model checking | 14 | 0.73 | 2004 |
| Computer Aided Verification, 15th International Conference, CAV 2003, Boulder, CO, USA, July 8-12, 2003, Proceedings | 10 | 1.00 | 2003 |
| The compositional far side of image computation | 6 | 0.58 | 2003 |
| Analysis of Symbolic SCC Hull Algorithms | 18 | 0.87 | 2002 |
| Fine-Grain Conjunction Scheduling for Symbolic Reachability Analysis | 15 | 0.72 | 2002 |
| Efficient manipulation of decision diagrams | 20 | 1.09 | 2001 |
| Divide and Compose: SCC Refinement for Language Emptiness | 6 | 0.57 | 2001 |
| Optimizing sequential verification by retiming transformations | 8 | 0.69 | 2000 |
| Power and delay reduction via simultaneous logic and placement optimization in FPGAs | 6 | 0.67 | 2000 |
| Symbolic guided search for CTL model checking | 38 | 1.84 | 2000 |
| A Comparative Study of Symbolic Algorithms for the Computation of Fair Cycles | 50 | 2.20 | 2000 |
| To split or to conjoin: the question in image computation | 47 | 2.16 | 2000 |
| Border-Block Triangular Form and Conjunction Schedule in Image Computation | 39 | 1.94 | 2000 |
| Fundamental CAD algorithms | 5 | 0.52 | 2000 |
| Efficient Decision Procedures for Model Checking of Linear Time Logic Properties | 41 | 2.45 | 1999 |
| Lazy group sifting for efficient symbolic state traversal of FSMs | 6 | 0.48 | 1999 |
| Symbolic State Exploration | 3 | 0.62 | 1999 |
