The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Reasoning about infinite computations
Information and Computation
ACM Transactions on Computational Logic (TOCL)
Model Checking of Safety Properties
Formal Methods in System Design
Another Look at LTL Model Checking
Formal Methods in System Design
A Hardware Semantics Based on Temporal Intervals
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Checking Safety Properties Using Induction and a SAT-Solver
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Focus Games for Satisfiability and Completeness of Temporal Logic
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Specifying and Analyzing Early Requirements: Some Experimental Results
RE '03 Proceedings of the 11th IEEE International Conference on Requirements Engineering
Formal analysis of hardware requirements
Proceedings of the 43rd annual Design Automation Conference
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures
Journal of Automated Reasoning
From PSL to NBA: a Modular Symbolic Encoding
FMCAD '06 Proceedings of the Formal Methods in Computer Aided Design
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Syntactic optimizations for PSL verification
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Symbolic implementation of alternating automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Bounded model checking for weak alternating büchi automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Incremental and complete bounded model checking for full PLTL
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
PSL model checking and run-time verification via testers
FM'06 Proceedings of the 14th international conference on Formal Methods
The COMPASS Approach: Correctness, Modelling and Performability of Aerospace Systems
SAFECOMP '09 Proceedings of the 28th International Conference on Computer Safety, Reliability, and Security
Diagnostic information for realizability
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Formalizing requirements with object models and temporal constraints
Software and Systems Modeling (SoSyM)
Analyzing unsynthesizable specifications for high-level robot behavior using LTLMoP
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Evaluating LTL satisfiability solvers
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Towards a notion of unsatisfiable cores for LTL
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Towards a notion of unsatisfiable and unrealizable cores for LTL
Science of Computer Programming
Validation of requirements for hybrid systems: A formal approach
ACM Transactions on Software Engineering and Methodology (TOSEM)
Hi-index | 0.00 |
Increasing interest towards property based design calls for effective satisfiability procedures for expressive temporal logics, e.g. the IEEE standard Property Specification Language (PSL). In this paper, we propose a new approach to the satisfiability of PSL formulae; we follow recent approaches to decision procedures for Satisfiability Modulo Theory, typically applied to fragments of First Order Logic. The underlying intuition is to combine two interacting search mechanisms: on one side, we search for assignments that satisfy the Boolean abstraction of the problem; on the other, we invoke a solver for temporal satisfiability on the conjunction of temporal formulae corresponding to the assignment. Within this framework, we explore two directions. First, given the fixed polarity of each constraint in the theory solver, aggressive simplifications can be applied. Second, we analyze the idea of conflict reconstruction: whenever a satisfying assignment at the level of the Boolean abstraction results in a temporally unsatisfiable problem, we identify inconsistent subsets that can be used to rule out possibly many other assignments. We propose two methods to extract conflict sets on conjunctions of temporal formulae (one based on BDD-based Model Checking, and one based on SAT-based Simple Bounded Model Checking). We analyze the limits and the merits of the approach with a thorough experimental evaluation.