The use of AI chatbots, such as ChatGPT, is increasingly popular across various domains, including education. While these tools offer valuable assistance to educators and students in teaching and learning activities, ...
详细信息
This study explores optimizing the Traveling Salesman Problem (TSP) using Q-Learning reinforcement learning. The proposed method builds a Q-table to learn the optimal path and employs dynamic programming for local opt...
详细信息
This paper introduces Hypersequent GV (HGV), a modular and extensible core calculus for functional programming with session types that enjoys deadlock freedom, confluence, and strong normalisation. HGV exploits hyper-...
详细信息
This paper introduces Hypersequent GV (HGV), a modular and extensible core calculus for functional programming with session types that enjoys deadlock freedom, confluence, and strong normalisation. HGV exploits hyper-environments, which are collections of type environments, to ensure that structural congruence is type preserving. As a consequence we obtain an operational correspondence between HGV and HCP-a process calculus based on hypersequents and in a propositions-as-types correspondence with classical linear logic (CLL). Our translations from HGV to HCP and vice-versa both preserve and reflect reduction. HGV scales smoothly to support Girard's Mix rule, a crucial ingredient for channel forwarding and exceptions.
The introduction of Belief Propagation in Constraint programming through the CP-BP framework makes possible the computation of an estimation of the probability that a given variable-value combination belongs to a solu...
详细信息
ISBN:
(纸本)9783031332708;9783031332715
The introduction of Belief Propagation in Constraint programming through the CP-BP framework makes possible the computation of an estimation of the probability that a given variable-value combination belongs to a solution. The availability of such marginal probability distributions, effectively ranking domain values, allows us to develop branching heuristics but also more generally to apply the concept of entropy to Constraint programming. We explore how variable and problem entropy can improve how we solve combinatorial problems in the CP-BP framework. We evaluate our proposal on an extensive set of benchmark instances.
This paper reports from design research developing a prototype for a metaphor-based tangible toolkit reifying basic programming concepts. We elicit a list of metaphors using expert interviews with computerscience lec...
详细信息
ISBN:
(纸本)9783031056574;9783031056567
This paper reports from design research developing a prototype for a metaphor-based tangible toolkit reifying basic programming concepts. We elicit a list of metaphors using expert interviews with computerscience lectures and co-design workshops with programming students and professional software developers. We continue to select metaphors most viable for a tangible toolkit and develop an interactive application for the metaphors mapping 3d models to associated programming code. We assess the application with computerscience students to understand how they use the application and how they relate manipulations to the 3d models to changes in the programming code. Our application serves as an example how programming concepts can be represented both as metaphors and tangibles. Our findings build a foundation to guide and inform further research in metaphors and tangibles used in computerscience education.
We present verification of a bare-metal server built using diverse implementation techniques and languages against a whole-system input-output specification in terms of machine code, network packets, and mathematical ...
详细信息
We present verification of a bare-metal server built using diverse implementation techniques and languages against a whole-system input-output specification in terms of machine code, network packets, and mathematical specifications of elliptic-curve cryptography. We used very different formal-reasoning techniques throughout the stack, ranging from computer algebra, symbolic execution, and verification-condition generation to interactive verification of functional programs including compilers for C-like and functional languages. All these component specifications and domain-specific reasoning techniques are defined and justified against common foundations in the Coq proof assistant. Connecting these components is a minimalistic specification style based on functional programs and assertions over simple objects, omnisemantics for program execution, and basic separation logic for memory layout. This design enables us to bring the components together in a top-level correctness theorem that can be audited without understanding or trusting the internal interfaces and tools. Our case study is a simple cryptographic server for flipping of a bit of state through public-key authenticated network messages, and its proof shows total functional correctness including static bounds on memory usage. This paper also describes our experiences with the specific verification tools we build upon, along with detailed analysis of reasons behind the widely varying levels of productivity we experienced between combinations of tools and tasks.
Digital microfluidic biochips allow the execution of biochemical protocols on a chip-scaled device delivering cost and performance advantages over the traditional benchtop wet-laboratory processes. Several microfluidi...
详细信息
ISBN:
(数字)9783031783807
ISBN:
(纸本)9783031783791;9783031783807
Digital microfluidic biochips allow the execution of biochemical protocols on a chip-scaled device delivering cost and performance advantages over the traditional benchtop wet-laboratory processes. Several microfluidic high-level programming languages have been proposed, but none is currently adopted as a standard since their compilers and execution engines often target specific platforms. To address this issue and favor standardization, we propose a biochip-independent execution engine and low-level target language. The execution engine supports the execution of parallel synchronized tasks allowing each droplet or process to be controlled by an independent task. The target language run by the engine is inspired by traditional computer instruction set architectures and offers instructions covering the full range of low-level functionalities offered by digital biochips. The versatility of the proposed solution and its ability to support the selection and iteration control structures commonly used in programs is demonstrated with a real-life case study that sorts droplets based on real-time measurements of their color.
In this paper we propose the design of a framework dedicated to facilitating the teaching of programming basics in the context of large classes of beginners. The biggest issue for the teachers of this type of classes,...
详细信息
Probabilistic programming languages rely fundamentally on some notion of sampling, and this is doubly true for probabilistic programming languages which perform Bayesian inference using Monte Carlo techniques. Verifyi...
详细信息
ISBN:
(纸本)9798350335873
Probabilistic programming languages rely fundamentally on some notion of sampling, and this is doubly true for probabilistic programming languages which perform Bayesian inference using Monte Carlo techniques. Verifying samplers-proving that they generate samples from the correct distribution-is crucial to the use of probabilistic programming languages for statistical modelling and inference. However, the typical denotational semantics of probabilistic programs is incompatible with deterministic notions of sampling. This is problematic, considering that most statistical inference is performed using pseudorandom number generators. We present a higher-order probabilistic programming language centred on the notion of samplers and sampler operations. We give this language an operational and denotational semantics in terms of continuous maps between topological spaces. Our language also supports discontinuous operations, such as comparisons between reals, by using the type system to track discontinuities. This feature might be of independent interest, for example in the context of differentiable programming. Using this language, we develop tools for the formal verification of sampler correctness. We present an equational calculus to reason about equivalence of samplers, and a sound calculus to prove semantic correctness of samplers, i.e. that a sampler correctly targets a given measure by construction.
We developed an information system using an object-oriented programming language and a distributed database (DDB) consisting of multiple interconnected databases across a computer network, managed by a distributed dat...
详细信息
暂无评论