Towards an Algebra for Real-Time Programs

Dongol, Brijesh; Hayes, Ian J.; Meinicke, Larissa; Solin, Kim

doi:10.1007/978-3-642-33314-9_4

Cited by 10 publications

(27 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have developed a variation of this theory that addresses the difficulties of reasoning at the boundary between two intervals by requiring that two adjoining intervals are disjoint. This allows one to use the same framework to reason about both discrete and hybrid properties [18,19,21,22].…”

Section: Intervals and Interval Predicatesmentioning

confidence: 99%

“…We assume that interval predicates are ordered using universal entailment ( ) with false the least element and true the greatest [22].…”

Section: Chop and Iterationmentioning

confidence: 99%

“…The following lemmas allow one to fold/unfold infinite and finite iterations and to prove iterative definitions via induction [6,22,36]. For an interval predicate p, we let p + = p ; p * and p ω+ = p ; p ω denote the finite and possibly infinite positive iterations of p, respectively.…”

Section: Chop and Iterationmentioning

confidence: 99%

“…However, 2p may not join and 3p may not split. We have the following lemma relating interval predicates that split and join [22].…”

Section: Interval Predicate Operatorsmentioning

confidence: 99%

“…However, unlike Back and von Wright, we address real-time issues by basing our semantics on an algebra for interval predicates [22,35,36]. This allows one to improve uniformity across the model by enabling one to use interval predicates to express system requirements as well as program behaviour.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Deriving real-time action systems with multiple time bands using algebraic reasoning

Dongol

Hayes

Derrick

2014

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

The verify-while-develop paradigm allows one to incrementally develop programs from their specifications using a series of calculations against the remaining proof obligations. This paper presents a derivation method for real-time systems with realistic constraints on their behaviour. We develop a high-level intervalbased logic that provides flexibility in an implementation, yet allows algebraic reasoning over multiple granularities and sampling multiple sensors with delay. The semantics of an action system is given in terms of interval predicates and algebraic operators to unify the logics for an action system and its properties, which in turn simplifies the calculations and derivations.

show abstract

Section: Intervals and Interval Predicatesmentioning

confidence: 99%

“…We assume that interval predicates are ordered using universal entailment ( ) with false the least element and true the greatest [22].…”

Section: Chop and Iterationmentioning

confidence: 99%

Section: Chop and Iterationmentioning

confidence: 99%

“…However, 2p may not join and 3p may not split. We have the following lemma relating interval predicates that split and join [22].…”

Section: Interval Predicate Operatorsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Deriving real-time action systems with multiple time bands using algebraic reasoning

Dongol

Hayes

Derrick

2014

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

show abstract

Reasoning Algebraically About Refinement on TSO Architectures

Dongol

Derrick

Smith

2014

Theoretical Aspects of Computing – ICTAC 2014

Self Cite

View full text Add to dashboard Cite

Abstract. The Total Store Order memory model is widely implemented by modern multicore architectures such as x86, where local buffers are used for optimisation, allowing limited forms of instruction reordering. The presence of buffers and hardware-controlled buffer flushes increases the level of non-determinism from the level specified by a program, complicating the already difficult task of concurrent programming. This paper presents a new notion of refinement for weak memory models, based on the observation that pending writes to a process' local variables may be treated as if the effect of the update has already occurred in shared memory. We develop an interval-based model with algebraic rules for various programming constructs. In this framework, several decomposition rules for our new notion of refinement are developed. We apply our approach to verify the spinlock algorithm from the literature.

show abstract

An Interval Logic for Stream-Processing Functions: A Convolution-Based Construction

Dongol

2017

Communications in Computer and Information Science

View full text Add to dashboard Cite

Towards an Algebra for Real-Time Programs

Cited by 10 publications

References 12 publications

Deriving real-time action systems with multiple time bands using algebraic reasoning

Deriving real-time action systems with multiple time bands using algebraic reasoning

Reasoning Algebraically About Refinement on TSO Architectures

An Interval Logic for Stream-Processing Functions: A Convolution-Based Construction

Contact Info

Product

Resources

About