LUSTRE: a declarative language for real-time programming
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Handbook of logic in computer science (vol. 3)
Functional reactive programming from first principles
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Translating discrete-time simulink to lustre
ACM Transactions on Embedded Computing Systems (TECS)
Hybrid Systems: Computation and Control: 8th International Workshop, HSCC 2005, Zurich, Switzerland, March 9-11, 2005, Proceedings (Lecture Notes in Computer Science)
Constructing invariants for hybrid systems
Formal Methods in System Design
Abstract Simulation: A Static Analysis of Simulink Models
ICESS '09 Proceedings of the 2009 International Conference on Embedded Software and Systems
Modelling of Complex Systems: Systems as Dataflow Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Dependent types from counterexamples
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic invariant generation for hybrid systems using ideal fixed points
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Logical Analysis of Hybrid Systems: Proving Theorems for Complex Dynamics
Logical Analysis of Hybrid Systems: Proving Theorems for Complex Dynamics
Divide and recycle: types and compilation for a hybrid synchronous language
Proceedings of the 2011 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
Proceedings of the 2011 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
Programming with infinitesimals: a WHILE-language for hybrid system modeling
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Stochastic differential dynamic logic for stochastic hybrid programs
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Ultrametric Semantics of Reactive Programs
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Operational semantics of hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Generating polynomial invariants for hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Non-standard semantics of hybrid systems modelers
Journal of Computer and System Sciences
From hybrid data-flow languages to hybrid automata: a complete translation
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
An operational semantics for Simulink's simulation engine
Proceedings of the 13th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, Tools and Theory for Embedded Systems
The Complete Proof Theory of Hybrid Systems
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Exercises in nonstandard static analysis of hybrid systems
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Hi-index | 0.00 |
We exploit the apparent similarity between (discrete-time) stream processing and (continuous-time) signal processing and transfer a deductive verification framework from the former to the latter. Our development is based on rigorous semantics that relies on nonstandard analysis (NSA). Specifically, we start with a discrete framework consisting of a Lustre-like stream processing language, its Kahn-style fixed point semantics, and a program logic (in the form of a type system) for partial correctness guarantees. This stream framework is transferred as it is to one for hyperstreams---streams of streams, that typically arise from sampling (continuous-time) signals with progressively smaller intervals---via the logical infrastructure of NSA. Under a certain continuity assumption we identify hyperstreams with signals; our final outcome thus obtained is a deductive verification framework of signals. In it one verifies properties of signals using the (conventionally discrete) proof principles, like fixed point induction.