2687 search results - page 231 / 538 » Formal Analysis of PKCS |
230
click to vote
TIM
2010
15 years 1 months ago
2010
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
182
click to vote
OOPSLA
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Object-oriented language concepts have been highly successful, resulting in a large number of object-oriented languages and language extensions. Unfortunately, formal met...
168
click to vote
BIRTHDAY
2010
Springer
15 years 6 months ago
2010
Springer
The title of this paper, besides being a pun, can be taken to mean either the frontier of research in graph transformation, or the advantage of using graph transformation. To focus...
174
click to vote
SIGSOFT
2005
ACM
16 years 7 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
186
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
Ontologies are at the heart of the semantic web. They define the concepts and relationships that make global interoperability possible. However, as these ontologies grow in size t...