Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Modal and temporal logic programming
Temporal logics and their applications
Journal of Symbolic Computation
ML for the working programmer
The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
Theoretical Computer Science
Dealing with multiple granularity of time in temporal logic programming
Journal of Symbolic Computation - Special issue: executable temporal logics
Timed rewriting logic with an application to object-based specification
Science of Computer Programming - Special issue: on formal specifications: foundations, methods, tools and applications: selected papers from the FMTA '95 conference (29–31 May 1995, Konstancin n. Warsaw, Poland)
An Overview of Temporal and Modal Logic Programming
ICTL '94 Proceedings of the First International Conference on Temporal Logic
Steam-Boiler Control Specification Problem
Formal Methods for Industrial Applications, Specifying and Programming the Steam Boiler Control (the book grow out of a Dagstuhl Seminar, June 1995).
The Steam-Boiler Problem in Lustre
Formal Methods for Industrial Applications, Specifying and Programming the Steam Boiler Control (the book grow out of a Dagstuhl Seminar, June 1995).
A Temporal Concurrent Constraint Programming Calculus
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Synchronous Programming of Reactive Systems
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
A PVS proof obligation generator for Lustre programs
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
| Hi-index | 0.00 |
We define a new generic operator, ∇, which can be used within any programming language which allows one to define discrete time intervals. Let Τ0, ..., Τn be the consecutive instants of an interval I, u a term and vΤi the value of u at instantΤi. We define the expression ∇(O,e,I) u as the first-order term (...((e O vΤ0) O vΤ1) ... O vΤn). We integrate this operator into timed rewrite systems, illustrate it through several examples and provide an efficient operational semantics which we have implemented.