Sciweavers

788 search results - page 77 / 158
» Symbolic Equivalence Checking
Sort
View
CONCUR
1997
Springer
13 years 12 months ago
Reachability Analysis of Pushdown Automata: Application to Model-Checking
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
Ahmed Bouajjani, Javier Esparza, Oded Maler
WWW
2005
ACM
14 years 8 months ago
Consistency checking of UML model diagrams using the XML semantics approach
A software design is often modeled as a collection of unified Modeling Language (UML) diagrams. There are different aspects of the software system that are covered by many differe...
Yasser Kotb, Takuya Katayama
ENTCS
2008
103views more  ENTCS 2008»
13 years 7 months ago
Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
The verification of quantitative aspects like performance and dependability by means of model checking has become an important and vivid area of research over the past decade. An ...
Stefan Blom, Boudewijn R. Haverkort, Matthias Kunt...
ICFP
2008
ACM
14 years 7 months ago
Efficient nondestructive equality checking for trees and graphs
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
Michael D. Adams, R. Kent Dybvig
ISMVL
2000
IEEE
120views Hardware» more  ISMVL 2000»
14 years 6 days ago
Mod-p Decision Diagrams: A Data Structure for Multiple-Valued Functions
Multiple-valued decision diagrams (MDDs) give a way of approaching problems by using symbolic variables which are often more naturally associated with the problem statement than t...
Harald Sack, Elena Dubrova, Christoph Meinel