Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Handbook of theoretical computer science (vol. B)
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
Reasoning about infinite computations
Information and Computation
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Model checking
Efficient Detection of Vacuity in Temporal Model Checking
Formal Methods in System Design - Special issue on CAV '97
Symbolic Model Checking
Another Look at LTL Model Checking
Formal Methods in System Design
Nontraditional Applications of Automata Theory
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
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
BDD-Based Decision Procedures for K
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
From bidirectionality to alternation
Theoretical Computer Science - Mathematical foundations of computer science
Debugging temporal specifications with concept analysis
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
SPOT: An Extensible Model Checking Library Using Transition-Based Generalized Büchi Automata
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Concepts of automata construction from LTL
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Sanity checks in formal verification
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Larger automata and less work for LTL model checking
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Verification from Declarative Specifications Using Logic Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A Framework for Inherent Vacuity
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
ActionScript bytecode verification with co-logic programming
Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security
Refining Real-Time System Specifications through Bounded Model- and Satisfiability-Checking
ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
Model checking contracts: a case study
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
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
Tableau Tool for Testing Satisfiability in LTL: Implementation and Experimental Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
LTL Goal Specifications Revisited
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Lattice-valued binary decision diagrams
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
On the virtue of patience: minimizing Büchi automata
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Optimized temporal monitors for SystemC
RV'10 Proceedings of the First international conference on Runtime verification
Automated generation of web service stubs using LTL satisfiability solving
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
A multi-encoding approach for LTL symbolic satisfiability checking
FM'11 Proceedings of the 17th international conference on Formal methods
Self-loop aggregation product: a new hybrid approach to on-the-fly LTL model checking
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Efficient büchi universality checking
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A logical approach to data-aware automated sequence generation
Transactions on Computational Science XV
LTL translation improvements in spot
VECoS'11 Proceedings of the Fifth international conference on Verification and Evaluation of Computer and Communication Systems
Labelled superposition for PLTL
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
LTL to büchi automata translation: fast and more deterministic
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Survey: Linear Temporal Logic Symbolic Model Checking
Computer Science Review
Runtime verification of traces under recording uncertainty
RV'11 Proceedings of the Second international conference on Runtime verification
Checking sanity of software requirements
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
Optimized temporal monitors for SystemC
Formal Methods in System Design
Bounded satisfiability checking of metric temporal logic specifications
ACM Transactions on Software Engineering and Methodology (TOSEM) - In memoriam, fault detection and localization, formal methods, modeling and design
On the relationship between LTL normal forms and Büchi automata
Theories of Programming and Formal Methods
Model checking with fairness assumptions using PAT
Frontiers of Computer Science: Selected Publications from Chinese Universities
LTL translation improvements in Spot 1.0
International Journal of Critical Computer-Based Systems
| Hi-index | 0.00 |
We report here on an experimental investigation of LTL satisfiability checking via a reduction to model checking. By using large LTL formulas, we offer challenging model-checking benchmarks to both explicit and symbolic model checkers. For symbolic model checking, we use both CadenceSMV and NuSMV. For explicit model checking, we use SPIN as the search engine, and we test essentially all publicly available LTL translation tools. Our experiments result in two major findings. First, most LTL translation tools are research prototypes and cannot be considered industrial quality tools. Second, when it comes to LTL satisfiability checking, the symbolic approach is clearly superior to the explicit approach.