Daniel Sheridan

According to our database, Daniel Sheridan authored at least 9 papers between 2001 and 2006.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2006

Temporal logic encodings for SAT-based bounded model checking.

Daniel Sheridan

PhD thesis, 2006

A Compact Linear Translation for Bounded Model Checking.

Paul B. Jackson, Daniel Sheridan

Proceedings of the Fourth International Workshop on Bounded Model Checking, 2006

2004

Bounded Model Checking with SNF, Alternating Automata, and Bu"chi Automata.

Daniel Sheridan

Proceedings of the 2nd International Workshop on Bounded Model Checking, 2004

The Optimality of a Fast CNF Conversion and its Use with SAT.

Daniel Sheridan

Proceedings of the SAT 2004, 2004

Clause Form Conversions for Boolean Circuits.

Paul B. Jackson, Daniel Sheridan

Proceedings of the Theory and Applications of Satisfiability Testing, 2004

Bounded Verification of Past LTL.

Alessandro Cimatti, Marco Roveri, Daniel Sheridan

Proceedings of the Formal Methods in Computer-Aided Design, 5th International Conference, 2004

2003

Dynamic Step Size Adjustment in Iterative Deepening Search.

Daniel Sheridan

Proceedings of the Principles and Practice of Constraint Programming, 2003

2002

A Fixpoint Based Encoding for Bounded Model Checking.

Alan M. Frisch, Daniel Sheridan, Toby Walsh

Proceedings of the Formal Methods in Computer-Aided Design, 4th International Conference, 2002

2001

Comparing SAT Encodings for Model Checking.

Daniel Sheridan

Proceedings of the Principles and Practice of Constraint Programming, 2001