238 search results - page 15 / 48 » Compositional Proof Methods for Concurrency: A Semantic Appr... |
245
click to vote
VLDB
2007
ACM
16 years 1 months ago
2007
ACM
The recent upsurge in the interest in Semantic Web services and the high-profile projects such as the WSMO, OWLS, and SWSL, have drawn attention to the importance of logic-based ...
211
click to vote
TPHOL
1999
IEEE
15 years 11 months ago
1999
IEEE
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...
178
Voted
EMNLP
2008
15 years 9 months ago
2008
Determining the polarity of a sentimentbearing expression requires more than a simple bag-of-words approach. In particular, words or constituents within the expression can interac...
214
click to vote
ENTCS
2010
15 years 7 months ago
2010
This paper presents a formal framework for compositional reasoning about secure systems. A key insight is to view a trusted system in terms of the interfaces that the various comp...
215
click to vote
UML
2000
Springer
15 years 11 months ago
2000
Springer
In this paper, dynamic meta modeling is proposed as a new approach to the operational semantics of behavioral UML diagrams. The dynamic meta model extends the well-known static met...