Linear-time subtransitive control flow analysis
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Model checking
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Computer assisted manipulation of algebraic process specifications
ACM SIGPLAN Notices
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Model-checking processes with data
Science of Computer Programming
Parameterised boolean equation systems
Theoretical Computer Science - Formal methods for components and objects
Implementing Influence Analysis Using Parameterised Boolean Equation Systems
ISOLA '06 Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation
A Model Checking Language for Concurrent Value-Passing Systems
FM '08 Proceedings of the 15th international symposium on Formal Methods
Instantiation for Parameterised Boolean Equation Systems
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Invariants for Parameterised Boolean Equation Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Equivalence checking for infinite systems using parameterized Boolean equation systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Consistent consequence for boolean equation systems
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
An overview of the mCRL2 toolset and its recent advances
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
Parameterised Boolean Equation Systems (PBESs) can be used to encode and solve various types of model checking and equivalence checking problems. PBESs are typically solved by symbolic approximation or by instantiation to Boolean Equation Systems (BESs). The latter technique suffers from something similar to the state space explosion problem and we propose to tackle it by static analysis techniques, which we tailor for PBESs. We introduce a method to eliminate redundant parameters and a method to detect constant parameters. Both lead to a better performance of the instantiation and they can sometimes even reduce problems that are intractable due to the infinity of the underlying BES to tractable ones.