Proof Tools Research Articles

Role Of Visum Et Revertum And Provision In The Process Of Civil Action And Proposal Of Coveration (Study Resolution Number 50/Pid.Sus-Kids/2023/Pt Medan)

Proof is the most important thing in the judicial process, it is used to find the material truth that is the complete truth of a criminal case. In proof there are various means of proof such as testimony of witnesses, expert testimonies, letters, instructions, and indictments of the accused. In criminal acts of persecution, asylum, and murder, visum et repertum is often used as a means of proof in its proof. The study aims to identify and analyze the role of visum et repertum (ver) in the proof of a criminal offence under the Code of Criminal Procedure Law (KUHAP), and the function of visa et repertrum (ver), in the study of judgment No. 50/pid.sus-anak/2023/pt field). This research includes a type of normative jurisprudence that is supported by empirical research to obtain accurate or valid data. Based on the research carried out on the case study of judgment No. 50/PID.SUS-ANAK/2023/PT MEDAN) No.1267/ PID/B/2010/PN.JKT.BAR, it is a legal proof tool that has a connection to the judge in particular in decision-making. Nevertheless, the judge is free to judge the truth contained in the evidence of a letter issued by such an expert. Therefore, in deciding a matter, return to the judge himself, which is to be based on the reasoning and consideration of the law. Furthermore, as one of the means of proof referred to in article 184, paragraph (1) of the Covenant, the visa et repertum shall be the discretion of the judge and shall be used as a guideline or as a grip in delivering a sentence against the offender. For in the testimony of the expert, the testimony of the judiciary called Visum et repertum, so clearly described what really is the cause of a crime, whether it is persecution, serious injuries if resulting in death.

Randomized Testing of RISC-V CPUs Using Direct Instruction Injection

TestRIG (Testing with Random Instruction Generation) is a testing framework for RISC-V implementations. The RISC-V community has standardized a formal model of the architecture in the Sail language <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> , giving a human-readable specification that can also be used for simulation and verification. The Sail language is designed for this purpose by allowing instruction semantics to be described conveniently (for example, by supporting variable bit-widths). Ideally, a RISC-V implementor could formally prove equivalence between their implementation and the Sail model, but proof tools are not yet sufficiently automated to be routinely used on the whole-processor level. They instead focus on equivalence between combinational logic functions, with verification of a full out-of-order microarchitecture remaining an open problem. As a pragmatic compromise, we use TestRIG to check equivalence between the model and an implementation by generating random instruction sequences, executing the same sequences on the model and the implementation under test, and comparing execution traces (tandem execution). This approach does not prove equivalence but can demonstrate divergence, and is usable in all stages of development.

Research on the higher-order logic formalization of fractance element

Fractance element reflects the fractional order behavior of circuits, which can show the characteristics of the actual circuits. Higher-order logic theorem proving is based on the rigorous and correct mathematical theories. It becomes more and more important in the verifications of high-reliability systems. Fractance element is formalized using the proof of higher-order logic theorem in this paper. Firstly, the formalized model of fractional calculus which is based on Caputo definition is established in higher-order logic theorem proof tool. Then some properties of fractional calculus are proved, including the zero order property, the fractional differential of a constant and the consistency of fractional calculus and integer order calculus. Finally, fractance element and fractional differential circuit constituted by fractance element are formally analyzed. These formalizations demonstrate the effectiveness of the formal method in the analysis of fractance element.

The Renormalization Group

The renormalization group was originally introduced as a multiscale approach to quantum field theory and the theory of critical phenomena, explaining in particular the universality observed e.g. in critical exponents. Over the years it has become a powerful tool in the mathematical analysis of systems with infinitely many interacting degrees of freedom. Its applications include quantum field theories, classical and quantum statistical mechanics, (stochastic) partial differential equations, operator theory, and probability theory. For some important problems, it is the only known tool for mathematical proofs. The last few years have seen further important developments, in particular in the application of the method to probabilistic questions, and to equilibrium and non-equilibrium quantum statistical mechanics. This workshop has given an account of the most important new developments in the last five years, including methodical progress, current applications, relations to other approaches, and identified new challenges that may be tackled in future work with the help of the renormalization group.

