English
Related papers

Related papers: AsmetaF: A Flattener for the ASMETA Framework

200 papers

State machine formalisms equipped with hierarchy and parallelism allow to compactly model complex system behaviours. Such models can then be transformed into executable code or inputs for model-based testing and verification techniques.…

Software Engineering · Computer Science 2017-10-24 Xavier Devroey , Gilles Perrouin , Maxime Cordy , Axel Legay , Pierre-Yves Schobbens , Patrick Heymans

Formal methods and testing are two important approaches that assist in the development of high quality software. For long time these approaches have been seen as competitors and there was very little interaction between the two communities.…

Software Engineering · Computer Science 2014-03-31 A. P. van der Meer , R. Kherrazi , M. Hamilton

The increasing complexity of modern configurable systems makes it critical to improve the level of automation in the process of system configuration. Such automation can also improve the agility of the development cycle, allowing for rapid…

Formal Languages and Automata Theory · Computer Science 2021-08-20 Nestan Tsiskaridze , Maxwell Strange , Makai Mann , Kavya Sreedhar , Qiaoyi Liu , Mark Horowitz , Clark Barrett

This publication introduces A State Space Exploration Tool that is based on representing the model under verification as a piece of C++ code that obeys certain conventions. Its name is ASSET. Model checking takes place by compiling the…

Software Engineering · Computer Science 2016-05-23 Antti Valmari

It is well-known that Abstract State Machines (ASMs) can simulate "step-by-step" any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) simulation is not identification, 2) the ASMs simulating machines of some…

Formal Languages and Automata Theory · Computer Science 2010-03-26 Serge Grigorieff , Pierre Valarcher

Earth System Models (ESMs) are critical for understanding past climates and projecting future scenarios. However, the complexity of these models, which include large code bases, a wide community of developers, and diverse computational…

Logic in Computer Science · Computer Science 2025-10-16 Alper Altuntas , Allison H. Baker , John Baugh , Ganesh Gopalakrishnan , Stephen F. Siegel

Writing temporal logic properties is often a challenging task for users of model-based development frameworks, particularly when translating informal requirements into formal specifications. In this paper, we explore the idea of integrating…

Software Engineering · Computer Science 2026-03-17 Andrea Bombarda , Silvia Bonfanti , Angelo Gargantini , Nico Pellegrinelli

The main aim of this report is to provide an introductory tutorial on the Abstract State Machines (ASM) specification method for software engineering to an audience already familiar with the Temporal Logic of Actions (TLA$^+$) method. The…

Software Engineering · Computer Science 2023-02-01 Paolo Dini , Manuel Bravo , Philipp Paulweber , Alexander Raschke , Gabriela Moreira

Autoformalization addresses the scarcity of data for Automated Theorem Proving (ATP) by translating mathematical problems from natural language into formal statements. Efforts in recent work shift from directly prompting large language…

Artificial Intelligence · Computer Science 2025-10-09 Qi Guo , Jianing Wang , Jianfei Zhang , Deyang Kong , Xiangzhou Huang , Xiangyu Xi , Wei Wang , Jingang Wang , Xunliang Cai , Shikun Zhang , Wei Ye

Finite-state models, such as finite-state machines (FSMs), aid software engineering in many ways. They are often used in formal verification and also can serve as visual software models. The latter application is associated with the…

Software Engineering · Computer Science 2016-11-22 Vladimir Ulyantsev , Igor Buzhinsky , Anatoly Shalyto

Nowadays, publish subscribe and event based architecture are frequently used for developing loosely coupled distributed systems. Hence, it is desirable to find a proper solution to specify different systems through these architectures.…

Software Engineering · Computer Science 2014-04-09 Saeed Doostali

Foundation Models (FMs) have demonstrated unprecedented capabilities including zero-shot learning, high fidelity data synthesis, and out of domain generalization. However, as we show in this paper, FMs still have poor out-of-the-box…

In order to simplify a sentence, human editors perform multiple rewriting transformations: they split it into several shorter sentences, paraphrase words (i.e. replacing complex words or phrases by simpler synonyms), reorder components,…

Computation and Language · Computer Science 2020-05-04 Fernando Alva-Manchego , Louis Martin , Antoine Bordes , Carolina Scarton , Benoît Sagot , Lucia Specia

In this work we develop a fully automatic verification procedure of safety properties of Scade programs. We transform each such program into an SMT instance (Satisfiability Modulo Theories) and feed this to a solver. The goal is to have a…

Logic in Computer Science · Computer Science 2014-03-13 Henning Basold

Answer Set Programming (ASP) is a powerful declarative programming paradigm commonly used for solving challenging search and optimization problems. The modeling languages of ASP are supported by sophisticated solving algorithms (solvers)…

Logic in Computer Science · Computer Science 2022-08-08 Zach Hansen

Hybrid automata are a natural framework for modeling and analyzing systems which exhibit a mixed discrete continuous behaviour. However, the standard operational semantics defined over such models implicitly assume perfect knowledge of the…

Systems and Control · Computer Science 2013-08-27 Alberto Casagrande , Tommaso Dreossi , Carla Piazza

Mathematical formulas are a fundamental and widely used component in various scientific fields, serving as a universal language for expressing complex concepts and relationships. While state-of-the-art transformer models excel in processing…

Computation and Language · Computer Science 2025-07-09 Jonathan Drechsel , Anja Reusch , Steffen Herbold

In industrial model-based development (MBD) frameworks, requirements are typically specified informally using textual descriptions. To enable the application of formal methods, these specifications need to be formalized in the input…

Logic in Computer Science · Computer Science 2019-06-18 Philipp Berger , Johanna Nellen , Joost-Pieter Katoen , Erika Abraham , Md Tawhid Bin Waez , Thomas Rambow

We introduce a novel architecture and computational framework for formal, automated analysis of systems with a broad set of nonlinearities in the feedback loop, such as neural networks, vision controllers, switched systems, and even simple…

Optimization and Control · Mathematics 2018-05-02 Ivan Papusha , Ufuk Topcu , Steven Carr , Niklas Lauffer

Scanning probe microscopy (SPM) is a valuable technique by which one can investigate the physical characteristics of the surfaces of materials. However, its widespread use is hampered by the time-consuming nature of running an experiment…

Instrumentation and Detectors · Physics 2025-09-03 Nicholas J. Sullivan , Julio J. Valdés , Kirk H. Bevan , Peter Grutter
‹ Prev 1 2 3 10 Next ›