154 search results - page 24 / 31 » A Formal Verification Approach for IP-based Designs |
127
click to vote
AICT
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper we discuss a model-based approach to the analysis of service interactions for coordinated web service compositions using obligation policies specified in the form of...
121
click to vote
EGOV
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Research works and surveys focusing on e-Government Digital Services availability and usage, reveal that often services are available but ignored by citizens. In our hypo...
207
click to vote
POPL
2004
ACM
16 years 2 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
106
click to vote
DAC
2005
ACM
16 years 2 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
125
click to vote
SAC
2006
ACM
15 years 1 months ago
2006
ACM
We propose a rule-based approach for transforming B abstract machines into UML diagrams. We believe that important insight into the structure underlying a B model can be gained by...