English
Related papers

Related papers: Bounded Invariant Checking for Stateflow Programs

200 papers

Probabilistic model checking for systems with large or unbounded state space is a challenging computational problem in formal modelling and its applications. Numerical algorithms require an explicit representation of the state space, while…

Logic in Computer Science · Computer Science 2018-06-12 Dimitrios Milios , Guido Sanguinetti , David Schnoerr

Structural Health Monitoring (SHM) is a critical task for ensuring the safety and reliability of civil infrastructures, typically realized on bridges and viaducts by means of vibration monitoring. In this paper, we propose for the first…

This paper presents the deductive formal verification of high-level properties of control systems with theorem proving, using the Why3 tool. Properties that can be verified with this approach include stability, feedback gain, and…

Systems and Control · Computer Science 2014-10-22 Dejanira Araiza-Illan , Kerstin Eder , Arthur Richards

As AI systems move into high stakes domains such as legal reasoning, medical diagnosis, and financial decision making, regulators and practitioners increasingly demand auditability. Auditability means the ability to trace exactly what each…

Artificial Intelligence · Computer Science 2026-01-05 Xin Guan , Yunshan Li , Zekun Wu , Ruibo Zhang

Context: Ensuring high levels of dependability in modern computer-based systems has become increasingly challenging due to their complexity. Although systems are validated at design time, their behavior can be different at runtime, possibly…

Software Engineering · Computer Science 2026-03-30 Francesco Vitale , Francesco Flammini , Mauro Caporuscio , Nicola Mazzocca

Runtime monitoring checks, during execution, whether a partial signal produced by a hybrid system satisfies its specification. Signal First-Order Logic (SFO) offers expressive real-time specifications over such signals, but currently comes…

Logic in Computer Science · Computer Science 2026-03-04 Marek Chalupa , Thomas A. Henzinger , N. Ege Saraç , Emily Yu

Flow matching is a scalable generative framework for characterizing continuous normalizing flows with wide-range applications. However, current state-of-the-art methods are not well-suited for modeling dynamical systems, as they construct…

Machine Learning · Computer Science 2026-05-15 Santanu Subhash Rathod , Pietro Liò , Xiao Zhang

In this paper, we present a Bayesian method for statistical model checking (SMC) of probabilistic hyperproperties specified in the logic HyperPCTL* on discrete-time Markov chains (DTMCs). While SMC of HyperPCTL* using sequential probability…

Multiagent Systems · Computer Science 2022-09-07 Spandan Das , Pavithra Prabhakar

First-order logic has been established as an important tool for modeling and verifying intricate systems such as distributed protocols and concurrent systems. These systems are parametric in the number of nodes in the network or the number…

Logic in Computer Science · Computer Science 2024-08-21 Raz Lotan , Eden Frenkel , Sharon Shoham

We introduce a machine learning approach to model checking temporal logic, with application to formal hardware verification. Model checking answers the question of whether every execution of a given system satisfies a desired temporal logic…

Logic in Computer Science · Computer Science 2024-11-01 Mirco Giacobbe , Daniel Kroening , Abhinandan Pal , Michael Tautschnig

Component-based software development (CBSD) is an alternative approach to constructing software systems that offers numerous benefits, particularly in decreasing the complexity of system design. However, deploying components into a system…

Software Engineering · Computer Science 2021-05-28 Faranak Nejati , Abdul Azim Abd. Ghani , Ng Keng Yap , Azmi Jaafar

Reliability in terms of functional properties from the safety-liveness spectrum is an indispensable requirement of low-level operating-system (OS) code. However, with evermore complex and thus less predictable hardware, quantitative and…

We introduce Mars 2.0 for modeling, analysis, verification and code generation of Cyber-Physical Systems. Mars 2.0 integrates Mars 1.0 with several important extensions and improvements, allowing the design of cyber-physical systems using…

Programming Languages · Computer Science 2024-03-06 Bohua Zhan , Xiong Xu , Qiang Gao , Zekun Ji , Xiangyu Jin , Shuling Wang , Naijun Zhan

As modern software systems grow in complexity and operate in dynamic environments, the need for runtime analysis techniques becomes a more critical part of the verification and validation process. Runtime verification monitors the runtime…

Software Engineering · Computer Science 2025-09-23 Cristina Stratan , Claudio Mandrioli , Domenico Bianculli

Stochastic model checking is a technique for analyzing systems that possess probabilistic characteristics. However, its scalability is limited as probabilistic models of real-world applications typically have very large or infinite state…

Logic in Computer Science · Computer Science 2019-06-11 Thakur Neupane , Chris J. Myers , Curtis Madsen , Hao Zheng , Zhen Zhang

Symbolic trajectory evaluation (STE) is a model checking technique that has been successfully used to verify industrial designs. Existing implementations of STE, however, reason at the level of bits, allowing signals to take values in {0,…

One of the most significant challenges in the field of software code auditing is the presence of vulnerabilities in software source code. Every year, more and more software flaws are discovered, either internally in proprietary code or…

Cryptography and Security · Computer Science 2023-06-16 Mst Shapna Akter , Hossain Shahriar , Juan Rodriguez Cardenas , Sheikh Iqbal Ahamed , Alfredo Cuzzocrea

Networked control systems (NCS) are spatially distributed systems where communication among plants, sensors, actuators and controllers occurs in a shared communication network. NCS have been studied for the last ten years and important…

Systems and Control · Computer Science 2015-03-20 Alessandro Borri , Giordano Pola , Maria Domenica Di Benedetto

In this paper, we investigate the verification and enforcement of strong state-based opacity (SBO) in discrete-event systems modeled as partially-observed (nondeterministic) finite-state automata, including strong K-step opacity (K-SSO),…

Formal Languages and Automata Theory · Computer Science 2024-01-22 Xiaoguang Han , Kuize Zhang , Zhiwu Li

Rule-based reasoning over natural language input arises in domains where decisions must be auditable and justifiable: clinical protocols specify eligibility criteria in prose, evidence rules define admissibility through textual conditions,…

Artificial Intelligence · Computer Science 2026-01-06 Albert Sadowski , Jarosław A. Chudziak
‹ Prev 1 8 9 10 Next ›