the proceedings contain 26 papers. the topics discussed include: Brzozowski's and up-to algorithms for must testing;practical alternating parity tree automata model checking of higher-order recursion schemes;model...
ISBN:
(纸本)9783319035413
the proceedings contain 26 papers. the topics discussed include: Brzozowski's and up-to algorithms for must testing;practical alternating parity tree automata model checking of higher-order recursion schemes;model checking dynamic pushdown networks;robustness analysis of finite precision implementations;the undefined domain: precise relational information for entities that do not exist;separation logic modulo theories;bi-abduction with pure properties for specification inference;laws of programming for references;dynamic alias protection with aliasing contracts;fine-grained function visibility for multiple dispatch with multiple inheritance;internal deployment of the parfait static code analysis tool at oracle;secure compilation of object-oriented components to protected module architectures;and generalized quantitative analysis of metric transition systems.
this book constitutes the refereed proceedings of the 11th asian symposium on programming languages and systems, aplas 2013, held in Melbourne, Australia, in December 2013. the 20 regular papers presented together wit...
详细信息
ISBN:
(数字)9783319035420
ISBN:
(纸本)9783319035413
this book constitutes the refereed proceedings of the 11th asian symposium on programming languages and systems, aplas 2013, held in Melbourne, Australia, in December 2013. the 20 regular papers presented together withthe abstracts of 3 invited talks were carefully reviewed and selected from 57 submissions. the papers cover a variety of foundational and practical issues in programminglanguages and systems.
We propose thisJava, an extension of Java-like programminglanguages with exact class types and this types, to support more useful methods with more precise types. To realize the proposed approach, we provide an open-...
详细信息
Conventional security policies for software applications are adequate for managing concerns on the level of access control. But standard abstraction mechanisms of mainstream programminglanguages are not sufficient to...
详细信息
We propose a set of algebraic laws for reasoning with sequential imperative programs that use object references like in Java. the theory is based on previous work by adding laws to cope with object references. the inc...
详细信息
the elegant theory of the call-by-value lambda-calculus relies on weak evaluation and closed terms, that are natural hypotheses in the study of programminglanguages. To model proof assistants, however, strong evaluat...
详细信息
ISBN:
(纸本)9783319479576;9783319479583
the elegant theory of the call-by-value lambda-calculus relies on weak evaluation and closed terms, that are natural hypotheses in the study of programminglanguages. To model proof assistants, however, strong evaluation and open terms are required, and it is well known that the operational semantics of call-by-value becomes problematic in this case. Here we study the intermediate setting-that we call Open Call-by-Value-of weak evaluation with open terms, on top of which Gregoire and Leroy designed the abstract machine of Coq. Various calculi for Open Call-by-Value already exist, each one with its pros and cons. this paper presents a detailed comparative study of the operational semantics of four of them, coming from different areas such as the study of abstract machines, denotational semantics, linear logic proof nets, and sequent calculus. We show that these calculi are all equivalent from a termination point of view, justifying the slogan Open Call-by-Value.
the vast amount of code available on the web is increasing on a daily basis. Open-source hosting sites such as Github contain billions of lines of code. Community question-answering sites provide millions of code snip...
详细信息
ISBN:
(纸本)9783319265292;9783319265285
the vast amount of code available on the web is increasing on a daily basis. Open-source hosting sites such as Github contain billions of lines of code. Community question-answering sites provide millions of code snippets with corresponding text and metadata. the amount of code available in executable binaries is even greater. In this talk, I will cover recent research trends on leveraging such "big code" for program analysis, program synthesis and reverse engineering. We will consider a range of semantic representations based on symbolic automata [11,15], tracelets [3], numerical abstractions [13,14], and textual descriptions [1,22], as well as different notions of code similarity based on these representations. To leverage these semantic representations, we will consider a number of prediction techniques, including statistical language models [19,20], variable order Markov models [2], and other distance-based and model-based sequence classification techniques. Finally, I will show applications of these techniques including semantic code search in both source code and stripped binaries, code completion and reverse engineering.
Program calculation, a programming technique to derive efficient programs from naive ones by program transformation, is challenging for program optimization. Tesson et al. have shown that Coq, a popular proof assistan...
详细信息
ISBN:
(纸本)9783030341756;9783030341749
Program calculation, a programming technique to derive efficient programs from naive ones by program transformation, is challenging for program optimization. Tesson et al. have shown that Coq, a popular proof assistant, provides a cost-effective way to implement a powerful system for verifying correctness of program transformations, but their applications are limited to list functions in the theory of Lists. In this paper, we propose an easy-to-use Coq library to prove more advanced calculation rules in Coq for various recursion schemes, which capture recursive programs on an arbitrary algebraic datatype. We prove all the lemmas and theorems about recursion schemes in Coq including histomorphisms and futumorphisms proposed by Uustalu et al. Our library can be used to obtain certified runnable programs from their definitions written with recursion schemes in Coq scripts. We demonstrate a certified runnable program for the Fibonacci numbers and unbounded knapsack problem from their histomorphic definitions.
作者:
Zainzinger, HJAustria, SASiemens AG
Program & Syst Engn Enterprise Commun Technol Dept Embedded Software & IP Based Applicat A-1194 Vienna Austria
In this article we present a generic test equipment for embedded platform software. Our approach helps to overcome the paradigms of modern software development like object-oriented concepts, rapid prototyping and comm...
详细信息
ISBN:
(纸本)0769518257
In this article we present a generic test equipment for embedded platform software. Our approach helps to overcome the paradigms of modern software development like object-oriented concepts, rapid prototyping and communication-support over a big number of different protocols. As we support different platforms, we describe the most relevant differences between compilers, processors and operating systems. Since testers of embedded systems are usually familiar with C and C++, the test equipment is based on CINT, a C++ interpreter. the last section of this paper investigates the advantages and drawbacks of CINT.
A fully abstract compilation scheme prevents the security features of the high-level language from being bypassed by an attacker operating at a particular lower level. this paper presents a fully abstract compilation ...
详细信息
暂无评论