An overview of decision table literature 1982-1995.

This report gives an overview of the literature on decision tables over the past 15 years. As much as possible, for each reference, an author supplied abstract, a number of keywords and a classification are provided. In some cases own comments are added. The purpose of these comments is to show where, how and why decision tables are used. The literature is classified according to application area, theoretical versus practical character, year of publication, country or origin (not necessarily country of publication) and the language of the document. After a description of the scope of the interview, classification results and the classification by topic are presented. The main body of the paper is the ordered list of publications with abstract, classification and comments.

Cyber-security for embedded systems: methodologies, techniques and tools

L'abstract è presente nell'allegato / the abstract is in the attachmen

Quantum catastrophes: a case study

The bound-state spectrum of a Hamiltonian H is assumed real in a non-empty domain D of physical values of parameters. This means that for these parameters, H may be called crypto-Hermitian, i.e., made Hermitian via an {\it ad hoc} choice of the inner product in the physical Hilbert space of quantum bound states (i.e., via an {\it ad hoc} construction of the so called metric). The name of quantum catastrophe is then assigned to the N-tuple-exceptional-point crossing, i.e., to the scenario in which we leave domain D along such a path that at the boundary of D, an N-plet of bound state energies degenerates and, subsequently, complexifies. At any fixed $N \geq 2$, this process is simulated via an N by N benchmark effective matrix Hamiltonian H. Finally, it is being assigned such a closed-form metric which is made unique via an N-extrapolation-friendliness requirement.Comment: 23 p

An integrated formal methods tool-chain and its application to verifying a file system model

Tool interoperability as a mean to achieve integration is among the main goals of the international Grand Challenge initiative. In the context of the Verifiable file system mini-challenge put forward by Rajeev Joshi and Gerard Holzmann, this paper focuses on the integration of different formal methods and tools in modelling and verifying an abstract file system inspired by the Intel (R) Flash File System Core. We combine high-level manual specification and proofs with current state of the art mechanical verification tools into a tool-chain which involves Alloy, VDM++ and HOL. The use of (pointfree) relation modelling provides the glue which binds these tools together.Mondrian Project funded by the Portuguese NSF under contract PTDC/EIA-CCO/108302/200

Single domain integral transform analysis of natural convection in cavities partially filled with heat generating porous medium

An analysis of natural convection within a rectangular cavity partially filled with a heat-generating porous medium is carried out through the Generalized Integral Transform Technique (GITT), in which the laminar flow and energy equations are solved with automatic error control. A single domain reformulation strategy is adopted to rewrite the governing equations within the fluid and the porous medium as a single heterogeneous medium formulation, with spatially variable physical properties and source terms that account for the abrupt transition of the two regions. This fundamental study is motivated by the analysis of wet storage of spent nuclear fuel elements with passive cooling of the pool and physical conclusions are drawn from the hybrid numerical-analytical solution. Increases in the Rayleigh number with constant internal heat generation are found to lower the maximum temperature within the cavity. Moreover, decreasing the aspect ratio also has positive effects on the cooling of the cavity.Indisponível

LLM for SoC Security: A Paradigm Shift

As the ubiquity and complexity of system-on-chip (SoC) designs increase across electronic devices, the task of incorporating security into an SoC design flow poses significant challenges. Existing security solutions are inadequate to provide effective verification of modern SoC designs due to their limitations in scalability, comprehensiveness, and adaptability. On the other hand, Large Language Models (LLMs) are celebrated for their remarkable success in natural language understanding, advanced reasoning, and program synthesis tasks. Recognizing an opportunity, our research delves into leveraging the emergent capabilities of Generative Pre-trained Transformers (GPTs) to address the existing gaps in SoC security, aiming for a more efficient, scalable, and adaptable methodology. By integrating LLMs into the SoC security verification paradigm, we open a new frontier of possibilities and challenges to ensure the security of increasingly complex SoCs. This paper offers an in-depth analysis of existing works, showcases practical case studies, demonstrates comprehensive experiments, and provides useful promoting guidelines. We also present the achievements, prospects, and challenges of employing LLM in different SoC security verification tasks.Comment: 42 page

Optimized Temporal Monitors for SystemC

SystemC is a modeling language built as an extension of C++. Its growing popularity and the increasing complexity of designs have motivated research efforts aimed at the verification of SystemC models using assertion-based verification (ABV), where the designer asserts properties that capture the design intent in a formal language such as PSL or SVA. The model then can be verified against the properties using runtime or formal verification techniques. In this paper we focus on automated generation of runtime monitors from temporal properties. Our focus is on minimizing runtime overhead, rather than monitor size or monitor-generation time. We identify four issues in monitor generation: state minimization, alphabet representation, alphabet minimization, and monitor encoding. We conduct extensive experimentation and identify a combination of settings that offers the best performance in terms of runtime overhead