Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Current trends in concurrency. Overviews and tutorials
A calculus of refinements for program derivations
Acta Informatica
Applications of temporal logic to the specification of real time systems (extended abstract)
Proceedings of a Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Parallel program design: a foundation
Parallel program design: a foundation
Automata for modeling real-time systems
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Temporal proof methodologies for real-time systems
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CAAP '90 Proceedings of the fifteenth colloquium on CAAP'90
The existence of refinement mappings
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
Fault-tolerant programming by transformations
Fault-tolerant programming by transformations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Temporal proof methodologies for timed transition systems
Information and Computation
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Reliability Issues in Computing System Design
ACM Computing Surveys (CSUR)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
Formal verification of parallel programs
Communications of the ACM
Specification and Compositional Verification of Real-Time Systems
Specification and Compositional Verification of Real-Time Systems
Duration Specifications for Shared Processors
Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
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
Specifying and Verifying Fault-Tolerant Systems
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
Dynamic Scheduling in the Presence of Faults: Specification and Verification
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
A combination of interval logic and linear temporal logic
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
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
Verifying duration properties of timed transition systems
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Kronos: A Model-Checking Tool for Real-Time Systems
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Mechanical Verification of Concurrent Systems with TLA
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Formalizing Real-Time Scheduling as Program Refinement
ARTS '97 Proceedings of the 4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software: Transformation-Based Reactive Systems Development
The Versus Language: Representing Time Efficiently with BDDs
ARTS '97 Proceedings of the 4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software: Transformation-Based Reactive Systems Development
Deductive Verification of Real-Time Systems Using STeP
ARTS '97 Proceedings of the 4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software: Transformation-Based Reactive Systems Development
An Old-Fashioned Recipe for Real Time
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Stepwise Development of Fault-Tolerant Reactive Systems
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
Verification of fault tolerance and real time
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Reasoning About Programs by Exploiting the Environment
Reasoning About Programs by Exploiting the Environment
Specifying Schedulability for Real-Time Programs
Specifying Schedulability for Real-Time Programs
Dynamic Scheduling and Fault-Tolerance: Specification andVerification
Real-Time Systems
Theoretical Computer Science - Dependable computing
Using Transition Systems to Unify UML Models
ICFEM '02 Proceedings of the 4th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
A Methodology for the Construction of Scheduled Systems
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Synthesis of fault-tolerant concurrent programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automated Online Monitoring of Distributed Applications through External Monitors
IEEE Transactions on Dependable and Secure Computing
Parametric Analysis of an Improved Fault Tolerant System
Electronic Notes in Theoretical Computer Science (ENTCS)
Design and Verification of Fault-Tolerant Components
Methods, Models and Tools for Fault Tolerance
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Formal Methods in System Design
Automated addition of fault recovery to cyber-physical component-based models
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Feasibility of Stepwise Design of Multitolerant Programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
rCOS: a formal model-driven engineering method for component-based software
Frontiers of Computer Science in China
Model checking linear duration invariants of networks of automata
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Embedded Systems Design
Component-based software engineering
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Revisiting failure detection and consensus in omission failure environments
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Achieving fault tolerance by a formally validated interaction policy
Rigorous Development of Complex Fault-Tolerant Systems
Failure-divergence semantics and refinement of long running transactions
Theoretical Computer Science
Encapsulating deontic and branching time specifications
Theoretical Computer Science
Model checking propositional deontic temporal logic via a μ-calculus characterization
SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
A theory of fault recovery for component-based models
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
| Hi-index | 0.00 |
Fault-tolerance and timing have often been considered to be implementation issues of a program, quite distinct from the functional safety and liveness properties. Recent work has shown how these non-functional and functional properties can be verified in a similar way. However, the more practical question of determining whether a real-time program will meet its deadlines, i.e., showing that there is a feasible schedule, is usually done using scheduling theory, quite separately from the verification of other properties of the program. This makes it hard to use the results of scheduling analysis in the design, or redesign, of fault-tolerant and real-time programs. This article shows how fault-tolerance, timing, and schedulability can be specified and verified using a single notation and model. This allows a unified view to be taken of the functional and nonfunctional properties of programs and a simple transformational method to be usedto combine these properties. It also permits results from scheduling theory to be interpreted and used within a formal proof framework. The notation and model are illustrated using a simple example.