The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Computing with continuous change
Science of Computer Programming - Special issue on concurrent constraint programming
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Asserting the Precision of Floating-Point Computations: A Simple Abstract Interpreter
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A foundation for computation
Domain theory and differential calculus (functions of one variable)
Mathematical Structures in Computer Science
Variance analyses from invariance analyses
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
GRKLib: a Guaranteed Runge Kutta Library
SCAN '06 Proceedings of the 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics
Denotational semantics of hybrid automata
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Integrating physical systems in the static analysis of embedded control software
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
A computational model for multi-variable differential calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Proving the Correctness of the Implementation of a Control-Command Algorithm
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
| Hi-index | 0.02 |
In this article, we present a model and a denotational semantics for hybrid systems. Our model is designed to be used for the verification of large, existing embedded applications. The discrete part is modeled by a program written in an extension of an imperative language and the continuous part is modeled by differential equations. We give a denotational semantics to the continuous system inspired by what is usually done for the semantics of computer programs and then we show how it merges into the semantics of the whole system. The semantics of the continuous system is computed as the fix-point of a modified Picard operator which increases the information content at each step.