Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Model checking
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
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Improved Automata Generation for Linear Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
Fluent model checking for event-based systems
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
Nested emptiness search for generalized Büchi automata
Fundamenta Informaticae - Special issue on application of concurrency to system design (ACSD'04)
Temporal Logic with Capacity Constraints
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Partial Translation Verification for Untrusted Code-Generators
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Implementing an LTL-to-Büchi translator in Erlang: a protest experience report
Proceedings of the 8th ACM SIGPLAN workshop on ERLANG
On-the-fly Emptiness Check of Transition-Based Streett Automata
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
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
Proceedings of the 14th international SPIN conference on Model checking software
GOAL extended: towards a research tool for omega automata and temporal logic
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
On the virtue of patience: minimizing Büchi automata
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Enacting declarative languages using LTL: avoiding errors and improving performance
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Synoptic: summarizing system logs with refinement
SLAML'10 Proceedings of the 2010 workshop on Managing systems via log analysis and machine learning techniques
Büchi store: an open repository of büchi automata
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
A multi-encoding approach for LTL symbolic satisfiability checking
FM'11 Proceedings of the 17th international conference on Formal methods
State coverage metrics for specification-based testing with Büchi automata
TAP'11 Proceedings of the 5th international conference on Tests and proofs
Symbolic algorithm for generation büchi automata from LTL formulas
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
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
On-the-fly emptiness checks for generalized büchi automata
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Transparent partial order reduction
Formal Methods in System Design
LTL translation improvements in spot
VECoS'11 Proceedings of the Fifth international conference on Verification and Evaluation of Computer and Communication Systems
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
Nested Emptiness Search for Generalized Büchi Automata
Fundamenta Informaticae - APPLICATION OF CONCURRENCY TO SYSTEM DESIGN (ACSD'04)
GOAL for games, omega-automata, and logics
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
On the relationship between LTL normal forms and Büchi automata
Theories of Programming and Formal Methods
LTL translation improvements in Spot 1.0
International Journal of Critical Computer-Based Systems
| Hi-index | 0.00 |
Model checking is an automated technique for checking that a system satisfies a set of required properties. With explicit-state model checkers, properties are typically defined in linear-time temporal logic (LTL), and are translated into B眉chi automata in order to be checked. This paper describes how, by labeling automata transitions rather than states, we significantly reduce the size of automata generated by existing tableau-based translation algorithms. Our optimizations apply to the core of the translation process, where generalized B眉chi automata are constructed. These automata are subsequently transformed in a single efficient step into B眉chi automata as used by model checkers. The tool that implements the work described here is released as part of the Java Path-Finder software (JPF), an explicit state model checker of Java programs under development at the NASA Ames Research Center.