Convergence analysis of two conservative finite difference fourier pseudo-spectral schemes for klein-Gordon-Dirac system

In this paper, we propose and study two conservative finite difference Fourier pseudo-spectral schemes numerically solving the Klein-Gordon-Dirac (KGD) system with periodic boundary conditions. The resulting numerical schemes are time symmetric and proved to conserve the discrete mass and the discrete energy. We give a rigorously convergence analysis for the schemes. Specifically, we establish the error estimates which are without any restrictions (CFL condition) on the ratio of time step to space step. The convergence rates of the new schemes are proved to be the temporal second-order and spatial spectral-order, respectively, in a Hm-norm. The main proof tools include the ideas of standard mathematical induction and the method of defining energy. Finally, we give the numerical experiments to support our theoretical analysis and error bounds.

Consensus Control of Highway On-Ramp Merging With Communication Delays

In the environment of intelligent and connected vehicles, the information sharing level among vehicles and infrastructure get comprehensively improved. Aiming at the cooperative merging control at highway ramp, we present a two-stage hybrid cooperative control framework considering communication time delays including centralized decision-making for grouping with sequencing and distributed consensus control. The centralized controller is based on a grouping strategy and a cost function for minimizing total travel time and delays and determining the optimal vehicle passage order. Then we model the merging vehicles formation as a multi-agent system, which also could be viewed as a distributed controlling system. Combining with the multi-agent consensus method, it could achieve the desired inter-vehicle distance and speed. The proof tool is the Lyapunov-Krasovskii stability theorem in terms of convergence and formation stability. Finally, we design three simulation scenarios through varying the number of vehicles. Meanwhile, in order to verify the resistance of the algorithm to communication time delays, three conditions with respect to no time delays, heterogeneous time delays, and homogeneous time delays are considered. Simulation result verifies the advantage of the proposed method compared with the Hamilton control method. The efficiency of the proposed method is impervious in three different types of communication time delays and has approximately 30%, 25%, 15% improvement over that of the Hamiltonian method, respectively. Furthermore, the adaptation and effectiveness of the proposed method is demonstrated under different volumes of traffic flow and communication delays.

Reports and the their annexes prepared by the European anti-fraud office in the pre-trial criminal proceedings

The article is related to а specific procedure – the inclusion and application of the reports and their annexes prepared by the European anti-fraud office (OLAF) in the Bulgarian pre-trial proceedings. The reports and their annexes are prepared according to Regulation 883/2013 which regulates all the activities of OLAF in the EU and third countries. The reports and their annexes are a specific tool for our legislation and they can be used in the pre-trial proceedings as written proof tools according to the Bulgarian Criminal Procedure Code. This article explains the OLAF’s structure and the practical application of the OLAF’s reports and their annexes during the pre-trial investigation and focuses on the main problems which are encountered in the investigation practice related to their application as well.

The Number of $k$-Dimensional Corner-Free Subsets of Grids

A subset $A$ of the $k$-dimensional grid $\{1,2, \dots, N\}^k$ is said to be $k$-dimensional corner-free if it does not contain a set of points of the form $\{ \textbf{a} \} \cup \{ \textbf{a} + de_i : 1 \leq i \leq k \}$ for some $\textbf{a} \in \{1,2, \dots, N\}^k$ and $d &gt; 0$, where $e_1,e_2, \ldots, e_k$ is the standard basis of $\mathbb{R}^k$. We define the maximum size of a $k$-dimensional corner-free subset of $\{1,2, \ldots, N\}^k$ as $c_k(N)$. In this paper, we show that the number of $k$-dimensional corner-free subsets of the $k$-dimensional grid $\{1,2, \dots, N\}^k$ is at most $2^{O(c_k(N))}$ for infinitely many values of $N$. Our main tools for proof are the hypergraph container method and the supersaturation result for $k$-dimensional corners in sets of size $\Theta(c_k(N))$.

Elementary proofs of infinitely many congruences for k-elongated partition diamonds

