Efficient SAT solving: beyond supercubes
Proceedings of the 42nd annual Design Automation Conference
Unrestricted vs restricted cut in a tableau method for Boolean circuits
Annals of Mathematics and Artificial Intelligence
B-Cubing: New Possibilities for Efficient SAT-Solving
IEEE Transactions on Computers
Automating component-based system assembly
Proceedings of the 2007 international symposium on Software testing and analysis
Preprocessing for controlled query evaluation with availability policy
Journal of Computer Security - 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security (DBSec'06)
${\mathcal{T}}$-Decision by Decomposition
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Constraint Prioritization for Efficient Analysis of Declarative Models
FM '08 Proceedings of the 15th international symposium on Formal Methods
Whispec: white-box testing of libraries using declarative specifications
LCSD '07 Proceedings of the 2007 Symposium on Library-Centric Software Design
Automated deduction for verification
ACM Computing Surveys (CSUR)
Journal of Artificial Intelligence Research
Automated reasoning: past story and new trends
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Theory decision by decomposition
Journal of Symbolic Computation
On voting machine design for verification and testability
Proceedings of the 16th ACM conference on Computer and communications security
Bounded Model Generation for Isabelle/HOL
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata-theoretic model checking revisited
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
A tutorial on satisfiability modulo theories
CAV'07 Proceedings of the 19th international conference on Computer aided verification
On theorem proving for program checking: historical perspective and recent developments
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Efficient generation of craig interpolants in satisfiability modulo theories
ACM Transactions on Computational Logic (TOCL)
Computing small unsatisfiable cores in satisfiability modulo theories
Journal of Artificial Intelligence Research
On finding an inference-proof complete database for controlled query evaluation
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Optimizations for compiling declarative models into boolean formulas
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Finding rough set reducts with SAT
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Geometric resolution: a proof procedure based on finite model search
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Developing java grid applications with ibis
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Linking anonymous transactions: the consistent view attack
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Validating Quality Attribute Requirements
Software—Practice & Experience
Finding rough and fuzzy-rough set reducts with SAT
Information Sciences: an International Journal
| Hi-index | 0.00 |