English
Related papers

Related papers: Formalisation and Analysis of Component Dependenci…

200 papers

Data analysis requires translating higher level questions and hypotheses into computable statistical models. We present a mixed-methods study aimed at identifying the steps, considerations, and challenges involved in operationalizing…

Other Computer Science · Computer Science 2021-04-08 Eunice Jun , Melissa Birchfield , Nicole de Moura , Jeffrey Heer , Rene Just

We extend a semantic verification framework for hybrid systems with the Isabelle/HOL proof assistant by an algebraic model for hybrid program stores, a shallow expression model for hybrid programs and their correctness specifications, and…

Logic in Computer Science · Computer Science 2021-06-14 Simon Foster , Jonathan Julián Huerta y Munive , Mario Gleirscher , Georg Struth

The contribution of this paper is threefold: first, it defines a framework for modelling component-based systems, as well as a formalization of integration rules to combine their behavior. This is based on finite state machines (FSM).…

Software Engineering · Computer Science 2014-06-12 Bilal Kanso , Omar Chebaro

Concurrent revisions is a concurrency control model designed to guarantee determinacy, meaning that the outcomes of programs are uniquely determined. This paper describes an Isabelle/HOL formalization of the model's operational semantics…

Logic in Computer Science · Computer Science 2019-12-23 Roy Overbeek

Component-based systems often describe context requirements in terms of explicit inter-component dependencies. Studying large instances of such systems?such as free and open source software (FOSS) distributions?in terms of declared…

Software Engineering · Computer Science 2009-05-27 Pietro Abate , Jaap Boender , Roberto Di Cosmo , Stefano Zacchiroli

Using Isabelle/HOL, we verify a union-find data structure with an explain operation due to Nieuwenhuis and Oliveras. We devise a simpler, more naive version of the explain operation whose soundness and completeness is easy to verify. Then,…

Logic in Computer Science · Computer Science 2025-08-12 Lukas Stevens , Rebecca Ghidini

Isabelle is a generic theorem prover with a fragment of higher-order logic as a metalogic for defining object logics. Isabelle also provides proof terms. We formalize this metalogic and the language of proof terms in Isabelle/HOL, define an…

Logic in Computer Science · Computer Science 2021-11-25 Tobias Nipkow , Simon Roßkopf

We present a formalization of modern SAT solvers and their properties in a form of abstract state transition systems. SAT solving procedures are described as transition relations over states that represent the values of the solver's global…

Logic in Computer Science · Computer Science 2015-07-01 Filip Maric , Predrag Janicic

Identifying dependency between two random variables is a fundamental problem. The clear interpretability and ability of a procedure to provide information on the form of possible dependence is particularly important when exploring…

Methodology · Statistics 2026-04-27 Bogdan Ćmiel , Teresa Ledwina

To understand how an organisational structure relates to organisational behaviour is an interesting fundamental challenge in the area of organisation modelling. Specifications of organisational structure usually have a diagrammatic form…

Artificial Intelligence · Computer Science 2021-09-30 Catholijn M. Jonker , Jan Treur

This paper describes a formal theory of smooth vector fields, Lie groups and the Lie algebra of a Lie group in the theorem prover Isabelle. Lie groups are abstract structures that are composable, invertible and differentiable. They are…

Logic in Computer Science · Computer Science 2024-07-30 Richard Schmoetten , Jacques D. Fleuriot

Complex systems typically have many different parts and facets, with different characteristics. In a multi-paradigm approach to modeling, formalisms with different natures are used in combination to describe complementary parts and aspects…

Logic in Computer Science · Computer Science 2013-08-14 Marcello M. Bersani , Carlo A. Furia , Matteo Pradella , Matteo Rossi

Assurance cases are often required as a means to certify a critical system. Use of formal methods in assurance can improve automation, and overcome problems with ambiguity, faulty reasoning, and inadequate evidentiary support. However,…

Logic in Computer Science · Computer Science 2019-05-16 Yakoub Nemouchi , Simon Foster , Mario Gleirscher , Tim Kelly

We present a simple and concise semantics for temporal planning. Our semantics are developed and formalised in the logic of the interactive theorem prover Isabelle/HOL. We derive from those semantics a validation algorithm for temporal…

Artificial Intelligence · Computer Science 2022-03-28 Mohammad Abdulaziz , Lukas Koller

The foundations of formal models for epistemic and doxastic logics often rely on certain logical aspects of modal logics such as S4 and S4.2 and their semantics; however, the corresponding mathematical results are often stated in papers or…

Logic in Computer Science · Computer Science 2024-04-24 Laura P. Gamboa Guzman , Kristin Y. Rozier

Due to the increased complexity of software development projects more and more systems are described by models. The sheer size makes it impractical to describe these systems by a single model. Instead many models are developed that provide…

Software Engineering · Computer Science 2014-09-24 Christoph Herrmann , Holger Krahn , Bernhard Rumpe , Martin Schindler , Steven Völkel

As deep neural models in NLP become more complex, and as a consequence opaque, the necessity to interpret them becomes greater. A burgeoning interest has emerged in rationalizing explanations to provide short and coherent justifications for…

Computation and Language · Computer Science 2024-05-21 Neema Kotonya , Francesca Toni

Importance measures provide a systematic approach to scrutinize critical system components, which are extremely beneficial in making important decisions, such as prioritizing reliability improvement activities, identifying weak-links and…

Formal Languages and Automata Theory · Computer Science 2019-04-04 Waqar Ahmed , Shahid Ali Murtza , Osman Hasan , Sofiene Tahar

Dependency analysis is a technique to identify and determine data dependencies between service protocols. Protocols evolving concurrently in the service composition need to impose an order in their execution if there exist data…

Software Engineering · Computer Science 2010-07-30 Javier Cubo , Ernesto Pimentel , Gwen Salaün , Carlos Canal

Compositional data represent a specific family of multivariate data, where the information of interest is contained in the ratios between parts rather than in absolute values of single parts. The analysis of such specific data is…