In 2007, Andrews and Paule published the eleventh paper in their series on MacMahon's partition analysis, with a particular focus on broken k-diamond partitions. On the way to broken k-diamond partitions, Andrews and Paule introduced the idea of k-elongated partition diamonds. Recently, Andrews and Paule revisited the topic of k-elongated partition diamonds. Using partition analysis and the Omega operator, they proved that the generating function for the partition numbers dk(n) produced by summing the links of k-elongated plane partition diamonds of length n is given by (q2;q2)∞k(q;q)∞3k+1 for each k≥1. A significant portion of their recent paper involves proving several congruence properties satisfied by d1,d2 and d3, using modular forms as their primary proof tool. In this work, our goal is to extend some of the results proven by Andrews and Paule in their recent paper by proving infinitely many congruence properties satisfied by the functions dk for an infinite set of values of k. The proof techniques employed are all elementary, relying on generating function manipulations and classical q-series results.

Production of human embryonic kidney 293T cells stably expressing C-X-C chemokine receptor type 4 (CXCR4) as a screening tool for anticancer lead compound targeting CXCR4

AimThe C-X-C chemokine-receptor type 4 (CXCR4) is an emerging target for cancer drug discovery due to its high expression in cancer cells. The present study aimed to produce CXCR4 overexpressing HEK293T cells for a non-radioactive binding assay as a platform to identify drug candidates targeting CXCR4. Main methodsHEK293T cells stably expressing human CXCR4 were constructed by transfection of CXCR4 plasmids from the human CXCR4 gene. The CXCR4 overexpressing HEK293T cells were obtained by fluorescence-activated sorting and verified by conducting the competition binding assay of a known CXCR4 inhibitor, AMD3100 (plerixafor), to determine the IC50 value against monoclonal anti-human CD184 (hCD184) antibody tagged with fluorescence probe, phycoerythrin (PE). The non-radioactive binding assay using CXCR4 overexpressing HEK293T cells and PE-anti hCD184 was applied as a platform for identifying the target of natural compounds that exhibited cytotoxicity against cancer cell lines. Key findingsThe CXCR4 overexpressing HEK293T cells were produced with high expression (99.8%). The IC50 value of plerixafor determined by fluorescence tagged antibody-based competition assay using our developed cells agree with previously reported values using a radioligand binding assay. We observed no significant displacement of bound PE-anti-hCD184 by the test natural compounds which could be due to non-specific binding to other functional targets or organelles, low potency of the natural compounds, or binding to CXCR4 at deeper pockets. SignificanceThe verified non-radioactive binding assay can serve as an alternative screening tool for anticancer lead compounds targeting CXCR4 and an essential tool for proof of mechanism study in the drug discovery.

How the Analyzer can Help the User Help the Analyzer

The automation offered by modern program proof tools goes hand in hand with the capability to interact with the tool when the verification fails. The SPARK proof tool tries to help the user by providing the right information, so that the user can help the tool complete the proof. In this article, we present these mechanisms and how they work concretely on a simple running example.

Event-B Hybridation

Hybrid systems are complex systems where a software controller interacts with a physical environment, usually named a plant, through sensors and actuators. The specification and design of such systems usually rely on the description of both continuous and discrete behaviours. From complex embedded systems to autonomous vehicles, these systems became quite common, including in safety critical domains. However, their formal verification and validation as a whole is still a challenge. To address this challenge, this article contributes to the definition of a reusable and tool supported formal framework handling the design and verification of hybrid system models that integrate both discrete (the controller part) and continuous (the plant part) behaviours. This framework includes the development of a process for defining a class of basic theories and developing domain theories and then the use of these theories to develop a generic model and system-specific models. To realise this framework, we present a formal proof tool chain, based on the Event-B correct-by-construction method and its integrated development environment Rodin, to develop a set of theories, a generic model, proof processes, and the required properties for designing hybrid systems in Event-B. Our approach relies on hybrid automata as basic models for such systems. Discrete and continuous variables model system states and behaviours are given using discrete state changes and continuous evolution following a differential equation. The proposed approach is based on refinement and proof using the Event-B method and the Rodin toolset. Two case studies borrowed from the literature are used to illustrate our approach. An assessment of the proposed approach is provided for evaluating its extensibility, effectiveness, scalability, and usability.

