Analyzing Real-Time Event-Driven Programs

Authors:
Pierre Ganty;Rupak Majumdar
Affiliations:
CS Department, University of California, Los Angeles, USA and IMDEA Software, Spain;IMDEA Software, Spain
Venue:
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Year:
2009

Citing 10
Cited 1

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Foundations of programming languages

Foundations of programming languages
The embedded machine: predictable, portable real-time code

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Giotto: A Time-Triggered Language for Embedded Programming

EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Time-Safety Checking for Embedded Programs

EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Computation: finite and infinite machines

Computation: finite and infinite machines
Virgil: objects on the head of a pin

Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Interprocedural analysis of asynchronous programs

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verifying liveness for asynchronous programs

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking multithreaded programs with asynchronous atomic methods

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification

Algorithmic verification of asynchronous programs

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Embedded real-time systems are typically programmed in low-level languages which provide support for event-driven task processing and real-time interrupts. We show that the model checking problem for real-time event-driven Boolean programs for safety properties is undecidable. In contrast, the model checking problem is decidable for languages such as Giotto which statically limit the creation of tasks. This gives a technical reason (static analyzability) to prefer higher-level programming models for real-time programming, in addition to the usual readability and maintainability arguments.