Sciweavers

598 search results - page 47 / 120
» Efficient and User-Friendly Verification
Sort
View
POPL
2007
ACM
15 years 10 months ago
Interprocedural analysis of asynchronous programs
An asynchronous program is one that contains procedure calls which are not immediately executed from the callsite, but stored and "dispatched" in a non-deterministic ord...
Ranjit Jhala, Rupak Majumdar
CADE
2006
Springer
15 years 10 months ago
Inferring Network Invariants Automatically
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
Olga Grinchtein, Martin Leucker, Nir Piterman
ICCAD
2008
IEEE
98views Hardware» more  ICCAD 2008»
15 years 6 months ago
Scalable and scalably-verifiable sequential synthesis
This paper describes an efficient implementation of an effective sequential synthesis operation that uses induction to detect and merge sequentially-equivalent nodes. State-encodi...
Alan Mishchenko, Michael L. Case, Robert K. Brayto...
GLVLSI
2002
IEEE
95views VLSI» more  GLVLSI 2002»
15 years 2 months ago
Term ordering problem on MDG
As an efficient representation of Extended Finite State Machines, Multiway Decision Graphs (MDG) are suitable for automatic hardware verification of Register Transfer Level (RTL) ...
Yi Feng, Eduard Cerny
ASE
2008
102views more  ASE 2008»
14 years 9 months ago
Model driven code checking
Model checkers were originally developed to support the formal verification of high-level design models of distributed system designs. Over the years, they have become unmatched in...
Gerard J. Holzmann, Rajeev Joshi, Alex Groce