Communicating sequential processes
Communicating sequential processes
Design and validation of computer protocols
Design and validation of computer protocols
Handbook of theoretical computer science (vol. B)
A stubborn attack on state explosion
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Model checking and boolean graphs
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
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)
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Petri nets in cryptographic protocols
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
A Strategy for Improving the Efficiency of Procedure Verification
SAFECOMP '02 Proceedings of the 21st International Conference on Computer Safety, Reliability and Security
Ten Years of Partial Order Reduction
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Structural Symmetry and Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Generating BDDs for Symbolic Model Checking in CCS
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Verification of distributed programs using representative interleaving sequences
Distributed Computing
SAT-based verification of LTL formulas
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
An improved case-based approach to LTL model checking
RISE'05 Proceedings of the Second international conference on Rapid Integration of Software Engineering Techniques
Characteristic patterns for LTL
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
| Hi-index | 0.00 |
Memory is one of the critical resources in model checking. This paper discusses a strategy for reducing peak memory in model checking by case-based partitioning of the search space. This strategy combines model checking for verification of different cases and static analysis or expert judgment for guaranteeing the completeness of the cases. Description of the static analysis is based on using PROMELA as the modeling language. The strategy is applicable to a subset of models including models for verification of certain aspects of protocols.