Validation of radiographic quality of simulation software - ImaSim.

Virtual radiographic simulation has been found educationally effective for students to practice their clinical examinations remotely or online. A free available virtual simulator-ImaSim has received particular attention for radiographic science education because of its portability, free of charge and no constrain of location and physical facility. However, it lacks evidence to validate this virtual simulation software to faithfully reproduce radiographs comparable to that taken from a real X-ray machine to date. To evaluate image quality of the virtual radiographs produced by the ImaSim. Thus, the deployment of this radiographic simulation software for teaching and experimental studying of radiography can be justified. A real medical X-ray examination machine is employed to scan three standard QC phantoms to produce radiographs for comparing to the corresponding virtual radiographs generated by ImaSim software. The high and low range of radiographic contrast and comprehensive contrast-detail performance are considered to characterize the radiographic quality of the virtual simulation software. ImaSim software can generate radiographs with a contrast ranging from 30% to 0.8% and a spatial resolution as low as 0.6mm under the selected exposure setting condition. The characteristics of contrast and spatial resolution of virtual simulation generally agree with that of real medical X-ray examination machine. ImaSim software can be used to simulate a radiographic imaging process to generate radiographs with contrast and detail detectability comparable to those produced by a real X-ray imaging machine. Therefore, it can be adopted as a flexible educational tool for proof of concept and experimental design in radiography.

Code‐level model checking in the software development workflow at Amazon Web Services

AbstractThis article describes a style of applying symbolic model checking developed over the course of four years at Amazon Web Services (AWS). Lessons learned are drawn from proving properties of numerous C‐based systems, for example, custom hypervisors, encryption code, boot loaders, and an IoT operating system. Using our methodology, we find that we can prove the correctness of industrial low‐level C‐based systems with reasonable effort and predictability. Furthermore, AWS developers are increasingly writing their own formal specifications. As part of this effort, we have developed a CI system that allows integration of the proofs into standard development workflows and extended the proof tools to provide better feedback to users. All proofs discussed in this article are publicly available on GitHub.

The Judge’s Dedecision on the Cancellation of Notarial Deed as a Proof Tool in Padang State Court

The cancellation of the authentic deed that can be carried out by the judge, if the authentic deed does not meet the requirements stipulated by the law and the subjective or objective requirements are not fulfilled. This study analyzes the judge's decision on the cancellation of the notary deed as evidence in the Padang District Court which aims to find out how the Judge's consideration in making the decision to cancel the notary deed as evidence in the Padang District Court and the legal consequences for the deed being canceled through the Padang District Court decision. This study uses a juridical normative approach, which is a study that aims to examine legal principles, legal systematics, legal history and comparative law. According to the provisions of Law Number 2 of 2014 concerning the Position of Notary in Article 84, if there is a case that is brought before a judge in which the material of the lawsuit is regarding the notary's actions which have violated the provisions of that article, the judge must test the formal strength of proof against the authentic deed. The decision of the Padang District Court number 127 / Pdt.G / 2015 / PN.Pdg which declared the legal invalidation of Satria Tama's notary deed on July 19, 2012 deed number 272/2012 2012 because it was made on land that was in progress or was complaining in Court. So that the results of the research on the consideration of the judge's decision on the cancellation of a notary deed which is used as evidence in Court, are errors in the deed-making process that are not in accordance with the law, illegal acts committed by notaries and parties to the parties, errors in the contents of notary deeds, form of deeds notary public, and typographical errors in the copy of the notary deed. The legal consequences for notarial deeds that are canceled by court decisions are null and void, can be canceled, and the power of proof is degraded.

Enhancing Transaction Security for Handling Accountability in Electronic Health Records

