Compiling short‐circuit boolean expressions in one pass

Logothetis, G.; Mishra, P.E.

doi:10.1002/spe.4380111104

Cited by 6 publications

(4 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Meanwhile, the local DSS updates all atomic observations ε with the last information and sets the value with <true or false or unknown> (i.e., Fill < Tid, comparison_op, threshold >, as seen in the example in Fig. 4), then calculates the Boolean value of the subexpression χ o with short-circuit technology [27], and takes the action ε a based on the value of its successor χ o .…”

Section: ) Preprocessing and Situation Evaluationmentioning

confidence: 99%

“…The actor v i,j waits and composes the events from the precursors. When Θχ p < Tid χ o , value > can be calculated with the short-circuit technology [27], it sends the feedback events to its precursors. And if the trigger condition is true, v i,j could adjust its speed (or sleep) and finish the activity within the time τ w i−1,j + τ d i,j .…”

Section: E Strategy Of Runtime Refinement At Decision Processing Periodmentioning

confidence: 99%

See 1 more Smart Citation

Improving the Dependability of Self-Adaptive Cyber Physical System With Formal Compositional Contract

et al. 2020

View full text Add to dashboard Cite

To adapt to the uncertain environment smartly and timely, cyber physical systems (CPSs) have to interact with the physical world in a decentralized but rigorous, organized way. Guaranteeing the timing reliability is key to achieve consensus on the order of distributed events, as well as dependable cooperative decision processing. Based on our hierarchically decentralized compositional self-adaptive framework, we propose a formal compositional reliability-contract-based solution to guarantee the timing reliability of event observation and decision processing in a large-scale, geographically distributed CPS. As the prophetic decision may not fit the local situation well because of the uncertainties, we propose a gradual contract optimization solution to refine the dependability, timeliness, and energy consumption. Following the seven proposed composition schemes, we employ the nondominated sorting genetic algorithm II (NSGA-II) algorithm to optimize arrangement of decision. Moreover, a topology-aware time reserving solution is applied to improve the resilience of processing time and to tolerance timing failures. Both simulation results and real-world testing are introduced to evaluate the efficacy of our proposal. We believe that the formal compositional contract will be a competitive CPS solution to analyze requirements and optimize the self-adaptation decision at runtime.

show abstract

Section: ) Preprocessing and Situation Evaluationmentioning

confidence: 99%

Section: E Strategy Of Runtime Refinement At Decision Processing Periodmentioning

confidence: 99%

Improving the Dependability of Self-Adaptive Cyber Physical System With Formal Compositional Contract

et al. 2020

View full text Add to dashboard Cite

show abstract

“…The development of algorithms for optimizing code for short-circuit evaluation took place over a number of years and is described by Minker and Minker [5], with subsequent work done by Logothetis and Mishra [4]. The choice of the evaluation technique to use for Boolean expressions is a design decision that is addressed differently in different programming languages.…”

Section: Introductionmentioning

confidence: 99%

A comparison of space requirements for short-circuit and full evaluation of Boolean expressions

Clifton

1998

Proceedings of the 36th Annual Southeast Regional Conference on - ACM-SE 36

View full text Add to dashboard Cite

Short-circuit evaluation, instead of full evaluation, of Boolean expressions is a technique used in programming languages to save execution time and prevent run-time errors. In addition, use of short-circuiting may save space for the object code needed to evaluate Boolean expressions. In this article we show that whether shortcircuit or full evaluation requires less space depends on the processor architecture, the type of expression, and the compiler. After examining the types of Boolean expressions commonly used in programs, we give the minimal instruction sequences needed for their evaluation on a CISC architecture, a stack architecture, and a RISC architecture. We show that for commonly used architectures and Boolean expressions, short-circuit evaluation often requires less space for object code than full evaluation.

show abstract

“…Short-cut evaluation is a standard topic in compiling [1,9,34]. The author is not aware of any treatment of it in one-pass CPS transformations or in one-pass transformations into monadic normal form.…”

Section: Related Work Conclusion and Future Workmentioning

confidence: 99%