Communicating sequential processes
Communicating sequential processes
Symbolic model checking using SAT procedures instead of BDDs
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Model checking
Bounded model checking for the universal fragment of CTL
Fundamenta Informaticae
Towards Bounded Model Checking for the Universal Fragment of TCTL
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach (Studies in Computational Intelligence)
Improvements in SAT-based Reachability Analysis for Timed Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
ACTLS properties and Bounded Model Checking
Fundamenta Informaticae
Bounded Model Checking for the Existential Fragment of TCTL_{-G} and Diagonal Timed Automata
Fundamenta Informaticae
SAT-Based Reachability Checking for Timed Automata with Discrete Data
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
√erics: a tool for verifying timed automata and estelle specifications
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
A new approach to bounded model checking for branching time logics
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Improved bounded model checking for a fair branching-time temporal epistemic logic
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Bounded parametric model checking for elementary net systems
Transactions on Petri nets and other models of concurrency IV
Parametric model checking with verICS
Transactions on Petri nets and other models of concurrency IV
Improved bounded model checking for a fair branching-time temporal epistemic logic
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
The BMC method for the existential part of RTCTLK and interleaved interpreted systems
EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
Symbolic model checking for temporal-epistemic logic
Logic Programs, Norms and Action
SAT-Based bounded model checking for deontic interleaved interpreted systems
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Autonomous Agents and Multi-Agent Systems
A New Translation from ECTL* to SAT
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
| Hi-index | 0.00 |
The objective of this paper is to offer an improvement to the translation from ECTL to SAT introduced in [14] and show that the improvement proposed substantially increases the efficiency of verifying temporal properties using the Bounded Model Checking method. We have implemented our new translation and made preliminary experimental results, which demonstrate the efficiency of the method.