Automatic generation of executable assertions for runtime checking temporal requirements

Proceedings of IEEE International Symposium on High Assurance Systems Engineering

Volumn , Issue , 2005, Pages 111-120

  Pintér, Gergely ^a   Majzik, István ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

DEPENDABILITY; SAFETY-CRITICAL SYSTEMS; TEMPORAL LOGIC;

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; EMBEDDED SYSTEMS; RESOURCE ALLOCATION; SECURITY SYSTEMS;

SYSTEMS ENGINEERING;

EID: 33847001208     PISSN: 15302059     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HASE.2005.6     Document Type: Conference Paper

References (9)

1. D. Drusinsky. The Temporal Rover and the ATG Rover. In Proc. SPIN workshop, volume 1885 of LNCS, pages 323-330. Springer-Verlag, 2000.
2. B. Finkbeiner and H. Sipma. Checking Finite Traces using Alternating Automata. In Electronic Notes in Theoretical Computer Science, volume 55. Elsevier, 2001.
3. C. Gacek, A. Romanovsky, and R. de Lemos, editors. Architecting Dependable Systems, volume 3549 of LNCS, chapter G. Pintér and I. Majzik: Runtime Verification of Statechart Implementations, pages 148-172. Springer-Verlag, 2005.
4. th IFIP WG6.1 Int. Symp. on Protocol. Specification, Testing and Verification XV. Chapman & Hall, Ltd., 1996.
5. K. Havelund and G. Roşu. Testing Linear Temporal Logic Formulae on Finite Execution Traces. Technical report, RIACS, November 2000.
6. K. Havelund and G. Roşu. Monitoring Java Programs with Java PathExplorer. Electronic Notes in Theoretical. Computer Science, 55, 2001.
7. th Annual Symp. on Foundations of Computer Science, 1977.
8. G. Roşu and K. Havelund. Syntesizing Dynamic Programming Algorithms from Linear Temporal Logic Formulae. Technical report, RIACS, January 2001.
9. th European Dependable Computing Conference, volume 2485 of LNCS, pages 253-270. Springer, 2002.