the proceedings contain 19 papers. the special focus in this conference is on Model Checking Software. the topics include: An extension of TRIANGLE testbed with model-based testing;local data race freedom with non-mul...
ISBN:
(纸本)9783319941103
the proceedings contain 19 papers. the special focus in this conference is on Model Checking Software. the topics include: An extension of TRIANGLE testbed with model-based testing;local data race freedom with non-multi-copy atomicity;a comparative study of decision diagrams for real-time model checking;lazy reachability checking for timed automata with discrete variables;From SysML to model checkers via model transformation;genetic synthesis of concurrent code using model checking and statistical model checking;quantitative model checking for a controller design;modelling without a modelling language;context-updates analysis and refinement in chisel;efficient runtime verification of first-order temporal properties;program verification with separation logic;petri net reductions for counting markings;Improving generalization in software IC3;Star-topology decoupling in SPIN;joint forces for memory safety checking;Model-checking hyperLTL for pushdown systems;a branching time variant of CaRet.
the advantages of tabled evaluation regarding program termination and reduction of complexity are well known -as are the significant implementation, portability, and maintenance efforts that some proposals (especially...
详细信息
Source-code based test data generation is a process of finding program input on which a selected element, e.g., a target statement, is executed. there exist many test generation methods that automatically find a solut...
详细信息
Source-code based test data generation is a process of finding program input on which a selected element, e.g., a target statement, is executed. there exist many test generation methods that automatically find a solution to the test generation problem. the existing methods work well for many programs. However, they may fail or are inefficient for programs with complex logic and intricate relationships between program elements. In this paper we present a testability transformationthat transforms programs so that the chances of finding a solution are increased when the existing methods fail using only the original program. In our approach data dependence analysis is used to identify statements in the programthat affect computation of the fitness function associated withthe target statement. the transformed program contains only these statements, and it is used to explore different ways the fitness may be computed. these explorations are inexpensive when using the transformed program as compared to explorations using the original program. As a result, executions in the transformed programthat lead to the evaluation of the fitness function to the target value are identified. the identified executions are then used to guide the search in the original program to find an input on which the target statement is executed. In this paper, the approach is evaluated using a case study which demonstrates the potential for this testability transformation to improve the efficacy of the test generation
Many transformation systems for program optimization, programsynthesis, and program specialization are based on fold/unfold transformations. In this paper, we investigate the semantic properties of a narrowing-based ...
详细信息
Many transformation systems for program optimization, programsynthesis, and program specialization are based on fold/unfold transformations. In this paper, we investigate the semantic properties of a narrowing-based unfolding transformationthat is useful to transform rewriting logictheories. We also present a transformation methodology that is able to determine whether an unfolding transformation step would cause incompleteness and avoid this problem by completing the transformed rewrite theory with suitable extra rules. More precisely, our methodology identifies the sources of incompleteness and derives a set of rules that are added to the transformed rewrite theory in order to preserve the semantics of the original theory.
Scientists and engineers face recurring problems of constructing, testing and modifying numerical simulation programs. the process of coding and revising such simulators is extremely time-consuming, because they are a...
ISBN:
(纸本)3540678395
Scientists and engineers face recurring problems of constructing, testing and modifying numerical simulation programs. the process of coding and revising such simulators is extremely time-consuming, because they are almost always written in conventional programming languages. Scientists and engineers can therefore benefit from software that facilitates construction of programs for simulating physical systems. Our research adapts the methodology of deductive programsynthesis to the problem of constructing numerical simulation codes. We have focused on simulators that can be represented as second order functional programs composed of numerical integration and root extraction routines. We have developed a system that uses first order Horn logic to synthesize numerical simulators built from these components. Our approach is based on two ideas: First, we axiomatize only the relationship between integration and differentiation. We neither attempt nor require a complete axiomatization of mathematical analysis. Second, our system uses a representation in which functions are reified as objects. Function objects are encoded as lambda expressions. Our knowledge base includes an axiomatization of term equality in the lambda calculus. It also includes axioms defining the semantics of numerical integration and root extraction routines. We use depth bounded SLD resolution to construct proofs and synthesize programs. Our system has successfully constructed numerical simulators for computational design of jet engine nozzles and sailing yachts, among others. Our results demonstrate that deductive synthesis techniques can be used to construct numerical simulation programs for realistic applications [EM98].
the proceedings contain 43 papers. the special focus in this conference is on Formal Methods. the topics include: Automated circular assume-guarantee reasoning;narrowing operators on template abstract domains;detectio...
ISBN:
(纸本)9783319192482
the proceedings contain 43 papers. the special focus in this conference is on Formal Methods. the topics include: Automated circular assume-guarantee reasoning;narrowing operators on template abstract domains;detection of design flaws in the android permission protocol through bounded verification;reasoning about privacy properties of biometric system architectures;a specification language for static and runtime verification of data and control properties;certificates for parameterized model checking;safety, liveness and run-time refinement for modular process-aware information systems with dynamic sub processes;a framework for correctness criteria on weak memory models;semantics-preserving simplification of real-world firewall rule sets;parameter synthesisthrough temporal logic specifications;trace-length independent runtime monitoring of quantitative policies in LTL;a model checker for quantum programs and protocols;property-driven fence insertion using reorder bounded model checking;proving safety with trace automata and bounded model checking;verifying parameterized timed security protocols;abstraction of elementary hybrid systems by variable transformation;using real-time Maude to model check energy consumption behavior;static differential program analysis for software-defined networks;the semantics of cardinality-based feature models via formal languages;model-based problem solving for university timetable validation and improvement;direct formal verification of liveness properties in continuous and hybrid dynamical systems;static optimal scheduling for synchronous data flow graphs with model checking;eliminating static analysis false positives using loop abstraction and bounded model checking;formal virtual modelling and data verification for supervision systems and formalizing the concept phase of product development.
the size and complexity of current custom VLSI have forced the use of high-level programming languages to describe hardware, and compiler and synthesis technology to map abstract designs into silicon. Since streaming ...
详细信息
the size and complexity of current custom VLSI have forced the use of high-level programming languages to describe hardware, and compiler and synthesis technology to map abstract designs into silicon. Since streaming data processing in DSP applications is typically described by loop constructs in a high-level language, loops are the most critical portions of the hardware description and special techniques are developed to optimally synthesize them. We introduce a new method for mapping and pipelining nested loops efficiently into hardware. It achieves fine-grain parallelism even on strong intra- and inter-iteration data-dependent inner loops and, by sharing resources economically, improves performance at the expense of a small amount of additional area. We implemented the transformation within the Nimble Compiler environment and evaluated its performance on several signal processing benchmarks. the method achieves up to 2× improvement in the area efficiency compared to the best known optimization techniques.
暂无评论