Andrzej S Murawski,Nikos Tzevelekos
Andrzej S Murawski
We present a full classification of decidable and undecidable cases for contextual equivalence in a finitary ML-like language equipped with full ground storage (both integers and reference names can be stored). The simplest undecidable type...
Stefan Jakšić,Ezio Bartocci,Radu Grosu et al.
Stefan Jakšić et al.
In cyber-physical systems (CPS), physical behaviors are typically controlled by digital hardware. As a consequence, continuous behaviors are discretized by sampling and quantization prior to their processing. Quantifying the similarity betw...
From non-preemptive to preemptive scheduling using synchronization synthesis [0.03%]
从非抢占调度到抢占调度的同步合成方法研究
Pavol Černý,Edmund M Clarke,Thomas A Henzinger et al.
Pavol Černý et al.
We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program ...
Under-approximating loops in C programs for fast counterexample detection [0.03%]
用于快速反例检测的C程序循环下近似方法
Daniel Kroening,Matt Lewis,Georg Weissenbacher
Daniel Kroening
Many software model checkers only detect counterexamples with deep loops after exploring numerous spurious and increasingly longer counterexamples. We propose a technique that aims at eliminating this weakness by constructing auxiliary path...
Thomas Reinbacher,Matthias Függer,Jörg Brauer
Thomas Reinbacher
We present a runtime verification framework that allows on-line monitoring of past-time Metric Temporal Logic (ptMTL) specifications in a discrete time setting. We design observer algorithms for the time-bounded modalities of ptMTL, which t...