Adding time dimension to relational model and extending relational algebra
Information Systems
On completeness of historical relational query languages
ACM Transactions on Database Systems (TODS)
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Property preserving abstractions for the verification of concurrent systems
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Temporal abstract interpretation
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking
Making abstract interpretations complete
Journal of the ACM (JACM)
Querying ATSQL databases with temporal logic
ACM Transactions on Database Systems (TODS)
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Temporal Triggers in Active Databases
IEEE Transactions on Knowledge and Data Engineering
On the Completeness of Model Checking
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Temporal Query Languages: A Survey
ICTL '94 Proceedings of the First International Conference on Temporal Logic
Relative Completeness of Abstraction Refinement for Software Model Checking
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Model-Checking: A Tutorial Introduction
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Imcompleteness of States w.r.t traces in model Checking
Information and Computation
Incompleteness of states w.r.t. traces in model checking
Information and Computation
| Hi-index | 0.00 |
In POPL'00, Cousot and Cousot showed that the classical state-based model checking of a verygeneral temporal language called 碌-calculus is an incomplete abstract interpretation of its trace-based semantics. In ESOP'01, Ranzato showed that the least refinement of the state-based model checking semantics of the 碌-calculus which is complete w.r.t. its trace-based semantics exists, and it is essentially the trace-based semantics itself. The analogous problem in the opposite direction is solved bythe present paper. First, relativelyto any incomplete temporal connective of the 碌-calculus, we characterize the structure of the models, i.e. transition systems, for which the state-based model checking is trace-complete. On this basis, we prove that the unique abstraction of the state-based model checking semantics of the 碌-calculus (actually, of any fragment allowing conjunctions) which is complete w.r.t. the trace-based semantics is the straightforward semantics carrying no information at all. The following consequence can be drawn: there is no wayto either refine or abstract sets of states in order to get a model checking algorithm for (any fragment allowing conjunctions of) the 碌-calculus which is trace-complete.