the breakneck evolution of modern programming languages aggravates the development of deductive verification tools, which struggle to timely and fully support all new language features. To address this challenge, we p...
详细信息
ISBN:
(纸本)9783031274800;9783031274817
the breakneck evolution of modern programming languages aggravates the development of deductive verification tools, which struggle to timely and fully support all new language features. To address this challenge, we present BYTEBACK: a verification technique that works on Java bytecode. Compared to high-level languages, intermediate representations such as bytecode offer a much more limited and stable set of features;hence, they may help decouple the verification process from changes in the source-level language. BYTEBACK offers a library to specify functional correctness properties at the level of the source code, so that the bytecode is only used as an intermediate representation that the end user does not need to work with. then, BYTEBACK reconstructs some of the information about types and expressions that is erased during compilation into bytecode but is necessary to correctly perform verification. Our experiments with an implementation of BYTEBACK demonstrate that it can successfully verify bytecode compiled from different versions of Java, and including several modern language features that even state-of-the-art Java verifiers (such as KeY and OpenJML) do not directly support-thus revealing how BYTEBACK's approach can help keep up verification technology with language evolution.
Max-margin-based early event detection is first solved by max-margin early event detector (MMED) proposed by Hoai and Torre [10]. In this study, the stochastic gradient descent mechanism is used to replace the quadrat...
详细信息
Learning computer programming is difficult and complex for most of novices. the block-based visualized programming environments can reduce the learning dilemma in programming syntax and invoke the learners’ motivatio...
详细信息
the proceedings contain 59 papers. the special focus in this conference is on New trends in Computer Technologies and Applications. the topics include: Prediction of Middle-Aged Unhealthy Facial Skin Using VGG19 ...
ISBN:
(纸本)9789811995811
the proceedings contain 59 papers. the special focus in this conference is on New trends in Computer Technologies and Applications. the topics include: Prediction of Middle-Aged Unhealthy Facial Skin Using VGG19 and Support Vector Machine Models;real-Time Intentional Eye Blink Detection Using Rhombus Identification;difficulty-Aware Mixup for Replay-based Continual Learning;vision-Based Lightweight Facial Respiration and Heart Rate Measurement Technology;GAN-Based Criminal Suspect Face Generator;priority Algorithms with Advice for Disjoint Path Allocation Problems (Extended Abstract);automatic Summarization of Critical threat Intelligence Using Transfer Learning;anti-screenshot Watermarking Algorithm About Archives Image Based on Deep Learning Model;detecting Android Malware by Combining System Call Sequence Relationships with Local Feature Calculation;a Detector Using Variant Stacked Denoising Autoencoders with Logistic Regression for Malicious JavaScript with Obfuscations;a Lightweight and Robust Authentication and Key Agreements with Physically Unclonable Function in Manufacturing Environments;image Compression and Meaningful Ciphertext Encryption Based on Histogram Shift Embedding;a Robust Two Factor Authentication Scheme with Fine Grained Biometrics Verification;applying an IoT Analytics Framework in East Asia Area;Android Malware Classifier Combining Permissions and API Features to Face Model Drifting;design and Implementation of the Optimized Computing Architecture for Matrix Decomposition Algorithms;on Two Variants of Induced Matchings;Design and Implementation of the CNN Accelator Based on Multi-streaming SIMD Mechanisms;Design and Implementation of the Link-List DMA Controller for High Bandwidth Data Streaming;STEM Education Meets HPC;Research on KNN-Based GNSS Coordinate Classification for Epidemic Management;An Improved Light Weight Countermeasure Scheme to Efficiently Mitigate TCP Attacks in SDN;the Effectiveness of Block-Based programming Learning on th
the proceedings contain 22 papers. the special focus in this conference is on Semantics of Logic Languages and Efficient Compilation of functional Logic Programs. the topics include: Proof checking and logic programmi...
ISBN:
(纸本)9783319274355
the proceedings contain 22 papers. the special focus in this conference is on Semantics of Logic Languages and Efficient Compilation of functional Logic Programs. the topics include: Proof checking and logic programming;on dual programs in co-logic programming;equational formulas and pattern operations in initial order-sorted algebras;compiling collapsing rules in certain constructor systems;from boolean equalities to constraints;a type-theoretic approach to resolution;a typed language for events;applying sorting networks to synthesize optimized sorting libraries;impact of accuracy optimization on the convergence of numerical iterative methods;abstract analysis of universal properties for TCCP;a global occurrence counting analysis for brane calculi;using dynamic pushdown networks to automate a modular information-flow analysis;checking java assertions using automated test-case generation;a generic intermediate representation for verification condition generation;combining top-down and bottom-up techniques in program derivation;a generalized model for algorithmic debugging;concolic execution in functionalprogramming by program instrumentation;memory policy analysis for semantics specifications in maude;correctness of context-moving transformations for term rewriting systems and CHR in action.
Although functional as well as logic languages use equality to discriminate between logically different cases, the operational meaning of equality is different in such languages. functional languages reduce equational...
详细信息
ISBN:
(纸本)9783319274362;9783319274355
Although functional as well as logic languages use equality to discriminate between logically different cases, the operational meaning of equality is different in such languages. functional languages reduce equational expressions to their Boolean values, True or False, logic languages use unification to check the validity only and fail otherwise. Consequently, the language Curry, which amalgamates functional and logic programming features, offers two kinds of equational expressions so that the programmer has to distinguish between these uses. We show that this distinction can be avoided by providing an analysis and transformation method that automatically selects the appropriate operation. Without this distinction in source programs, the language design can be simplified and the execution of programs can be optimized. As a consequence, we show that one kind of equational expressions is sufficient and unification is nothing else than an optimization of Boolean equality.
Concolic execution, a combination of concrete and symbolic execution, has become increasingly popular in recent approaches to model checking and test case generation. In general, an interpreter of the language is augm...
详细信息
ISBN:
(纸本)9783319274362;9783319274355
Concolic execution, a combination of concrete and symbolic execution, has become increasingly popular in recent approaches to model checking and test case generation. In general, an interpreter of the language is augmented in order to also deal with symbolic values. In this paper, in contrast, we present an alternative approach that is based on a program instrumentation. Basically, the execution of the instrumented program in a standard environment produces a sequence of events that can be used to reconstruct the associated symbolic execution.
In a world where trusting software systems is increasingly important, formal methods and formal proof can help provide trustable foundations. Proof checking can help to reduce the size of the trusted base since we do ...
详细信息
ISBN:
(纸本)9783319274362;9783319274355
In a world where trusting software systems is increasingly important, formal methods and formal proof can help provide trustable foundations. Proof checking can help to reduce the size of the trusted base since we do not need to trust an entire theorem prover if we can check the proofs they produce by a trusted (and smaller) checker. Many approaches to building proof checkers require embedding within them a full programming language. In most many modern proof checkers and theorem provers, that programming language is a functionalprogramming language, often a variant of ML. In fact, parts of ML (e.g., strong typing, abstract datatypes, and higher-order programming) were designed to make ML into a trustworthy "meta-language" for checking proofs. While there is considerable overlap in the foundations of logic programming and proof checking (both benefit from unification, backtracking search, efficient term structures, etc.), the discipline of logic programming has, in fact, played a minor role in the history of proof checking. I will argue that logic programming can have a major role in the future of this important topic.
the paper describes the 101haskell chrestomathy-a collection of Haskell programs implementing features of a hypothetical information system in a manner to represent knowledge about functionalprogramming useful for le...
详细信息
In previous work, we proposed a new approach to the problem of implementing compilers in a modular manner, by combining earlier work on the development of modular interpreters using monad transformers withthe à ...
详细信息
暂无评论