The proceedings contain 93 papers. The special focus in this conference is on Leveraging Applications of Formal Methods, Verification and Validation. The topics include: Bitcoin Covenants Unchained;designing a Demonst...
ISBN:
(纸本)9783030614669
The proceedings contain 93 papers. The special focus in this conference is on Leveraging Applications of Formal Methods, Verification and Validation. The topics include: Bitcoin Covenants Unchained;designing a Demonstrator of Formal Methods for Railways Infrastructure Managers;specifying Framing Conditions for Smart Contracts;making Tezos Smart Contracts More Reliable with Coq;UTxO- vs Account-Based Smart Contract Blockchain programming Paradigms;Native Custom Tokens in the Extended UTXO Model;UTXOma : UTXO with Multi-asset Support;towards Configurable and Efficient Runtime Verification of Blockchain Based Smart Contracts at the Virtual Machine Level;introduction;reliable Smart Contracts;compiling Quantitative Type Theory to Michelson for Compile-Time Verification and Run-time Efficiency in Juvix;efficient Static Analysis of Marlowe Contracts;accurate Smart Contract Verification Through Direct Modelling;smart Derivatives: On-Chain Forwards for Digital Assets;the Good, The Bad and The Ugly: Pitfalls and Best Practices in Automated Sound Static Analysis of Ethereum Smart Contracts;automated Verification of Embedded Control Software: Track Introduction;a Model-Based Approach to the Design, Verification and Deployment of Railway Interlocking System;guess What I’m Doing!: Rendering Formal Verification Methods Ripe for the Era of Interacting Intelligent Systems;on the Industrial Application of Critical Software Verification with VerCors;a Concept of Scenario Space Exploration with Criticality Coverage Guarantees: Extended Abstract;functional Verification of Smart Contracts via Strong Data Integrity;towards Automated Service-Oriented Verification of Embedded Control Software Modeled in Simulink;verifying Safety Properties of Robotic Plans Operating in Real-World Environments via logic-Based Environment Modeling;formally Proving Compositionality in Industrial Systems with Informal Specifications.
To solve the problems that current plug-in hybrid systems lack dynamics control ability and the efficient work areas of the engine and the motors do not match, by coupling a distributed drive system and a centralized ...
详细信息
ISBN:
(纸本)9781728136660
To solve the problems that current plug-in hybrid systems lack dynamics control ability and the efficient work areas of the engine and the motors do not match, by coupling a distributed drive system and a centralized drive system and adding a speed-up clutch, a new hybrid electric drive system named multi-mode coupling drive system is designed. The paper introduces the configuration and the drive modes of the system and the structure and control logic of the speed-up clutch, and establishes the mathematical model of the system. Taking dynamic programming algorithm as the optimization tool and New European Driving Cycle as the test cycle, the system parameters are optimized and the output torque of each power unit is dynamically assigned to optimize the energy consumption. The research results show that the dynamics performance requirements of different conditions can be satisfied by the coordinated control. Furthermore, because the operating points of the engine and the motors fall into their respective efficient ranges, the system efficiency can be improved.
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.
Constraint-logic object-oriented programming facilitates the development of applications that occasionally solve search problems. To that end it is possible to define constraints imperatively on-the-fly, using conditi...
详细信息
ISBN:
(纸本)9781450359337
Constraint-logic object-oriented programming facilitates the development of applications that occasionally solve search problems. To that end it is possible to define constraints imperatively on-the-fly, using conditions over free variables. As a result, the search space is defined dynamically at runtime, based on the evaluation of such conditions in control structures. Consequently, the search space can -intentionally or by accident - become infinitely large if recursion and/or loops are involved. It is therefore desirable that the corresponding encapsulated search can be controlled by application developers. To that end, we discuss mechanisms for encapsulating such a search space and retrieving solutions from it. Our implementation for Muli is based on an appropriately extended symbolic Java virtual machine and it leverages the Java Stream API to provide a control mechanism that integrates well with object-oriented programs. Moreover, we show how our language Muli behaves for some example programs.
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...
详细信息
Relational model finding is a successful technique which has been used in a wide range of problems during the last decade. This success is partly due to the fact that many problems contain relational structures which ...
详细信息
ISBN:
(纸本)9781450369954
Relational model finding is a successful technique which has been used in a wide range of problems during the last decade. This success is partly due to the fact that many problems contain relational structures which can be explored using relational model finders. Although these model finders allow for the exploration of such structures they often struggle with incorporating the non-relational elements. In this paper we introduce ALLEALLE, a method and language that integrates reasoning on both relational structure and non-relational elements -the data- of a problem. By combining first order logic with Codd's relational algebra, transitive closure, and optimization criteria, we obtain a rich input language for expressing constraints on both relational and scalar values. We present the semantics of ALLEALLE and the translation of ALLEALLE specifications to SMT constraints, and use the off-the-shelf SMT solver Z3 to find solutions. We evaluate ALLEALLE by comparing its performance with Kodkod, a state-of-the-art relational model finder, and by encoding a solution to the optimal package resolution problem. Initial benchmarking show that although the translation times of ALLEALLE can be improved, the resulting SMT constraints can efficiently be solved by the underlying solver.
In this paper(1), we propose a security methodology that automates the process of security zone specification and high-level network security requirements elicitation. We define a set of formalized rules derived from ...
详细信息
ISBN:
(纸本)9781450359337
In this paper(1), we propose a security methodology that automates the process of security zone specification and high-level network security requirements elicitation. We define a set of formalized rules derived from the principles of complete mediation, least privileges and the Clark-Wilson lite formal model making our approach traceable and verifiable. We implemented the methodology in Answer Set programming to automatically compute an optimal network security zone model considering the cost of the security solution. A use case study of an e-commerce enterprise network infrastructure illustrates our methodology.
We observe that normalization by evaluation for simply-typed lambda-calculus with weak coproducts can be carried out in a weak bi-cartesian closed category of presheaves equipped with a monad that allows us to perform...
详细信息
ISBN:
(纸本)9781450372497
We observe that normalization by evaluation for simply-typed lambda-calculus with weak coproducts can be carried out in a weak bi-cartesian closed category of presheaves equipped with a monad that allows us to perform case distinction on neutral terms of sum type. The placement of the monad influences the normal forms we obtain: for instance, placing the monad on coproducts gives us eta-long beta-pi normal forms where pi refers to permutation of case distinctions out of elimination positions. We further observe that placing the monad on every coproduct is rather wasteful, and an optimal placement of the monad can be determined by considering polarized simple types inspired by focalization. Polarization classifies types into positive and negative, and it is sufficient to place the monad at the embedding of positive types into negative ones. We consider two calculi based on polarized types: pure call-by-push-value (CBPV) and polarized lambda-calculus, the natural deduction calculus corresponding to focalized sequent calculus. For these two calculi, we present algorithms for normalization by evaluation. We further discuss different implementations of the monad and their relation to existing normalization proofs for lambda-calculus with sums. Our developments have been partially formalized in the Agda proof assistant.
logic replication is often necessary to improve speed of emulation for systems employing field programmable gate arrays (FPGAs), since design sizes are large enough requiring partitioning to fit a design into multiple...
详细信息
ISBN:
(纸本)9781450370998
logic replication is often necessary to improve speed of emulation for systems employing field programmable gate arrays (FPGAs), since design sizes are large enough requiring partitioning to fit a design into multiple (boards of) FPGAs. In this paper, we propose a polynomial time algorithm for combinational logic replication that ensures delay optimality for directed acyclic graphs and reduces overhead due to look-up table (LUT) and cut resources. The algorithm is further extended to consider combinational loops, often yielding delay optimal results. Experimental results on industrial designs show, on an average, 44%, 33%, and 33% reduction in overhead due to cut, LUT costs, and runtimes, respectively, compared to existing heuristics, thus demonstrating the efficiency of the algorithm.
Due to dynamical traffic flow changes in urban areas, traffic congestion occurs on many intersections over a certain period of time. Today there are still many traffic light controllers with fixed signal programs used...
详细信息
ISBN:
(纸本)9781728121819
Due to dynamical traffic flow changes in urban areas, traffic congestion occurs on many intersections over a certain period of time. Today there are still many traffic light controllers with fixed signal programs used on signalized intersections, which causes aggravation of the overall state of traffic. To solve this problem, some solutions have been presented within the field of Intelligent Transport Systems. This paper presents an adaptive traffic light controller based on fuzzy logic used for improving the traffic flow on an isolated intersection. Three methods of adaptive traffic light control have been designed in order to determine the urgency of a particular phase for adaptation of phase duration, phase sequence and simultaneously phase duration and sequence. The proposed adaptive methods are compared to a fixed controller in three scenarios with different traffic demands to prove their effectiveness. For this purpose, a model of an isolated intersection in the microscopic simulator PTV VISSIM, and a fuzzy based traffic light control system in the MATLAB programming environment have been implemented.
暂无评论