Making Components Contract Aware
Computer
A Formal Proof of the Deadline Driven Scheduler
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Towards a Formal Semantics of Verilog Using Duration Calculus
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Duration Calculus of Weakly Monotonic Time
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
On the Design of Hybrid Control Systems Using Automata Models
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Toward a theory of sequential hybrid programs
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Some Extensions to Propositional Mean-Value Caculus: Expressiveness and Decidability
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
A Duration Calculus with Infinite Intervals
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Semantics and Completeness of Duration Calculus
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Modeling and Verification of Biphase Mark Protocolsin Duration Calculus Using PVS
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
A Denotational Semantics of Timed RSL Using Duration Calculus
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Completeness of temporal logics over infinite intervals
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Toward a formal model for component interfaces for real-time systems
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
On the completeness and decidability of duration calculus with iteration
Theoretical Computer Science
rCOS: a refinement calculus of object systems
Theoretical Computer Science - Components and objects
Timing and Concurrency Specification in Component-based Real-Time Embedded Systems Development
TASE '07 Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering
Verification of linear duration properties over continuous-time markov chains
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Verification of linear duration properties over continuous-time markov chains
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
The notion of contract was introduced to component-based software development in order to facilitate the semantically correct composition of components. We extend the form of this notion which is based on designs to capture probabilistic requirements on execution time. We show how reasoning about such requirements can be done in an infinite-interval-based system of probabilistic duration calculus.