The proceedings contain 33 papers. The topics discussed include: let's get physical: models and methods for real-world security protocols;VCC: a practical system for verifying concurrent C;a brief overview of Agda...
ISBN:
(纸本)364203358X
The proceedings contain 33 papers. The topics discussed include: let's get physical: models and methods for real-world security protocols;VCC: a practical system for verifying concurrent C;a brief overview of Agda a functional language with dependent types;some domain theory and denotational semantics in coq;turning inductive into equational specifications;formalizing observer theory for environment-sensitive bisimulation;formal certification of a resource-aware language implementation;acyclic preferences and existence of sequential Nash equilibria: a formal and constructive equivalence;trace-based coinductive operational semantics for while: big-step and small-step, relational and functional styles;formal verification of exact computations using Newton's method;a hoare logic for the state monad: proof pearl;and a formalization of smallfoot in HOL.
Keyword programming is a novel technique for reducing the need to remember details of programming language syntax and APIs, by translating a small number of unordered keywords provided by the user into a valid express...
详细信息
Keyword programming is a novel technique for reducing the need to remember details of programming language syntax and APIs, by translating a small number of unordered keywords provided by the user into a valid expression. In a sense, the keywords act as a query that searches the space of expressions that are valid in the given context. Prior work has demonstrated the feasibility and merit of this approach in limited domains. This paper explores the potential for employing this technique in much larger domains, specifically general-purpose programming languages like Java. We present an algorithm for translating keywords into Java method call expressions. When tested on keywords extracted from existing method calls in Java code, the algorithm can accurately reconstruct over 90% of the original expressions. We tested the algorithm on keywords provided by users in a web-based study. The results suggest that users can obtain correct Java code using keyword queries as accurately as they can write the correct Java code themselves. We implemented the algorithm in an Eclipse plug-in as an extension to the autocomplete mechanism and deployed it in a preliminary field study of several users, with mixed results. One interesting result of this work is that most of the information in Java method call expressions lies in the keywords, and details of punctuation and even parameter ordering can often be inferred automatically.
This paper presents the formal Isabelle/HOL framework we use to prove refinement between an executable, monadic specification and the C implementation of the seL4 microkernel. We describe the refinement framework itse...
详细信息
ISBN:
(纸本)9783642033582
This paper presents the formal Isabelle/HOL framework we use to prove refinement between an executable, monadic specification and the C implementation of the seL4 microkernel. We describe the refinement framework itself;the automated tactics it supports, and the connection to our previous C verification framework. We also report on our experience in applying the framework to seL4. The characteristics of this microkernel verification are the size of the target (8,700 lines of C code), the treatment of low-level programming constructs, the focus on high performance, and the large subset of the C programming language addressed;which includes pointer arithmetic and type-unsafe code.
We propose a simple and generic method for computing Dung's standard argumentation semantics along with semi-stable semantics in Answer Set programming (ASP). The different semantics captured by argumentation fram...
详细信息
ISBN:
(纸本)9783642006081
We propose a simple and generic method for computing Dung's standard argumentation semantics along with semi-stable semantics in Answer Set programming (ASP). The different semantics captured by argumentation frameworks are all uniformly represented in our ASP setting. It is based on Caminada's reinstatement labellings for argumentation frameworks as well as our method of computing circumscription in ASP. In our approach, a given argumentation framework is translated into a single normal logic program w.r.t. the chosen semantics whose answer set (if exists) yields an argument-based extension expressed by means of a reinstatement labelling for the semantics. We show soundness and completeness theorems for our translation, which allow us not only to compute argument-based extensions but also to decide whether an argument is sceptically or credulously accepted w.r.t. the chosen semantics. Based on our theorems, the prototype argumentation system was implemented using the ASP solver, DLV, whose evaluation results verified correctness of our approach.
The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well established infrastructure supporting research, development, and deployment of first-order Automated Theorem Proving (ATP) sy...
详细信息
ISBN:
(纸本)9783642029585
The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well established infrastructure supporting research, development, and deployment of first-order Automated Theorem Proving (ATP) systems. Recently, the TPTP has been extended to include problems in higher-order logic, with corresponding infrastructure and resources. This paper describes the practical progress that has been made towards the goal of TPTP support for higher-order ATP systems.
HOL Light is an interactive proof assistant for classical higher-order logic, intended as a clean and simplified version of Mike Gordon's original HOL system. Theorem provers in this family use a version of ML as ...
详细信息
ISBN:
(纸本)9783642033582
HOL Light is an interactive proof assistant for classical higher-order logic, intended as a clean and simplified version of Mike Gordon's original HOL system. Theorem provers in this family use a version of ML as both the implementation and interaction language;in HOL Light's case this is Objective CAML (OCaml). Thanks to its adherence to the so-called 'LCF approach';the system can be extended with new inference rules without compromising soundness. While retaining this reliability and programmability from earlier HOL systems;HOL Light is distinguished by its clean and simple design and extremely small logical kernel. Despite this, it provides powerful proof tools and has been applied to some non-trivial tasks in the formalization of mathematics and industrial formal verification.
Steel making is known as a complex manufacturing industrial process. Automation of the process represents a challenge. Empirical mathematical modeling of the process was used to design mill equipment, ensure productiv...
详细信息
ISBN:
(纸本)9781615676668
Steel making is known as a complex manufacturing industrial process. Automation of the process represents a challenge. Empirical mathematical modeling of the process was used to design mill equipment, ensure productivity and service quality. This modeling approach shows many problems associated to complexity and time consumption. Soft computing techniques show significant modeling capabilities on handling complex nonlinear systems modeling. In this paper, we explore the use of Takagi-Sugeno (TS) technique to develop fuzzy models for the Hot-Rolling industrial nonlinear process. We propose three models for the rolling force, torque and slab temperature. A set of rules and membership functions which represents the dynamical relationship between the input and output of these models shall be presented. The performance of the fuzzy models will be compared to the known empirical models for the hot rolling system. Experimental data measured from the Ere˜gli Iron and Steel Factory in Turkey shall be used for the verification of the model outstanding performance.
Keyword programming is a novel technique for reducing the need to remember details of programming language syntax and APIs, by translating a small number of unordered keywords provided by the user into a valid express...
详细信息
ISBN:
(纸本)9781595938824
Keyword programming is a novel technique for reducing the need to remember details of programming language syntax and APIs, by translating a small number of unordered keywords provided by the user into a valid expression. In a sense, the keywords act as a query that searches the space of expressions that are valid in the given context. Prior work has demonstrated the feasibility and merit of this approach in limited domains. This paper explores the potential for employing this technique in much larger domains, specifically general-purpose programming languages like Java. We present an algorithm for translating keywords into Java method call expressions. When tested on keywords extracted from existing method calls in Java code, the algorithm can accurately reconstruct over 90% of the original expressions. We tested the algorithm on keywords provided by users in a web-based study. The results suggest that users can obtain correct Java code using keyword queries as accurately as they can write the correct Java code themselves. We implemented the algorithm in an Eclipse plug-in as an extension to the autocomplete mechanism and deployed it in a preliminary field study of several users, with mixed results. One interesting result of this work is that most of the information in Java method call expressions lies in the keywords, and details of punctuation and even parameter ordering can often be inferred automatically.
Various logic design styles have been proposed to counteract DPA (Differential Power Analysis) attacks for secure cryptographic IC design. However, only a couple of papers addressed the automatic synthesis and optimiz...
详细信息
Various logic design styles have been proposed to counteract DPA (Differential Power Analysis) attacks for secure cryptographic IC design. However, only a couple of papers addressed the automatic synthesis and optimization for these secure logic circuits. This paper attempts to identify common optimization issues in typical masking-based countermeasures. They include (1) constrained Reed-Muller (RM) logic minimization, (2) minimum decomposition of multi-input And gates and (3) minimum number of mask bits used to randomize power consumption. An OFDD-based heuristic method is proposed to minimize the RM logic with emphasis on literal number. The latter two optimization problems are formulated as zero-one integer linear programming and graph coloring problems respectively. Based on these formulations and optimizations, an automated design flow for secure cryptographic IC design was implemented in C language.
暂无评论