We are witnessing an unprecedented use of the Internet, communication and computing technologies in commerce, business, government, health, defence and educational applications. Software solutions help to improve the efficiency of businesses, and to manage and exploit the information explosion. Advances in software technology, ubiquitous devices and the increasing volume of digital knowledge of...

Managing Generic IP verification requires consideration of uncertainties & dynamic changes of standard & specification during project execution. Such scenario requires well defined process which needs to be followed throughout the project execution. A creative approach is required to make sure verification architecture is flexible enough to adapt majority of the run time changes enabling faster...

In grid workflow systems, to verify fixed-time constraints efficiently at the run-time execution stage, some checkpoints are often selected so that we only need to conduct the fixed-time constraint verification at such checkpoints rather than at all activity points. However, the existing typical checkpoint selection strategies are inefficient and/or ineffective because they may incur some unnec...

A Framework for Noise Analysis and Verification of Analog Circuits Rajeev Narayanan, Ph.D. Concordia University, 2012 Analog circuit design and verification face significant challenges due to circuit complexity and short market windows. In particular, the influence of technology parameters on circuits, noise modeling and verification still remain a priority for many applications. Noise could be...

Because of its wide applicability, many eecient implementations of the Fast Fourier Transform have been developed. We propose that an eecient implementation can be produced automatically and reliably by partial evaluation. Partial evaluation of an unoptimized implementation produces a speedup of over 9 times. The automatically generated result of partial evaluation has performance comparable to...

Several proof systems allow the formal verification of Java programs, and a specification language was specifically designed for Java. However, none of these systems support generics that were introduced in Java 5. Generics are very important and useful when the collection framework (lists, sets, hash tables etc.) is used. Though they are mainly dealt with at compile time, they have some effect...

Verification and testing are two of the most costly and time consuming steps during thedevelopment of safety critical systems. The advent of complex and sometimes partiallyunpredictable computing architectures such as multicore commercial-of-the-shelf platforms,together with the composable development approach adopted in multiple industrial domains suchas avionics and automotive, rendered the e...

We study μHML (a branching-time logic with least and greatest fixpoints) from a runtime verification perspective. We establish which subset of the logic can be verified at runtime and define correct monitor-synthesis algorithms for this subset. We also prove completeness results wrt. these logical subsets that show that no other properties apart from those identified can be verified at runtime.

Assertion-Based Verification (ABV) aims at guaranteeing that designs obey properties, usually expressed under the form of logic and temporal formulae. In dynamic ABV, those properties are checked at runtime (e.g., during simulation). In the context of simulation-based verification, the significance of the selected test sequences is well known. Moreover, if the validity of properties is also to ...

Run-time errors are typically seen as unacceptable within safety and security critical software. The SPARK approach to the development of high integrity software addresses the problem of run-time errors through the use of formal verification. Proofs are constructed to show that each run-time check will never raise an error, thus proving freedom from run-time exceptions. Here we build upon the s...