Sciweavers

2989 search results - page 209 / 598
» Using Domain-Independent Problems for Introducing Formal Met...
Sort
View
132
Voted
TCAD
2002
121views more  TCAD 2002»
15 years 2 months ago
Robust Boolean reasoning for equivalence checking and functional property verification
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
Andreas Kuehlmann, Viresh Paruthi, Florian Krohm, ...
116
Voted
IFM
2007
Springer
15 years 8 months ago
Qualitative Probabilistic Modelling in Event-B
Abstract. Event-B is a notation and method for discrete systems modelling by refinement. We introduce a small but very useful construction: qualitative probabilistic choice. It ex...
Stefan Hallerstede, Thai Son Hoang
BIBE
2005
IEEE
121views Bioinformatics» more  BIBE 2005»
15 years 8 months ago
RNA Pseudoknot Prediction Using Term Rewriting
RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are widely occurring structural motifs found in a...
Xuezheng Fu, Hao Wang, William L. Harrison, Robert...
MEMOCODE
2007
IEEE
15 years 8 months ago
Towards Equivalence Checking Between TLM and RTL Models
The always increasing complexity of digital system is overcome in design flows based on Transaction Level Modeling (TLM) by designing and verifying the system at difbstraction le...
Nicola Bombieri, Franco Fummi, Graziano Pravadelli...
IFM
2005
Springer
100views Formal Methods» more  IFM 2005»
15 years 8 months ago
Embedding the Stable Failures Model of CSP in PVS
We present an embedding of the stable failures model of CSP in the PVS theorem prover. Our work, extending a previous embedding of the traces model of CSP in [6], provides a platfo...
Kun Wei, James Heather