arXiv subjects

Tamás Tóth

Publications and source records attributed to Tamás Tóth.

3 recordsLinked to original sources

arXiv2017

Towards Evaluating Size Reduction Techniques for Software Model Checking

Formal verification techniques are widely used for detecting design flaws in software systems. Formal verification can be done by transforming an already implemented source code to a formal model and attempting to prove certain properties of the model (e.g. that no erroneous state can occur during execution). Unfortunately, transformations from source code to a formal model often yield large and complex models, making the verification process inefficient and costly. In order to reduce the size of the resulting model, optimization transformations can be used. Such optimizations include common algorithms known from compiler design and different program slicing techniques. Our paper describes a framework for transforming C programs to a formal model, enhanced by various optimizations for size reduction. We evaluate and compare several optimization algorithms regarding their effect on the size of the model and the efficiency of the verification. Results show that different optimizations are more suitable for certain models, justifying the need for a framework that includes several algorithms.

cs.SE↗

arXiv2017

Exploiting Hierarchy in the Abstraction-Based Verification of Statecharts Using SMT Solvers

Statecharts are frequently used as a modeling formalism in the design of state-based systems. Formal verification techniques are also often applied to prove certain properties about the behavior of the system. One of the most efficient techniques for formal verification is Counterexample-Guided Abstraction Refinement (CEGAR), which reduces the complexity of systems by automatically building and refining abstractions. In our paper we present a novel adaptation of the CEGAR approach to hierarchical statechart models. First we introduce an encoding of the statechart to logical formulas that preserves information about the state hierarchy. Based on this encoding we propose abstraction and refinement techniques that utilize the hierarchical structure of statecharts and also handle variables in the model. The encoding allows us to use SMT solvers for the systematic exploration and verification of the abstract model, including also bounded model checking. We demonstrate the applicability and efficiency of our abstraction techniques with measurements on an industry-motivated example.

cs.LO↗

arXiv2016

Semiclassical theory of the magnetization process of the triangular lattice Heisenberg model

Motivated by the numerous examples of 1/3 magnetization plateaux in the triangular lattice Heisenberg an- tiferromagnet with spins ranging from 1/2 to 5/2, we revisit the semiclassical calculation of the magnetization curve of that model, with the aim of coming up with a simple method that allows one to calculate the full mag- netization curve, and not just the critical fields of the 1/3 plateau. We show that it is actually possible to calculate the magnetization curve including the first quantum corrections and the appearance of the 1/3 plateau entirely within linear spin-wave theory, with predictions for the critical fields that agree to order 1/S with those derived a long-time ago on the basis of arguments that required to go beyond linear spin-wave theory. This calculation relies on the central observation that there is a kink in the semiclassical energy at the field where the classical ground state is the collinear up-up-down structure, and that this kink gives rise to a locally linear behavior of the energy with the field when all semiclassical ground states are compared to each other for all fields. The magnetization curves calculated in this way for spin 1/2, 1 and 5/2 are shown to be in good agreement with available experimental data.

cond-mat.str-el↗