the proceedings contain 25 papers. the special focus in this conference is on programming. the topics include: Procedures and concurrency: A study in proof;another characterization of weakest preconditions;powerdomain...
ISBN:
(纸本)9783540114949
the proceedings contain 25 papers. the special focus in this conference is on programming. the topics include: Procedures and concurrency: A study in proof;another characterization of weakest preconditions;powerdomains and nondeterministic recursive definitions;optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line code;the simple semantics for Coppo-Dezani-Sallé types;proving the correctness of implementations of shared data abstractions;specification of communicating processes and process implementation correctness;a system for reasoning within and about algebraic specifications;tuning algebraic specifications by type merging;a machine-level semantics for nondeterministic, parallel programs;communicating agents for applicative concurrent programming;on effective computations of non-deterministic schemes;Specification and verification of concurrent systems in CESAR;proof of separability A verification technique for a class of security kernels;a method for programsynthesis;the use of transformations to implement an algorithm;a formalized proof system for total correctness of while programs;automatic programtransformation viewed as theorem proving;an enlarged definition and complete axiomatization of observational congruence of finite processes;perluette : A compilers producing system using abstract data types;a weakest precondition semantics for communicating processes;from abstract model to efficient compilation of patterns;computer-basedsynthesis of logicprograms.
In this paper, we study termination properties of input-consuming derivations of moded logicprograms. Input-consuming derivations can be used to model the behavior of logicprograms using dynamic scheduling and emplo...
详细信息
the proceedings contain 19 papers. the topics discussed include: planning with global state constraints for urban traffic control;BLACK: a fast, flexible and reliable LTL satisfiability checker;automated planning thro...
the proceedings contain 19 papers. the topics discussed include: planning with global state constraints for urban traffic control;BLACK: a fast, flexible and reliable LTL satisfiability checker;automated planning through program verification;rule-based shield synthesis for partially observable Monte Carlo planning;dynamic attack trees;mining temporal networks: results and open problems;multi-frame modal symbolic learning;automated reasoning for reinforcement learning agents in structured environments;using directional arc consistency with asynchronous forward-bounding algorithm;and statistical model checking for the analysis of mission- and safety-critical cyber-physical system.
the proceedings contain 19 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: From Starvation Freedom to All-Path Reachability Problems in Cons...
ISBN:
(纸本)9783031248405
the proceedings contain 19 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: From Starvation Freedom to All-Path Reachability Problems in Constrained Rewriting;switchLog: A logicprogramming Language for Network Switches;linear Algebraic Abduction with Partial Evaluation;Using Hybrid Knowledge Bases for Meta-reasoning over OWL 2 QL;solving Vehicle Equipment Specification Problems with Answer Set programming;UAV Compliance Checking Using Answer Set programming and Minimal Explanations Towards Compliance (Application Paper);jury-Trial Story Construction and Analysis Using Goal-Directed Answer Set programming;pruning Redundancy in Answer Set Optimization Applied to Preventive Maintenance Scheduling;automatic Rollback Suggestions for Incremental Datalog Evaluation;programsynthesis Using Example Propagation;embedding Functional logicprogramming in Haskell via a Compiler Plugin;execution Time program Verification with Tight Bounds;fluo: A Domain-Specific Language for Experiments in Fluorescence Microscopy (Application Paper);flexible Job-shop Scheduling for Semiconductor Manufacturing with Hybrid Answer Set programming (Application Paper);Integrating ASP-based Incremental Reasoning in the Videogame Development Workflow (Application Paper);dynamic Slicing of Reaction Systems based on Assertions and Monitors;multiple Query Satisfiability of Constrained Horn Clauses.
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.
Despite numerous fonts already being designed and easily available online, the desire for new fonts seems to be endless. Previous methods focused on extracting style, shape, and stroke information from a large set of ...
详细信息
暂无评论