Communicating sequential processes
Communicating sequential processes
The Z notation: a reference manual
The Z notation: a reference manual
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Object-Z specification language
The Object-Z specification language
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Liveness and Fairness in Duration Calculus
CONCUR '94 Proceedings of the Concurrency Theory
Take It NP-Easy: Bounded Model Construction for Duration Calculus
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Constructing Test Automata from Graphical Real-Time Requirements
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Combining Specification Techniques for Processes, Data and Time
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
An Old-Fashioned Recipe for Real Time
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Modular verification of software components in C
Proceedings of the 25th International Conference on Software Engineering
CSP-OZ-DC: a combination of specification techniques for processes, data and time
Nordic Journal of Computing
Duration Calculus: A Formal Approach to Real-Time Systems (Monographs in Theoretical Computer Science. an Eatcs Seris)
Transition predicate abstraction and fair termination
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transition predicate abstraction and fair termination
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bounded validity checking of interval duration logic
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Optimizing slicing of formal specifications by deductive verification
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Extending a Component Specification Language with Time
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic Verification of Combined Specifications: An Overview
Electronic Notes in Theoretical Computer Science (ENTCS)
MceSim: A Multi-Car Elevator Simulator
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Slicing concurrent real-time system specifications for verification
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Verifying CSP-OZ-DC specifications with complex data types and timing parameters
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Slicing an integrated formal method for verification
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Model checking duration calculus: a practical approach
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
We present a new model-checking technique for CSP-OZ-DC, a combination of CSP, Object-Z and Duration Calculus, that allows reasoning about systems exhibiting communication, data and real-time aspects. As intermediate layer we will use a new kind of timed automata that preserve events and data variables of the specification. These automata have a simple operational semantics that is amenable to verification by a constraint-based abstraction-refinement model checker. By means of a case study, a simple elevator parameterised by the number of floors, we show that this approach admits model-checking parameterised and infinite state real-time systems.