the fourth industrial revolution is driven by Software-enabled automation. To fully realize the potential of this digital transformation in a way that is beneficial to society, automation needs to become programmable ...
详细信息
We present Pyrus, a domain-specific online modeling environment for building graphical processes for data analysis, machine learning and artificial intelligence. Pyrus aims at bridging the gap between de facto (often ...
详细信息
the deterministic behavior of real-time communication networks is achieved by time-triggered periodic schedules for critical data traffic. Calculating such a schedule requires satisfying a lot of constraints, which in...
详细信息
the deterministic behavior of real-time communication networks is achieved by time-triggered periodic schedules for critical data traffic. Calculating such a schedule requires satisfying a lot of constraints, which in practice may be difficult due to the increasing number of data flows in the network. In the current approaches, the routes of flows are usually given or determined separately from the scheduling process. If the routes of flows can be computed jointly with scheduling, more flows could be scheduled since the algorithm chooses among alternative paths. this paper formalizes the problem of joint routing and scheduling of time-triggered periodic communication in Time-Sensitive Networks, guaranteeing the required deterministic nature of the communication, and proposes two models in Constraint programming formalism. We further apply the logic-Based Benders Decomposition on the proposed models and give an extensive experimental evaluation of our solutions showing that our novel approach that models waiting of frames in queues along withthe logic-Based Benders Decomposition exhibits the best performance and significantly increases the schedulability over the state-of-the-art methods.
Withthe advent of dedicated hardware for multicore programming, parallel algorithms have become omnipresent. For example, various algorithms have been proposed for the parallel computation of a prefix sum in the lite...
详细信息
ISBN:
(纸本)9783030557539;9783030557546
Withthe advent of dedicated hardware for multicore programming, parallel algorithms have become omnipresent. For example, various algorithms have been proposed for the parallel computation of a prefix sum in the literature. As the prefix sum is a basic building block for many other multicore algorithms, such as sorting, its correctness is of utmost importance. this means, the algorithm should be functionally correct, and the implementation should be thread and memory safe. In this paper, we use deductive program verification based on permission-based separation logic, as supported by VerCors, to show correctness of the two most frequently used parallel in-place prefix sum algorithms for an arbitrary array size. Interestingly, the correctness proof for the second algorithm reuses the auxiliary lemmas that we needed to create the first proof. To the best of our knowledge, this paper is the first tool-supported verification of functional correctness of the two parallel in-place prefix sum algorithms which does not make any assumption about the size of the input array.
the proceedings contain 32 papers. the topics discussed include: differences of opinion;Kurt Weichselberger’s contribution to imprecise probabilities;SOS for bounded rationality;a polarity theory for sets of desirabl...
the proceedings contain 32 papers. the topics discussed include: differences of opinion;Kurt Weichselberger’s contribution to imprecise probabilities;SOS for bounded rationality;a polarity theory for sets of desirable gambles;modeling Markov decision processes with imprecise probabilities using probabilistic logicprogramming;empirical interpretation of imprecise probabilities;Bayesian inference under ambiguity: conditional prior belief functions;computable randomness is inherently imprecise;weak Dutch books versus strict consistency with lower previsions;and reconciling Bayesian and frequentist tests: the imprecise counterpart.
We study languages that specify Markov Decision Processes with Imprecise Probabilities (MDPIPs) by mixing probabilities and logicprogramming. We propose a novel language that can capture MDPIPs and Markov Decision Pr...
详细信息
We present Effpi: an experimental toolkit for strongly-typed concurrent and distributed programming in Dotty, with verification capabilities based on type-level model checking. Effpi addresses a main challenge in crea...
详细信息
ISBN:
(纸本)9781450368247
We present Effpi: an experimental toolkit for strongly-typed concurrent and distributed programming in Dotty, with verification capabilities based on type-level model checking. Effpi addresses a main challenge in creating and maintaining concurrent programs: errors like protocol violations, deadlocks, and livelocks are often spotted late, at run-time, when applications are tested or (worse) deployed. Effpi aims at finding them early, when code is written and compiled. Effpi provides: (1) a set of Dotty classes for describing communication protocols as types;(2) an embedded DSL for concurrent programming, with process-based and actor-based abstractions;(3) a Dotty compiler plugin to verify whether protocols and programs enjoy desirable properties, such as deadlock-freedom;and (4) an efficient run-time system for executing Effpi's DSL-based programs. the combination of (1) and (2) allows the Dotty compiler to check whether an Effpi program implements a desired protocol/-type;and this, together with (3), means that many typical concurrent programming errors are found and ruled out at compile-time. Further, (4) allows to run highly concurrent Effpi programs with millions of interacting processes/actors, by scheduling them on a limited number of CPU cores. In this paper, we give an overview of Effpi, illustrate its design and main features, and discuss its future.
It is difficult to find an effective algorithm for solving NP complete problems such as integer programming. the nanostructure constructed by DNA origami combines huge parallelism and massive storage capacity of DNA c...
详细信息
We describe new capabilities added to the Java Modeling Language and the OpenJML deductive program verification tool to support functionalprogramming features introduced in Java 8. We also report on the application o...
详细信息
ISBN:
(数字)9783030035921
ISBN:
(纸本)9783030035921;9783030035914
We describe new capabilities added to the Java Modeling Language and the OpenJML deductive program verification tool to support functionalprogramming features introduced in Java 8. We also report on the application of the extensions to a secure streaming protocol library developed by Amazon Web Services and used as a foundation by services it provides. We found that the application under study used a small set of functionalprogramming idioms;methods using these idioms could be verified by techniques that used only first-order logic and did not need all the features that might be required for full generality of functionalprogramming.
In view of the shortcomings of traditional Modern logic Design experiments, the experimental design method based on multi-platforms is proposed. the cooperative teaching mode based on project are adopted, which guides...
详细信息
In view of the shortcomings of traditional Modern logic Design experiments, the experimental design method based on multi-platforms is proposed. the cooperative teaching mode based on project are adopted, which guides the students to adopt modular design ideas to design a more complex digital system. the design of the modulation and demodulation system shows that the method combines the software simulation and the hardware experiment well, and improves the students' ability to solve the complex problems in the comprehensive application of the related theories. Correspondingly the students' ability to experiment independently are fostered, and the student achievements have been greatly improved.
暂无评论