Verification of AMBA Using a Combination of Model Checking and Theorem Proving

Amjad, Hasan

doi:10.1016/j.entcs.2005.10.004

Cited by 18 publications

(11 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In theorem proving, however, a program is modelled as a set of mathematical definitions in some formal logic and the properties to be checked are then derived as theorems that follow from these definitions [3].…”

Section: Theorem Provingmentioning

confidence: 99%

Automated coverage calculation and test case generation

Morrison

Inggs

Visser

2012

Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference

View full text Add to dashboard Cite

Section: Theorem Provingmentioning

confidence: 99%

Automated coverage calculation and test case generation

Morrison

Inggs

Visser

2012

Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference

View full text Add to dashboard Cite

“…A verification platform for AMBA-ARM7 is presented in [23]. A verification platform for AMBA using a combination of model checking and theorem proving is described in [24].…”

Section: Related Workmentioning

confidence: 99%

Cross-Abstraction Functional Verification and Performance Analysis of Chip Multiprocessor Designs

Madl

Pasricha

Dutt

et al. 2009

IEEE Trans. Ind. Inf.

View full text Add to dashboard Cite

Abstract-This paper introduces the Cross-abstraction Real-time Analysis (CARTA) framework for the modelbased functional verification and performance estimation of chip multiprocessors (CMP) utilizing bus matrix (crossbar switch) interconnection networks. We argue that the inherent complexity in CMP designs requires the synergistic use of various models of computation to efficiently manage the trade-offs between accuracy and complexity. Our approach builds on domain-specific modeling languages (DSMLs) driving an open-source tool-chain that provides a cross-abstraction bridge between the finite state machine (FSM), discrete event (DE) and timed automata (TA) models of computation, and utilizes multiple model checkers to analyze formal properties at the cycle-accurate and transaction-level abstractions. The cross-abstraction analysis exploits accuracy for functional verification, and achieves significant speedups for performance estimation with marginal accuracy loss. We demonstrate results on an industrial strength networking CMP design utilizing a bus matrix interconnection network. To the best of our knowledge, the CARTA framework is the first model-based tool-chain that utilizes multiple abstractions and model checkers for the comprehensive and formal functional verification, performance estimation, and real-time verification of bus matrix based CMP designs.

show abstract

“…On the other hand, deductive techniques can in principle be used to verify infinite-state systems, based on sets of axioms and inference rules. Although these can be supported by theorem provers and interactive proof assistants, their use requires considerable expertise and tedious user interaction [5].…”

Section: Introductionmentioning

confidence: 99%

Predicate diagrams for the verification of real-time systems

Kang

Merz

2007

Form. Asp. Comput.

View full text Add to dashboard Cite

This article discusses a new format of predicate diagrams for the verification of real-time systems. We consider systems that are defined as extended timed graphs, a format that combines timed automata and constructs for modelling data, possibly over infinite domains. Predicate diagrams are succinct and intuitive representations of Boolean abstractions. They also represent an interface between deductive tools used to establish the correctness of an abstraction, and model checking tools that can verify behavioral properties of finite-state models. The contribution of this article is to extend the format of predicate diagrams to timed systems. We establish a set of verification conditions that are sufficient to prove that a given predicate diagram is a correct abstraction of an extended timed graph; these verification conditions can often be discharged with SMT solvers such as CVC-lite. Additionally, we describe how this approach extends naturally to the verification of parameterized systems. The formalism is supported by a toolkit, and we demonstrate its use at the hand of Fischer's real-time mutual-exclusion protocol.

show abstract

Verification of AMBA Using a Combination of Model Checking and Theorem Proving

Cited by 18 publications

References 8 publications

Automated coverage calculation and test case generation

Automated coverage calculation and test case generation

Cross-Abstraction Functional Verification and Performance Analysis of Chip Multiprocessor Designs

Predicate diagrams for the verification of real-time systems

Contact Info

Product

Resources

About