English
Related papers

Related papers: Relating Alternating Relations for Conformance and…

200 papers

We propose an input/output conformance testing theory utilizing Modal Interface Automata with Input Refusals (IR-MIA) as novel behavioral formalism for both the specification and the implementation under test. A modal refinement relation on…

Logic in Computer Science · Computer Science 2019-02-15 Lars Luthmann , Stephan Mennicke , Malte Lochau

We present an adaptation of input/output conformance (ioco) testing principles to families of similar implementation variants as appearing in product line engineering. Our proposed product line testing theory relies on Modal Interface…

Software Engineering · Computer Science 2015-04-15 Lars Luthmann , Stephan Mennicke , Malte Lochau

One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the…

Logic in Computer Science · Computer Science 2012-06-22 Krishnendu Chatterjee , Siddhesh Chaubal , Pritish Kamath

I/O conformance testing theories (e.g., ioco) are concerned with formally defining when observable output behaviors of an implementation conform to those permitted by a specification. Thereupon, several real-time extensions of ioco, usually…

Logic in Computer Science · Computer Science 2020-02-18 Lars Luthmann , Hendrik Göttmann , Malte Lochau

To model real-world software systems, modelling paradigms should support a form of compositionality. In interface theory and model-based testing with inputs and outputs, conjunctive operators have been introduced: the behaviour allowed by…

Formal Languages and Automata Theory · Computer Science 2020-02-21 Ramon Janssen

Several notions of conformance have been proposed for checking the behavior of cyber-physical systems against their hybrid systems models. In this paper, we explore the initial idea of a notion of approximate conformance that allows for…

Logic in Computer Science · Computer Science 2016-12-16 Morteza Mohaqeqi , Mohammad Reza Mousavi

Simulation and refinement are variations of the bisimulation relation, where in the former we keep only atoms and forth, and in the latter only atoms and back. Quantifying over simulations and refinements captures the effects of information…

Logic in Computer Science · Computer Science 2025-12-01 Hans van Ditmarsch , Tim French , Rustam Galimullin , Louwe B. Kuijer

Modern software is constantly changing. Researchers and practitioners are increasingly aware that verification tools can be impactful if they embrace change through analyses that are compositional and span program versions. Reasoning about…

Programming Languages · Computer Science 2019-03-19 Timos Antonopoulos , Eric Koskinen , Ton-Chanh Le

Model-based testing (MBT) is a well-known technology, which allows for automatic test case generation, execution and evaluation. To test non-functional properties, a number of test MBT frameworks have been developed to test systems with…

Logic in Computer Science · Computer Science 2015-04-10 Marcus Gerhold , Mariëlle Stoelinga

This paper studies the construction of symbolic abstractions for nonlinear control systems via feedback refinement relation. Both the delay-free and time-delay cases are addressed. For the delay-free case, to reduce the computational…

Systems and Control · Electrical Eng. & Systems 2020-11-26 Wei Ren , Dimos V. Dimarogonas

We consider the setting of component-based design for real-time systems with critical timing constraints. Based on our earlier work, we propose a compositional specification theory for timed automata with I/O distinction, which supports…

Software Engineering · Computer Science 2012-06-21 Chris Chilton , Marta Kwiatkowska , Xu Wang

Correctness of concurrent objects is defined in terms of safety properties such as linearizability, sequential consistency, and quiescent consistency, and progress properties such as wait-, lock-, and obstruction-freedom. These properties,…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-03-07 Brijesh Dongol , Lindsay Groves

We present a new type system combining occurrence typing, previously used to type check programs in dynamically-typed languages such as Racket, JavaScript, and Ruby, with dependent refinement types. We demonstrate that the addition of…

Programming Languages · Computer Science 2016-10-05 Andrew M. Kent , David Kempe , Sam Tobin-Hochstadt

The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance. It makes the…

Software Engineering · Computer Science 2012-10-10 Pavol Černý , Martin Chmelík , Thomas A. Henzinger , Arjun Radhakrishna

Model-based mutation testing uses altered test models to derive test cases that are able to reveal whether a modelled fault has been implemented. This requires conformance checking between the original and the mutated model. This paper…

Software Engineering · Computer Science 2012-02-29 Bernhard K. Aichernig , Elisabeth Jöbstl

Software testing is an important issue in software development process to ensure higher quality on the products. Formal methods has been promising on testing reactive systems, specially critical systems, where accuracy is mandatory since…

Software Engineering · Computer Science 2019-08-13 Camila Sonada Gomes , Adilson Luiz Bonifacio

Alternating automata have been widely used to model and verify systems that handle data from finite domains, such as communication protocols or hardware. The main advantage of the alternating model of computation is that complementation is…

Formal Languages and Automata Theory · Computer Science 2017-08-17 Radu Iosif , Xiao Xu

This article explains the distinctions between robustness and resilience in control systems. Resilience confronts a distinct set of challenges, posing new ones for designing controllers for feedback systems, networks, and machines that…

Systems and Control · Electrical Eng. & Systems 2024-03-12 Quanyan Zhu , Tamer Basar

Model based testing is a well-established approach to verify implementations modeled by I/O labeled transition systems (IOLTSs). One of the challenges stemming from model based testing is the conformance checking and the generation of test…

Software Engineering · Computer Science 2020-02-11 Adilson Luiz Bonifacio , Arnaldo Vieira Moura

In this paper we present an assume-guarantee specification theory (aka interface theory from [14]) for modular synthesis and verification of real-time systems with critical timing constraints. It is a further step of our earlier work [10]…

Logic in Computer Science · Computer Science 2013-04-30 Chris Chilton , Marta Kwiatkowska , Xu Wang
‹ Prev 1 2 3 10 Next ›