Fabio Somenzi
Affiliations: | Electrical Engineering | University of Colorado, Boulder, Boulder, CO, United States |
Area:
Electronics and Electrical EngineeringGoogle:
"Fabio Somenzi"Children
Sign in to add traineeMario Escobar | grad student | 2000 | CU Boulder |
In-Ho Moon | grad student | 2000 | CU Boulder |
Roderick P. Bloem | grad student | 2001 | CU Boulder |
Balakrishna Kumthekar | grad student | 2002 | CU Boulder |
HoonSang Jin | grad student | 2005 | CU Boulder |
Mohammad Awedh | grad student | 2006 | CU Boulder |
Kuntal Nanshi | grad student | 2009 | CU Boulder |
Hyondeuk Kim | grad student | 2010 | CU Boulder |
Hyojung Han | grad student | 2011 | CU Boulder |
Zyad Hassan | grad student | 2014 | CU Boulder |
Saqib b. Sohail | grad student | 2014 | CU Boulder |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Nanshi K, Somenzi F. (2013) Using abstraction to guide the search for long error traces Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 32: 453-466 |
Sohail S, Somenzi F. (2013) Safety first: a two-stage algorithm for the synthesis of reactive systems International Journal On Software Tools For Technology Transfer. 15: 433-454 |
Han H, Somenzi F, Jin H. (2010) Making Deduction More Effective in SAT Solvers Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 29: 1271-1284 |
Kim H, Jin H, Somenzi F. (2007) Disequality Management in Integer Difference Logic via Finite Instantiations Journal On Satisfiability, Boolean Modeling and Computation. 3: 47-66 |
Awedh M, Somenzi F. (2006) Termination criteria for bounded model checking: Extensions and comparison Electronic Notes in Theoretical Computer Science. 144: 51-66 |
Jin H, Somenzi F. (2005) An Incremental Algorithm to Check Satisfiability for Bounded Model Checking Electronic Notes in Theoretical Computer Science. 119: 51-65 |
Li B, Wang C, Somenzi F. (2005) Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure International Journal On Software Tools For Technology Transfer. 7: 143-155 |
Ward D, Somenzi F. (2005) Automatic generation of hints for symbolic traversal Lecture Notes in Computer Science. 207-221 |
Li B, Wang C, Somenzi F. (2003) A Satisfiability-Based Approach to Abstraction Refinement in Model Checking Electronic Notes in Theoretical Computer Science. 89: 608-622 |
Gurumurthy S, Kupferman O, Somenzi F, et al. (2003) On Complementing Nondeterministic Büchi Automata Lecture Notes in Computer Science. 96-110 |