Anton Chepurov
Tallinn University of Technology
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Anton Chepurov.
european test symposium | 2008
Maksim Jenihhin; Jaan Raik; Anton Chepurov; Raimund Ubar
The paper proposes a novel method for PSL language assertions simulation-based checking. The method uses a system representation model called High-level decision diagrams (HLDD). Previous works have shown that HLDDs are an efficient model for simulation and convenient for diagnosis and debug. The presented approach proposes a temporal extension for the existing HLDD model aimed at supporting temporal properties expressed in PSL. Other contributions of the paper are methodology for direct conversion of PSL properties to HLDD and HLDD-based simulator modification for assertions checking support. Experimental results show the feasibility and efficiency of the proposed approach.
Journal of Electronic Testing | 2009
Maksim Jenihhin; Jaan Raik; Anton Chepurov; Raimund Ubar
This paper proposes a novel method for the simulation-based checking of assertions written in the PSL language. The method uses a system representation model called High-Level Decision Diagrams (HLDDs). Previous works have shown that HLDDs are an efficient model for simulation and convenient for diagnosis and debug. The presented approach proposes a temporal extension for the existing HLDD model aimed at supporting temporal properties expressed in Property Specification Language (PSL). Other contributions of the paper are a methodology for direct conversion of PSL properties to HLDD and modification of the HLDD-based simulator for assertion checking support. Experimental results show the feasibility and efficiency of the proposed approach.
international biennial baltic electronics conference | 2008
Karina Minakova; Uljana Reinsalu; Anton Chepurov; Jaan Raik; Maksim Jenihhin; Raimund Ubar; Peeter Ellervee
Previous works have shown that high-level decision diagrams (HLDD-s) are suitable for system representation for analyzing code coverage metrics. This is due to the fact that HLDD models implicitly represent classical code coverage items, such as statement and branch coverage. However, research on the properties of HLDD-s, which contribute to the accuracy of coverage assessment, is missing. Current paper proposes a set of HLDD manipulations in order to generate diagrams that would allow more stringent code coverage measurement without sacrificing performance, i.e., computation time and memory requirements. The techniques include generation of HLDD-trees from Hardware Description Language (HDL)descriptions and two types of HLDD collapsing methods, which are a generalization of the BDD reduction rules. Experiments on ITC99 benchmark circuits show that the code coverage assessment based on the proposed HLDD manipulation is more stringent than what can be achieved with classical methods. At the same time, the model is well scalable because HLDD generation is terminated in the HDL variables.
norchip | 2010
Jaan Raik; Urmas Repinski; Raimund Ubar; Maksim Jenihhin; Anton Chepurov
The paper proposes a method for locating design errors at the source-level of hardware description language code using the design representation of High-Level Decision Diagram (HLDD) models. The method is based on backtracing the mismatched and matched outputs of the system under verification on HLDDs. Experiments on a set of sequential register-transfer level benchmarks show that the method is capable of locating the design errors injected with a high accuracy and a short run time. In fact all the errors injected in the experiments were identified as top suspects by the proposed diagnosis algorithm.
2009 10th Latin American Test Workshop | 2009
Maksim Jenihhin; Jaan Raik; Anton Chepurov; Uljana Reinsalu; Raimund Ubar
The paper proposes High-Level Decision Diagrams (HLDDs) model based structural coverage metrics that are applicable to, both, verification and high-level test. Previous works have shown that HLDDs are an efficient model for simulation and test generation. However, the coverage properties of HLDDs against Hardware Description Languages (HDL) have not been studied in detail before. In this paper we show that the proposed methodology allows more stringent structural coverage analysis than traditional VHDL code coverage. Furthermore, the main new contribution of the paper is a hierarchical approach for condition coverage metric analysis that is based on HLDDs with expansion graphs for conditional nodes. Experiments on ITC99 benchmarks show that up to 14% increase in coverage accuracy can be achieved by the proposed methodology.
latin american test workshop - latw | 2010
Hanno Hantson; Jaan Raik; Maksim Jenihhin; Anton Chepurov; Raimund Ubar; Giuseppe Di Guglielmo; Franco Fummi
The paper presents a new tool for mutation analysis using the system model of high-level decision diagrams (HLDD). The tool is integrated into the APRICOT verification environment. It is based on HLDD simulation and graph perturbation. A strategy that relies on a restricted set of five key mutation operators is developed in order to speed up the mutation analysis. Experiments on several ITC99 benchmarks and an industrial example show the feasibility of the mutation analysis approach.
Microprocessors and Microsystems | 2013
Jaan Raik; Urmas Repinski; Anton Chepurov; Hanno Hantson; Raimund Ubar; Maksim Jenihhin
Abstract The paper proposes a method for locating design errors at the source-level of Register-Transfer Level (RTL) hardware description language code using the design representation of High-Level Decision Diagram (HLDD) models and correcting them by applying mutation operators. The error localization is based on backtracing the mismatched and matched outputs of the design under verification on HLDDs. As a result of the localization step, all the variables in the RTL description receive a suspiciousness score. Subsequently, a mutation-based correction algorithm is applied providing automated correction for the design under verification. Experiments on a set of sequential RTL benchmarks show that the method is capable of locating the design errors injected with a high accuracy and a short run time. In fact a majority of the errors injected in the experiments were identified as top suspects by the proposed diagnosis algorithm. Furthermore, we show that because of this localization accuracy the mutation-based correction requires very small number of iterations and thus a short run-time.
international biennial baltic electronics conference | 2008
Anton Chepurov; G. Di Guglielmo; Franco Fummi; Graziano Pravadelli; Jaan Raik; Raimund Ubar; Taavi Viilukas
The paper describes, first, a technique to automatically generate extended finite state machines (EFSMs) and high-level decision diagrams (HLDDs) from HDL descriptions. Then, these two paradigms are exploited inside a functional test pattern generator. The goal is to combine the beneficial properties of the above paradigms using EFSMs for targeting control FSM transitions and variable-oriented HLDDs for targeting bit-coverage faults in the data variables, respectively. Experimental results show that combining the two computational models in a functional ATPG yields indeed in higher fault coverage.
2008 19th EAEEIE Annual Conference | 2008
Jaan Raik; Maksim Jenihhin; Anton Chepurov; Uljana Reinsalu; Raimund Ubar
The paper presents a new framework for digital systems verification. The framework has been developed in Tallinn University of Technology and it is called APRICOT. It supports a wide range of verification tasks including assertion checking, code coverage analysis, simulation, test generation and property checking and it is also easy to set up and use. Therefore it is highly suitable for supporting higher education and research in verification. The novelty of APRICOT lies in a system representation model called High-Level Decision Diagrams (HLDD). APRICOT has also interfaces to commonly used design formats such as VHDL, SystemC, PSL and EDIF.
international biennial baltic electronics conference | 2008
Maksim Jenihhin; Jaan Raik; Raimund Ubar; Anton Chepurov
Assertions have proven to be an effective mechanism to improve quality and to speed-up simulation-based design verification. They are created and embedded to the simulatable design description by the designer, the person with the deepest knowledge about the desired functionality and its real implementation. In this paper we propose to reuse this valuable information during the design manufacturing testing phase to increase the test quality and efficiency. The paper considers different types of design properties created for verification such as environmental assumptions and internal signal assertions. The reusable information is proposed to be applied for test pattern generation, embedded test observability improvement and DfT (design for testability) enhancement.