A graph generation software package
SIGCSE '91 Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
Journal of the ACM (JACM)
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
An old-fashioned recipe for real time
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Computing Surveys (CSUR)
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Algebraic decision diagrams and their applications
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Approximate algorithms for time separation of events
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Efficient Algorithms for Interface Timing Verification
Formal Methods in System Design
Rate analysis for embedded systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Compositional verification of concurrent systems using Petri-net-based condensation rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
A timing-driven design and validation methodology for embedded real-time systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
An Analysis of Bitstate Hashing
Formal Methods in System Design
Temporal logics for real-time system specification
ACM Computing Surveys (CSUR)
Maintaining knowledge about temporal intervals
Communications of the ACM
Algorithms for Interface Timing Verification
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Real-Time Systems Design with PEP
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Nordic Journal of Computing
Timed Petri nets and preliminary performance evaluation
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Real-time specification patterns
Proceedings of the 27th international conference on Software engineering
A Scenario-Matching Approach to the Description and Model Checking of Real-Time Properties
IEEE Transactions on Software Engineering
A partial order semantics approach to the clock explosion problem of timed automata
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Symbolic model checking of UML activity diagrams
ACM Transactions on Software Engineering and Methodology (TOSEM)
MiBench: A free, commercially representative embedded benchmark suite
WWC '01 Proceedings of the Workload Characterization, 2001. WWC-4. 2001 IEEE International Workshop
Analysis and optimization of distributed real-time embedded systems
Proceedings of the 41st annual Design Automation Conference
Functional verification of task partitioning for multiprocessor embedded systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Romeo: a tool for analyzing time petri nets
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Multimedia monster [supercomputer on a single chip]
IEEE Spectrum
Thermal analysis of multiprocessor SoC applications by simulation and verification
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Hi-index | 0.00 |
This work presents a static timing-analysis method for verification of scenario-based real-time properties, on graphical task-level models of embedded applications. Scenario-based properties specify timing constraints which must be honored for specific control-flow behaviors and task execution orderings. Static checking of scenario-based properties currently requires computationally expensive model checking methods. Hence the proposed graph-based static timing-analysis algorithm improves upon the state-of-the-art. This is manifested in a significant performance advantage over timed model checking (up to 1000X in several cases), which suffers from state space explosion. The proposed algorithm also employs compositional reasoning and abstraction refinement for handling large problems. We also illustrate methods for using scenario-based timing analysis, which can act as alternatives to traditional timed model checking for verification of timed systems like FDDI and Fischer protocols. We implement this timing verification algorithm as a tool called SymTime and present experimental results for SymTime comparing it with SPIN, UPPAAL, and a TCTL model checker for Time Petri Nets, called Romeo.