Model Checking Linearizability via Refinement
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Scalable Multi-core Model Checking Fairness Enhanced Systems
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
SpecDiff: debugging formal specifications
Proceedings of the IEEE/ACM international conference on Automated software engineering
Developing model checkers using PAT
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Model checking hierarchical probabilistic systems
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
A semantics for Behavior Trees using CSP with specification commands
Science of Computer Programming
Differencing labeled transition systems
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
ACARP: auto correct activity recognition rules using process analysis toolkit (PAT)
ICOST'12 Proceedings of the 10th international smart homes and health telematics conference on Impact Ananlysis of Solutions for Chronic Disease Prevention and Management
Automatic generation of provably correct embedded systems
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
An analytical and experimental comparison of CSP extensions and tools
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Build your own model checker in one month
Proceedings of the 2013 International Conference on Software Engineering
Model checking with fairness assumptions using PAT
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
High level specification languages like CSP use mathematical objects as abstractions to represent systems and processes. System behaviors are described as process expressions combined with compositional operators, which are associated with elegant algebraic laws for system analysis. Nonetheless, modeling systems with non-trivial data and functional aspects using CSP remains difficult. In this work, we propose a modeling language named CSP# (short for communicating sequential programs) which integrates high-level modeling operators with low-level procedural codes, for the purpose of efficient mechanical system verification. We demonstrate that data operations can be modeled as terminating sequential programs, which can be composed using high-level compositional operators. CSP# is supported by the PAT model checker and has been applied to a number of systems.