the proceedings contain 18 papers. the special focus in this conference is on Reversible Computation. the topics include: Quantum CNOT Circuits Synthesis for NISQ Architectures Using the Syndrome Decoding Problem;maxi...
ISBN:
(纸本)9783030524814
the proceedings contain 18 papers. the special focus in this conference is on Reversible Computation. the topics include: Quantum CNOT Circuits Synthesis for NISQ Architectures Using the Syndrome Decoding Problem;maximality of Reversible Gate Sets;search-Based Transformation Synthesis for 3-Valued Reversible Circuits;ReverCSP: Time-Travelling in CSP Computations;reversible Computations in logicprogramming;towards a Formal Account for Software Transactional Memory;encoding Reversing Petri Nets in Answer Set programming;a Reversible Runtime Environment for Parallel Programs;reversible Occurrence Nets and Causal Reversible Prime Event Structures;involutory Turing Machines;Event Structures for the Reversible Early Internal$$\pi $$ -Calculus;hermes: A Language for Light-Weight Encryption;reversible programming Languages Capturing Complexity Classes;on the Expressivity of Total Reversible programming Languages;toward a Curry-Howard Equivalence for Linear, Reversible Computation: Work-in-Progress;a Tutorial Introduction to Quantum Circuit programming in Dependently Typed Proto-Quipper.
We propose to extend an existing framework combining abstract interpretation and continuous constraint programming for numerical invariant synthesis, by using more expressive underlying abstract domains, such as zonot...
详细信息
ISBN:
(纸本)9783030636173;9783030636180
We propose to extend an existing framework combining abstract interpretation and continuous constraint programming for numerical invariant synthesis, by using more expressive underlying abstract domains, such as zonotopes. the original method, which relies on iterative refinement, splitting and tightening a collection of abstract elements until reaching an inductive set, was initially presented in combination with simple underlying abstract elements: boxes and octagons. the novelty of our work is to use zonotopes, a sub-polyhedric domain that shows a good compromise between cost and precision. As zonotopes are not closed under intersection, we had to extend the existing framework, in addition to designing new operations on zonotopes, such as a novel splitting algorithm based on paving zonotopes by sub-zonotopes and parallelotopes. We implemented this method on top of the APRON library, and tested it on programs with non-linear loops that present complex, possibly non-convex, invariants. We present some results demonstrating boththe interest of this splitting-based algorithm to synthesize invariants on such programs, and the good compromise presented by its use in combination with zonotopes with respect to its use with both simpler domains such as boxes and octagons, and more expressive domains such as polyhedra.
Hand-optimized assembly language code is often difficult to formally verify. this paper combines Hoare logic with verified code transformations to make it easier to verify such code. this approach greatly simplifies e...
详细信息
ISBN:
(纸本)9783030636173;9783030636180
Hand-optimized assembly language code is often difficult to formally verify. this paper combines Hoare logic with verified code transformations to make it easier to verify such code. this approach greatly simplifies existing proofs of highly optimized OpenSSL-based AES-GCM cryptographic code. Furthermore, applying various verified transformations to the AES-GCM code enables additional platform-specific performance improvements.
In this paper, we present a linear and reversible language withinductive and coinductive types, together with a Curry-Howard correspondence withthe logic mu MALL: linear logic extended with least and greatest fixed ...
详细信息
ISBN:
(纸本)9783030524814;9783030524821
In this paper, we present a linear and reversible language withinductive and coinductive types, together with a Curry-Howard correspondence withthe logic mu MALL: linear logic extended with least and greatest fixed points allowing inductive and coinductive statements. Linear, reversible computation makes an important sub-class of quantum computation without measurement. In the latter, the notion of purely quantum recursive type is not yet well understood. Moreover, models for reasoning about quantum algorithms only provide complex types for classical datatypes: there are usually no types for purely quantum objects beside tensors of quantum bits. this work is a first step towards understanding purely quantum recursive types.
We propose a formal model of block-structured project scheduling with resource constraints, withthe goal of designing optimization algorithms. We combine block structured modeling of business processes with results f...
详细信息
ISBN:
(纸本)9783030410322;9783030410315
We propose a formal model of block-structured project scheduling with resource constraints, withthe goal of designing optimization algorithms. We combine block structured modeling of business processes with results from project scheduling literature. Differently from standard approaches, here we focus on block structured scheduling processes. Our main achievement is the formulation of an abstract mathematical model of block-structured resource-constrained scheduling processes. We tested the correctness and feasibility of our approach using an initial experimental prototype based on Constraint logicprogramming.
Contemporary society is pervaded by complex processes. A company's success may depend on the proper definition, handling and management of its processes. Automated process management is fundamental to efficiently,...
详细信息
ISBN:
(纸本)9781728143842
Contemporary society is pervaded by complex processes. A company's success may depend on the proper definition, handling and management of its processes. Automated process management is fundamental to efficiently, effectively and economically carry out complex processes. In particular, process discovery is fundamental to automatically obtain process models from available executions of processes, because manually building these models is complex, costly and error-prone. Very important is incrementality in learning and adapting the models. this is not trivial, especially if the model includes multi-perspectiveness and guards. this paper describes the incremental process discovery strategy of the WOMAN framework for workflow management, based on First-Order logic. It is fully and inherently incremental, it is more expressive than standard formalisms adopted in the literature, and ensures strict adherence to the observed practices. the incremental behavior of WoMan is also analyzed, reporting several experiments that show its effectiveness and efficiency.
Learning to program can be quite difficult for CS1 students. they must master language syntax, programmingtheory and problem-solving techniques in a short period of time. Consequently, a significant percentage of stu...
详细信息
Software-defined networking (SDN) and network function virtualization (NFV) technologies have emerged as promising paradigms in recent innovations for deploying users' demanded services. In this context, service f...
详细信息
ISBN:
(纸本)9781665408509
Software-defined networking (SDN) and network function virtualization (NFV) technologies have emerged as promising paradigms in recent innovations for deploying users' demanded services. In this context, service function chaining (SFC) helps telecommunication operators to provide complex network services and improve their performance. this paper first addresses the service function chain deployment problem as an integer linear programming (ILP) problem under an impractical non-causal assumption about the network information for which we provide a solution in a centralized fashion. However, in real-life networks, distributed schemes are more scalable. Also, some parameters, such as the latency of the links, fluctuate over time because of the sharing nature of cloud datacenters, and their probabilistic distributions are unknown prior to deployment. therefore, we re-formulate the NFV -based SFC deployment problem as a noisy weighted congestion game and rely only on the actually experienced delay samples on each of the links to configure SFCs in a near-optimal fashion. In particular, we propose a multi-agent learning based algorithm using which each agent decides its VNF -based service chain only based on its own history of adopted actions and realized costs. By changing the network configuration, simulation results show that our proposed algorithm is at most 18% worse than the optimal solution, and in some situations, it behaves exactly the same as optimal results.
It is well-known that the "Unsorted Database" quantum algorithm by Grover gives quadratic speedup to several important combinatorial and enumerative problems, such as: SAT, Graph Coloring, Maximum Cliques, T...
详细信息
ISBN:
(纸本)9783030524814;9783030524821
It is well-known that the "Unsorted Database" quantum algorithm by Grover gives quadratic speedup to several important combinatorial and enumerative problems, such as: SAT, Graph Coloring, Maximum Cliques, Travelling Salesman and many others. Recently, quantum programming languages such as Quipper start to be used to design, verify and simulate practical quantum algorithms for important problems in Quantum Machine Learning. So far, however, no methodologies have been created to program Grover Oracles for particular classes of problems. In contrast, such methodologies have been already created for classical Constraint Satisfaction Problems. the goal of this invited talk is to show results of some initial research towards creating systematic methodologies to program quantum computers that solve search problems in Artificial Intelligence, logic Design and Machine Learning. Our methods are based on unified oracle blocks for such problem representations as set partition algebra, cube calculus and optimal mappings. For instance, several important problems in CAD and Machine Learning can be solved using only two basic operations on set partitions;Pi(1) <= Pi(2) and Pi 1 center dot Pi 2. Moreover, building oracles is the fundamental concept in the new approach to solve CSP proposed here and based on Invertible logic introduced recently by Supriyo Datta and his team.
the proceedings contain 35 papers. the special focus in this conference is on Computational Intelligence in Security for Information Systems. the topics include: Deep Wavelet Extreme Learning Machine for Data Classifi...
ISBN:
(纸本)9783030200046
the proceedings contain 35 papers. the special focus in this conference is on Computational Intelligence in Security for Information Systems. the topics include: Deep Wavelet Extreme Learning Machine for Data Classification;palm Vein Age and Gender Estimation Using Center Symmetric-Local Binary Pattern;neuro-Evolutionary Feature Selection to Detect Android Malware;improving Blockchain Security Validation and Transaction Processing through Heterogeneous Computing;anomaly Detection on Patients Undergoing General Anesthesia;an Internet Voting Proposal Towards Improving Usability and Coercion Resistance;linearization of Cryptographic Sequences;On-the-Fly Testing an Implementation of Arrow Lightweight PRNG Using a LabVIEW Framework;a Novel Construction for Streaming Networks with Delays;comparison of System Call Representations for Intrusion Detection;hyot: Leveraging Hyperledger for Constructing an Event-Based Traceability System in IoT;data Mining for Statistical Evaluation of Summative and Competency-Based Assessments in Mathematics;looking for the Antidote for Contaminated Water: Learning through an Escape Game;enhancing Collaborative Learning through Pedagogical Alignment;rules_Math: Establishing Assessment Standards;evaluate Mathematical Competencies in Engineering Using Video-Lessons;statistical Methods – What Is the Problem Here?;enhancing the Learning of Cryptography through Concept Maps;analysis of Student Achievement Scores: A Machine Learning Approach;analysis of Teacher Training in Mathematics in Paraguay’s Elementary Education System Using Machine Learning Techniques;Efficient Verification of Security Protocols Time Properties Using SMT Solvers;cooperative Evaluation Using Moodle;automatic Categorization of Introductory programming Students;using Scratch to Improve Undergraduate Students’ Skills on Artificial Intelligence;project-Based Methodology to Lecture on Web Frameworks Applied to the Management of Health-Related Data;mirkwood: An Online Parallel Craw
暂无评论