the proceedings contain 5 papers. the special focus in this conference is on Reasoning Web. the topics include: Controlled Query Evaluation in Description logic Ontologies;actively Learning from Machine Lear...
ISBN:
(纸本)9783031802829
the proceedings contain 5 papers. the special focus in this conference is on Reasoning Web. the topics include: Controlled Query Evaluation in Description logic Ontologies;actively Learning from Machine Learning Models with Queries and Counterexamples.
Petri nets are a class of models of computation used to compactly represent discrete event systems. Among many application domains, they have now become the most prominent formalism to express process models in Proces...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
Petri nets are a class of models of computation used to compactly represent discrete event systems. Among many application domains, they have now become the most prominent formalism to express process models in Process Mining, thanks to their formal semantics that enables automated analysis techniques. In this context, model repair is the task of aligning a process model with actual executions of the process. Current solutions to model repair do not allow for embedding domain knowledge, providing guarantees of rigor, and enforcing structural requirements at the same time. In this paper, we fill this gap by proposing an approach based on the Inductive logicprogramming system ILASP. We then implement our approach and perform an experimental evaluation, showing both its expressiveness and feasibility.
In Japan, population decline and the depopulation of local regions have become social issues. Various municipalities are working to discover and promote the unique attractions of their regions. Identifying the local r...
详细信息
the proceedings contain 19 papers. the special focus in this conference is on integrated Formal Methods. the topics include: Implementing, Specifying, and Verifying the QOI Format in Dafny: A Case Study...
ISBN:
(纸本)9783031765537
the proceedings contain 19 papers. the special focus in this conference is on integrated Formal Methods. the topics include: Implementing, Specifying, and Verifying the QOI Format in Dafny: A Case Study;veriCode: Correct Translation of Abstract Specifications to C Code;proving Termination via Measure Transfer in Equivalence Checking;PLACIDUS: Engineering Product Lines of Rigorous Assurance Cases;stateful Functional Modeling with Refinement (a Lean4 Framework);modeling Register Pairs in CompCert;monitoring Extended Hypernode logic;towards Quantitative Analysis of Simulink Models Using Stochastic Hybrid Automata;monitoring Real-Time Systems Under Parametric Delay;veyMont: Choreography-Based Generation of Correct Concurrent Programs with Shared Memory;correct and Complete Symbolic Execution for Free;solvent: Liquidity Verification of Smart Contracts;StEVe: A Rational Verification Tool for Stackelberg Security Games;PyQBF: A Python Framework for Solving Quantified Boolean Formulas;Improving SAT Solver Performance through MLP-Predicted Genetic Algorithm Parameters;active Learning of Runtime Monitors Under Uncertainty;specify What? Enhancing Neural Specification Synthesis by Symbolic Methods.
Hypernode logic can reason about the prefix relation on stutter-reduced finite traces through the stutter-reduced prefix predicate. We increase the expressiveness of hypernode logic in two ways. First, we split the st...
详细信息
ISBN:
(纸本)9783031765537;9783031765544
Hypernode logic can reason about the prefix relation on stutter-reduced finite traces through the stutter-reduced prefix predicate. We increase the expressiveness of hypernode logic in two ways. First, we split the stutter-reduced prefix predicate into an explicit stutter-reduction operator and the classical prefix predicate on words. this change gives hypernode logicthe ability to combine synchronous and asynchronous reasoning by explicitly stating which parts of traces can stutter. Second, we allow the use of regular expressions in formulas to reason about the structure of traces. this change enables hypernode logic to describe a mixture of trace properties and hyperproperties. We show how to translate extended hypernode logic formulas into multi-track automata, which are automata that read multiple input words. then we describe a fully online monitoring algorithm for monitoring k-safety hyperproperties specified in the logic. We have implemented the monitoring algorithm, and evaluated it on monitoring synchronous and asynchronous versions of observational determinism, and on checking the privacy preservation by compiler optimizations.
In this paper, we propose a new approach of combining formal methods and malware analysis for quickly determining if an application has specific malicious capabilities. the proposed solution is a Formal Tainting-Based...
详细信息
ISBN:
(纸本)9783031765537;9783031765544
In this paper, we propose a new approach of combining formal methods and malware analysis for quickly determining if an application has specific malicious capabilities. the proposed solution is a Formal Tainting-Based Framework that uses a combination of binary instrumentation, taint analysis, and temporal logic in order to selectively extract behavioral properties of a malware. these are then formalized in order to check if the application expresses certain capabilities. the findings are accompanied by a concrete implementation, which proved effective and efficient against real-life malware, as highlighted by an evaluation. Furthermore, the framework has been used in actual cyber forensics investigations, reducing the time and efforts of security researchers.
the semantics of logics is based on valuations that map variables to values, while programming languages cannot store complex values atomically. they have a pointer semantics where complex data is stored on the heap, ...
详细信息
ISBN:
(纸本)9783031765537;9783031765544
the semantics of logics is based on valuations that map variables to values, while programming languages cannot store complex values atomically. they have a pointer semantics where complex data is stored on the heap, linked with pointers. the standard approach to bridge the semantic gap between algebraic specifications and executable programs is to translate algebraic data types, recursive definitions and programs to functional code with immutable data types. Since functional programs are often less efficient than C programs due to the lack (or limited use) of mutation and the requirement of using garbage collection, we develop a different approach in this paper that is based on always mutating data structures but keeping different ones disjoint. the approach generates efficient C programs from the specifications, which have a pointer semantics and explicitly allocate and free memory on the heap. Formal specifications are given for the semantics of a core source and target language that allow to demonstrate the main transformations necessary and prove their correctness. the approach has been implemented for the full language and produces working C code.
Malware for IoT devices has become popular in recent years. Many detection methods have been proposed to detect the malware, mainly using machine learning, but they are not designed to work on IoT devices and are ofte...
详细信息
We present STEVE, a prototype tool modelling Stackelberg Security Games (SSGs) and employing rational verification based on bespoke Stackelberg equilibrium computation. STEVE automatically extracts technical details f...
详细信息
ISBN:
(纸本)9783031765537;9783031765544
We present STEVE, a prototype tool modelling Stackelberg Security Games (SSGs) and employing rational verification based on bespoke Stackelberg equilibrium computation. STEVE automatically extracts technical details from public vulnerability databases, transforming these into Attack Defence Trees and then into SSG models. By using the temporal logic rPATL, the tool enables the synthesis of optimal defence strategies through Stackelberg equilibrium analysis, which is implemented as a PRISM-games extension. Preliminary results demonstrate STEVE's ability to model and counteract cyber threats, reducing potential damages and financial losses.
Verifying the plan before executing it on the robot is an important task because a wrong plan can lead to fatal consequences and damage. In this paper, we propose an approach for verifying a plan before executing it o...
详细信息
ISBN:
(纸本)9783031741852;9783031741869
Verifying the plan before executing it on the robot is an important task because a wrong plan can lead to fatal consequences and damage. In this paper, we propose an approach for verifying a plan before executing it on a robot, which combines the use of a formal language and the use of LLM. We first translate the initial instruction, which may not contain all the necessary actions of the plan, into an LTL formula. And then, based on this formula, we complement the plan with a query to the LLM about the possibility of transitioning from one state to another is carried out. We demonstrate the proposed approach on two datasets, a specialized one dedicated to the task of cooking and a general one dedicated to household chores.
暂无评论