Handbook of theoretical computer science (vol. B)
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
ACM Transactions on Computational Logic (TOCL)
Efficient Detection of Vacuity in Temporal Model Checking
Formal Methods in System Design - Special issue on CAV '97
Evaluating general purpose automated theorem proving systems
Artificial Intelligence
Another Look at LTL Model Checking
Formal Methods in System Design
A New One-Pass Tableau Calculus for PLTL
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Propositional Logics on the Computer
TABLEAUX '95 Proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Improved Automata Generation for Linear Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
VIS: A System for Verification and Synthesis
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
From Pre-Historic to Post-Modern Symbolic Model Checking
Formal Methods in System Design
Formal analysis of hardware requirements
Proceedings of the 43rd annual Design Automation Conference
Interactive presentation: Automatic hardware synthesis from specifications: a case study
Proceedings of the conference on Design, automation and test in Europe
Specify, Compile, Run: Hardware from PSL
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
A Framework for Inherent Vacuity
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
An Antichain Algorithm for LTL Realizability
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Fair Derivations in Monodic Temporal Reasoning
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
A portfolio approach to algorithm select
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Resolution-Based Model Construction for PLTL
TIME '09 Proceedings of the 2009 16th International Symposium on Temporal Representation and Reasoning
Implementing a fair monodic temporal logic prover
AI Communications - Practical Aspects of Automated Reasoning
Boolean abstraction for temporal logic satisfiability
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Antichains: alternative algorithms for LTL satisfiability and model-checking
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
International Journal on Software Tools for Technology Transfer (STTT) - Special Section on SPIN 07
A multi-encoding approach for LTL symbolic satisfiability checking
FM'11 Proceedings of the 17th international conference on Formal methods
Evaluating LTL satisfiability solvers
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Incremental and complete bounded model checking for full PLTL
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Statistical methodology for comparison of SAT solvers
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Towards a notion of unsatisfiable and unrealizable cores for LTL
Science of Computer Programming
Evaluating LTL satisfiability solvers
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Propositional temporal proving with reductions to a SAT problem
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 0.00 |
We perform a comprehensive experimental evaluation of off-the-shelf solvers for satisfiability of propositional LTL. We consider a wide range of solvers implementing three major classes of algorithms: reduction to model checking, tableau-based approaches, and temporal resolution. Our set of benchmark families is significantly more comprehensive than those in previous studies. It takes the benchmark families of previous studies, which only have a limited overlap, and adds benchmark families not used for that purpose before. We find that no solver dominates or solves all instances. Solvers focused on finding models and solvers using temporal resolution or fixed point computation show complementary strengths and weaknesses. This motivates and guides estimation of the potential of a portfolio solver. It turns out that even combining two solvers in a simple fashion significantly increases the share of solved instances while reducing CPU time spent.