Proceedings of the Fourth Annual Symposium on Logic in computer science
Real-Time Scheduling Theory and Ada
Computer
Experiments with a Program Timing Tool Based on Source-Level Timing Schema
Computer - Special issue on real-time systems
Compositional reachability analysis using process algebra
TAV4 Proceedings of the symposium on Testing, analysis, and verification
MIDAS: Integrated Design and Simulation of Distributed Systems
IEEE Transactions on Software Engineering
ACM Transactions on Software Engineering and Methodology (TOSEM)
Enhancing compositional reachability analysis with context constraints
SIGSOFT '93 Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering
A graphical interval logic for specifying concurrent systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
Oracles for checking temporal properties of concurrent systems
SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Generation of multi-formalism state-space analysis tools
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Constructing abstract models of concurrent real-time software
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
International Symposium on Software Testing and Analysis
Timing Analysis of Ada Tasking Programs
IEEE Transactions on Software Engineering - Special issue: best papers of the 1996 international symposium on software testing and analysis ISSTA'96
Generating oracles from your favorite temporal logic specifications
SIGSOFT '96 Proceedings of the 4th ACM SIGSOFT symposium on Foundations of software engineering
Interval logics and their decision procedures: part I: an interval logic
Theoretical Computer Science
ICSE '97 Proceedings of the 19th international conference on Software engineering
Parallel hybrid models in system design
WSC '93 Proceedings of the 25th conference on Winter simulation
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems
IEEE Transactions on Software Engineering
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Automated support for testing and debugging of real-time programs using oracles
ACM SIGSOFT Software Engineering Notes
Logic Control and “Reactive” Systems: Algorithmization and Programming
Automation and Remote Control
Duration Properties over Real Time System Designs
IWSSD '00 Proceedings of the 10th International Workshop on Software Specification and Design
Embedded Systems Design
The recommendation architecture: lessons from large-scale electronic systems applied to cognition
Cognitive Systems Research
| Hi-index | 0.02 |
Most analysis methods for real-time systems assume that all the components of the system are at roughly the same stage of development and can be expressed in a single notation, such as a specification or programming language. There are, however, many situations in which developers would benefit from tools that could analyze partially-implemented systems, those for which some components are given only as high-level specifications while others are fully implemented in a programming language. In this paper, we propose a method for analyzing such partially-implemented real-time systems. Here we consider real-time concurrent systems for which some components are implemented in Ada and some are partially specified using regular expressions and Graphical Interval Logic (GIL), a real-time temporal logic. We show how to construct models of the partially-implemented systems that account for such properties as run-time overhead and scheduling of processes, yet support tractable analysis of nontrivial programs. The approach can be fully automated, and we illustrate it by analyzing a small example.