Sciweavers

1796 search results - page 108 / 360
» An Approach to Compositional Model Checking
Sort
View
ATAL
2010
Springer
13 years 10 months ago
Distributed BDD-based BMC for the verification of multi-agent systems
We present a method of distributed model checking of multiagent systems specified by a branching-time temporal-epistemic logic. We introduce a serial algorithm, central to the dis...
Andrew V. Jones, Alessio Lomuscio
ASPDAC
2008
ACM
106views Hardware» more  ASPDAC 2008»
13 years 10 months ago
Verifying full-custom multipliers by Boolean equivalence checking and an arithmetic bit level proof
—In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...
Udo Krautz, Markus Wedler, Wolfgang Kunz, Kai Webe...
ICRE
2000
IEEE
14 years 28 days ago
A Lightweight Approach to Consistency of Scenarios and Class Models
Today, object-oriented requirements specifications typically combine a scenario (or use case) model and a class model for expressing functional requirements. With any such combina...
Martin Glinz
BMCBI
2008
172views more  BMCBI 2008»
13 years 9 months ago
Compo: composite motif discovery using discrete models
Background: Computational discovery of motifs in biomolecular sequences is an established field, with applications both in the discovery of functional sites in proteins and regula...
Geir Kjetil Sandve, Osman Abul, Finn Drablø...
ENTCS
2008
87views more  ENTCS 2008»
13 years 9 months ago
A Lightweight Approach for the Semantic Validation of Model Refinements
Model Driven Engineering proposes the use of models at different levels of ion. Step by step validation of model refinements is necessary to guarantee the correctness of the final ...
Claudia Pons, Diego García