Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Design and validation of computer protocols
Design and validation of computer protocols
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Strategic directions in software engineering and programming languages
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Research: Designing bug-free protocols with SPIN
Computer Communications
Abstraction in Software Model Checking: Principles and Practice (Tutorial Overview and Bibliography)
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
alpha SPIN: Extending SPIN with Abstraction
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Refinement of LTL Formulas for Abstract Model Checking
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
| Hi-index | 0.00 |
One of the current trends in model checking for the verification of concurrent systems is to reduce the state space produced by the model, and one of the more promising ways to achieve this objective is to support some kind of automatic construction of more abstract models. This paper presents a proposal in this direction. The main contribution of the paper is the definition of a semantics framework which allows us to relate different models of the system, each one with a particular abstraction level. Automatic source-to-source transformation is supported by this formal basis. The method is applied to Promela models.