English
Related papers

Related papers: SMT-Based Safety Verification of Data-Aware Proces…

200 papers

The concept of matching dependencies (mds) is recently pro- posed for specifying matching rules for object identification. Similar to the functional dependencies (with conditions), mds can also be applied to various data quality…

Databases · Computer Science 2009-06-13 Shaoxu Song , Lei Chen

The focus of this paper is on reducing the complexity in verification by exploiting modularity at various levels: in specification, in verification, and structurally. For specifications, we use the modular language CSP-OZ-DC, which allows…

Software Engineering · Computer Science 2015-05-20 Johannes Faber , Carsten Ihlemann , Swen Jacobs , Viorica Sofronie-Stokkermans

The design of embedded safety-critical systems such as those used in next-generation automotive and autonomous platforms, is increasingly challenged by escalating system complexity, hardware-software heterogeneity, and the integration of…

Artificial Intelligence · Computer Science 2026-05-04 Behnaz Ranjbar , Kirankumar Raveendiran , Sudeep Pasricha , Samarjit Chakraborty , Cecilia Carbonelli , Akash Kumar

Reinforcement learning (RL) has shown great potential for solving complex tasks in a variety of domains. However, applying RL to safety-critical systems in the real-world is not easy as many algorithms are sample-inefficient and maximising…

Machine Learning · Computer Science 2024-02-02 Alexander W. Goodall , Francesco Belardinelli

A system vulnerability analysis technique (SVAT) for complex mission critical systems (CMCS) was developed in response to the need to be able to conduct penetration testing on large industrial systems which cannot be taken offline or risk…

Cryptography and Security · Computer Science 2023-06-08 Matthew Tassava , Cameron Kolodjski , Jeremy Straub

Many clinical workflows depend on interactive computer systems for highly technical, conceptual work products, such as diagnoses, treatment plans, care coordination, and case management. We describe an automatic logic reasoner to verify…

Software Engineering · Computer Science 2020-08-05 Mohcine Madkour , Keith Butler , Eric Mercer , Ali Bahrami , Cui Tao

Sequential decision making using Markov Decision Process underpins many realworld applications. Both model-based and model free methods have achieved strong results in these settings. However, real-world tasks must balance reward…

Machine Learning · Computer Science 2026-04-01 Janaka Chathuranga Brahmanage , Akshat Kumar

Connected cars are susceptible to cyberattacks. Security and safety of future vehicles highly depend on a holistic protection of automotive components, of which the time-sensitive backbone network takes a significant role. These onboard…

Networking and Internet Architecture · Computer Science 2024-05-03 Philipp Meyer , Timo Häckel , Teresa Lübeck , Franz Korf , Thomas C. Schmidt

Symbolic data structures for model checking timed systems have been subject to a significant research, with Difference Bound Matrices (DBMs) still being the preferred data structure in several mature verification tools. In comparison,…

Data Structures and Algorithms · Computer Science 2012-11-28 Kenneth Y. Jørgensen , Kim G. Larsen , Jiří Srba

Generating proofs of unsatisfiability is a valuable capability of most SAT solvers, and is an active area of research for SMT solvers. This paper introduces the first method to efficiently generate proofs of unsatisfiability specifically…

Logic in Computer Science · Computer Science 2024-04-19 Nick Feng , Alan J. Hu , Sam Bayless , Syed M. Iqbal , Patrick Trentin , Mike Whalen , Lee Pike , John Backes

Threat detection systems rely on rule-based logic to identify adversarial behaviors, yet the conformance of these rules to high-level threat models is rarely verified formally. We present a formal verification framework that models both…

Cryptography and Security · Computer Science 2025-09-17 Dumitru-Bogdan Prelipcean , Cătălin Dima

Operator Precedence Languages (OPL) have been recently identified as a suitable formalism for model checking recursive procedural programs, thanks to their ability of modeling the program stack. OPL requirements can be expressed in the…

Logic in Computer Science · Computer Science 2024-05-21 Michele Chiari , Luca Geatti , Nicola Gigante , Matteo Pradella

The automotive industry is experiencing a transition from assisted to highly automated driving. New concepts for validation of Automated Driving System (ADS) include amongst other a shift from a "technology based" approach to a "scenario…

Software Engineering · Computer Science 2023-02-02 Ilona Cieslik , Víctor J. Expósito Jiménez , Helmut Martin , Heiko Scharke , Hannes Schneider

Efficient implementations of atomic objects such as concurrent stacks and queues are especially susceptible to programming errors, and necessitate automatic verification. Unfortunately their correctness criteria - linearizability with…

Logic in Computer Science · Computer Science 2015-05-26 Ahmed Bouajjani , Michael Emmi , Constantin Enea , Jad Hamza

The increasing use of machine-learning (ML) enabled systems in critical tasks fuels the quest for novel verification and validation techniques yet grounded in accepted system assurance principles. In traditional system development,…

Machine Learning · Computer Science 2020-02-11 Taejoon Byun , Sanjai Rayadurgam

We investigate the domain of satisfiable formulas in satisfiability modulo theories (SMT), in particular, automatic generation of a multitude of satisfying assignments to such formulas. Despite the long and successful history of SMT in…

Logic in Computer Science · Computer Science 2022-12-14 Matan Peled , Bat-Chen Rothenberg , Shachar Itzhaky

Machine Learning (ML) is now used in a range of systems with results that are reported to exceed, under certain conditions, human performance. Many of these systems, in domains such as healthcare , automotive and manufacturing, exhibit high…

Machine Learning · Computer Science 2021-02-03 Richard Hawkins , Colin Paterson , Chiara Picardi , Yan Jia , Radu Calinescu , Ibrahim Habli

Software model checkers based on under-approximations and SMT solvers are very successful at verifying safety (i.e. reachability) properties. They combine two key ideas -- (a) "concreteness": a counterexample in an under-approximation is a…

Logic in Computer Science · Computer Science 2013-06-11 Anvesh Komuravelli , Arie Gurfinkel , Sagar Chaki , Edmund M. Clarke

Remote attestation protocols are widely used to detect device configuration (e.g., software and/or data) compromise in Internet of Things (IoT) scenarios. Unfortunately, the performances of such protocols are unsatisfactory when dealing…

Cryptography and Security · Computer Science 2018-06-18 Moreno Ambrosin , Mauro Conti , Riccardo Lazzeretti , Md Masoom Rabbani , Silvio Ranise
‹ Prev 1 3 4 5 6 7 10 Next ›