Advertisement

The Temporal Rover and the ATG Rover

  • Doron Drusinsky
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1885)

Abstract

The Temporal Rover is a specification based verification tool for applications written in C, C++, Java, Verilog and VHDL. The tool combines formal specification, using Linear-Time Temporal Logic (LTL) and Metric Temporal Logic (MTL), with conventional simulation/execution based testing. The Temporal Rover is tailored for the verification of complex protocols and reactive systems where behavior is time dependent. The Temporal Rover generates executable code from LTL and MTL assertions written as comments in the source code. This executable source code is compiled and linked as part of the application under test. During application execution the generated code validates the executing program against the formal temporal specification requirements. Using MTL, real time and relative time constraints can be validated. A special code generator supports validation of such constraints in the field, on an embedded target.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chang, E., Pnueli, A., Manna, Z.: Compositional Verification of Real-Time Systems. In: Proc. 9’th IEEE Symp. On Logic In Computer Science, pp. 458–465 (1994)Google Scholar
  2. 2.
    Hailpern, B.T., Owicki, S.: Modular Verification of Communication Protocols. IEEE Trans of comm. COM-31(1), 56–68 (1983) No. 1CrossRefGoogle Scholar
  3. 3.
    Manna, Z., Pnueli, A.: Verification of Concurrent Programs: Temporal Proof Principles. In: Proc. of the Workshop on Logics of Programs. LNCS, pp. 200–252. Springer, Heidelberg (1981)Google Scholar
  4. 4.
    Owicki, S., Lamport, L.: Proving Liveness Properties of Concurrent Programs. TOPLAS 4(3), 455–495 (1982)zbMATHCrossRefGoogle Scholar
  5. 5.
    Prior, A.: Past, Present and Future. Oxford University Press, Oxford (1967)zbMATHGoogle Scholar
  6. 6.
    Pnueli, A.: The Temporal Logic of Programs. In: Proc. 181977 IEEE Symp. on Foundations of Computer Science, pp. 46–57.Google Scholar
  7. 7.
    Sistla, A.P., Clarke, E.M.: The Complexity of Linear Propositional Temporal Logic. Journal of the ACM 32, 733–749 (1985)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Doron Drusinsky
    • 1
  1. 1.Time-Rover, Inc.CupertinoUSA

Personalised recommendations