1948 search results - page 281 / 390 » Formalizing Mirror Theory |
146
click to vote
SIGSOFT
2005
ACM
16 years 6 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...
132
click to vote
SIGSOFT
2005
ACM
16 years 6 months ago
2005
ACM
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
122
click to vote
WWW
2007
ACM
16 years 6 months ago
2007
ACM
Cryptographic protocols are useful for trust engineering in Web transactions. The Cryptographic Protocol Programming Language (CPPL) provides a model wherein trust management anno...
159
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to offers in an optimal way has not yet b...
166
click to vote
WWW
2004
ACM
16 years 6 months ago
2004
ACM
In the semantic web architecture, Web ontology languages are built on top of RDF(S). However, serious difficulties have arisen when trying to layer expressive ontology languages, ...