The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Handbook of theoretical computer science (vol. B)
Reasoning about infinite computations
Information and Computation
Formally verifying a microprocessor using a simulation methodology
DAC '94 Proceedings of the 31st annual Design Automation Conference
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Efficient generation of counterexamples and witnesses in symbolic model checking
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Coverage estimation for symbolic model checking
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the complexity of unique solutions
Journal of the ACM (JACM)
Model checking
Efficient Detection of Vacuity in Temporal Model Checking
Formal Methods in System Design - Special issue on CAV '97
Coverage Metrics for Functional Validation of Hardware Designs
IEEE Design & Test
Vacuity Checking in the Modal Mu-Calculus
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Coverage Metrics for Temporal Logic Model Checking
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Expressibility results for linear-time and branching-time logics
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
A practical decision method for propositional dynamic logic (Preliminary Report)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A Practical Introduction to PSL (Series on Integrated Circuits and Systems)
A Practical Introduction to PSL (Series on Integrated Circuits and Systems)
Learning abstractions for model checking
Learning abstractions for model checking
Easier and More Informative Vacuity Checks
MEMOCODE '07 Proceedings of the 5th IEEE/ACM International Conference on Formal Methods and Models for Codesign
Responsibility and blame: a structural-model approach
Journal of Artificial Intelligence Research
Finding environment guarantees
FASE'07 Proceedings of the 10th international conference on Fundamental approaches to software engineering
Syntactic optimizations for PSL verification
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
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
Temporal antecedent failure: refining vacuity
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Strengthening properties using abstraction refinement
Proceedings of the Conference on Design, Automation and Test in Europe
Robust Vacuity for Branching Temporal Logic
ACM Transactions on Computational Logic (TOCL)
Towards a notion of unsatisfiable and unrealizable cores for LTL
Science of Computer Programming
| Hi-index | 0.00 |
In formal verification, we verify that a system is correct withrespect to a specification. Cases like antecedent failure can makea successful pass of the verification procedure meaningless.Vacuity detection can signal such "meaningless" passes of thespecification, and indeed vacuity checks are now a standardcomponent in many commercial model checkers.We address two dimensions of vacuity: the computational effortand the information that is given to the user. As for the firstdimension, we present several preliminary vacuity checks that canbe done without the design itself, which implies that someinformation can be found with a significantly smaller effort. Asfor the second dimension, we present algorithms for deriving twotypes of information that are not provided by standard vacuitychecks, assuming $M\models\varphi$ for a model M andformula φ: (a) behaviors that are possibly missingfrom M (or wrongly restricted by the environment) (b) thelargest subset of occurrences of literals in φ thatcan be replaced with false simultaneously without falsifyingφ in M. The complexity of each of theseproblems is proven. Overall this extra information can lead totighter specifications and more guidance for finding errors.