Electronic healthcare systems have received extensive attention during the last decade due to the advancement of digital technology. Using these systems in the healthcare industry can improve the quality of healthcare services tremendously. However, a major issue that needs to be concerned, when utilizing this kind of system, is accountability. Employments of electronic health records, the core of the systems, without accountability can be a big risk to both patients and service personals and, consequently, to the entire society. Accountability in electronic health records is essential to creating trust among parties. Many researchers have been introduced to the accountability protocol. However, most of them still lack some essential security property that is mutual authentication. This leads to both information traceability and nonrepudiation which are necessary for resolving any conflict that may arise. In this paper, we propose accountability protocol for electronic health records; the protocol employs both asymmetric and symmetric encryptions to ensure that the electronic health records are having confidentiality, integrity, authentication, and authorization. The accountability analysis and performance analysis show that the proposed protocol is more capable and effective than others. The novel aspect of this idea lies in the inclusion of certain forms of security that are necessary to protect the patient’s electronic health records. To the best of our knowledge, the proposed protocol consumes less cost, energy, and time compared with the existing protocols. A proof of concept of our protocol is also presented in this paper by using BAN logic, an automated security protocol proof tool named Scyther, and AVISPA

A Bijective Proof of the ASM Theorem, Part I: The Operator Formula

Alternating sign matrices are known to be equinumerous with descending plane partitions, totally symmetric self-complementary plane partitions and alternating sign triangles, but no bijective proof for any of these equivalences has been found so far. In this paper we provide the first bijective proof of the operator formula for monotone triangles, which has been the main tool for several non-combinatorial proofs of such equivalences. In this proof, signed sets and sijections (signed bijections) play a fundamental role.

Unifying semantic foundations for automated verification tools in Isabelle/UTP

The growing complexity and diversity of models used in the engineering of dependable systems implies that a variety of formal methods, across differing abstractions, paradigms, and presentations, must be integrated. Such an integration relies on unified semantic foundations for the various notations, and co-ordination of a variety of automated verification tools. The contribution of this paper is Isabelle/UTP, an implementation of Hoare and He's Unifying Theories of Programming, a framework for unification of formal semantics. Isabelle/UTP permits the mechanisation of computational theories for diverse paradigms, and their use in constructing formalised semantic models. These can be further applied in the development of verification tools, harnessing Isabelle's proof automation facilities. Several layers of mathematical foundations are developed, including lenses to model variables and state spaces as algebraic objects, alphabetised predicates and relations to model programs, including algebraic and axiomatic semantics, proof tools for Hoare logic and refinement calculus, and UTP theories to encode computational paradigms.

The zero surface tension limit of three-dimensional interfacial Darcy flow

We study the zero surface tension limit of three-dimensional interfacial Darcy flow. We start with a proof of well-posedness of three-dimensional interfacial Darcy flow for any positive value of the surface tension coefficient. The primary tool for this well-posedness proof is an energy estimate. The time of existence for these solutions will, in general, go to zero with the surface tension parameter. However, in the case that a stability condition is satisfied by the initial data, we prove an additional energy estimate, establishing that the time of existence can be made uniform in the surface tension parameter. Then, an additional estimate allows the limit to be taken as surface tension vanishes, demonstrating that three-dimensional interfacial Darcy flow without surface tension is the limit of three-dimensional interfacial Darcy flow with surface tension as surface tension vanishes. This provides a new proof of existence of solutions for the problem without surface tension.

Quantum Random Oracle Model for Quantum Public-Key Encryption

Random oracle model is a general security analysis tool for rigorous security proof and effective cryptographic protocol design. In the quantum world, the attempts of constructing a quantum random oracle (QRO) have been made, such as quantum-accessible random oracle for post-quantum cryptography and quantum random oracle for quantum digital signature. As in the classical circumstance, it is crucial and challenging to design and instantiate the QRO model with an appropriate quantum hash function. In this work, we construct a QRO model for quantum public-key encryption against key-collision attack, due to the near-orthogonality property of the QRO. To explore a feasible instantiation procedure in the quantum setting, we distinctively give two instantiation examples of QRO by means of single-qubit rotation and quantum fingerprinting, and compare the numerical results of their performances under the key-collision attack. As a result, we extend the QRO model to the security analysis of quantum public-key encryption beyond quantum digital signature, and immunity from collision-type attacks.