Sciweavers

3047 search results - page 344 / 610
» On the Meaning of Logical Completeness
Sort
View
ENTCS
2008
106views more  ENTCS 2008»
15 years 7 months ago
Reduction Semantics and Formal Analysis of Orc Programs
Orc is a language for orchestration of web services developed by J. Misra that offers simple, yet powerful and elegant, constructs to program sophisticated web orchestration appli...
Musab AlTurki, José Meseguer
ENTCS
2006
112views more  ENTCS 2006»
15 years 7 months ago
Modeling Web Applications by the Multiple Levels of Integrity Policy
We propose a formal method to validate the reliability of a web application, by modeling interactions among its constituent objects. Modeling exploits the recent "Multiple Le...
Gianluca Amato, Massimo Coppola, Stefania Gnesi, F...
JAIR
2008
109views more  JAIR 2008»
15 years 7 months ago
Modular Reuse of Ontologies: Theory and Practice
In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In order to formalize these tasks as reasoning problems, we introduce the notions o...
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazako...
LOGCOM
2006
90views more  LOGCOM 2006»
15 years 7 months ago
ATL Satisfiability is Indeed EXPTIME-complete
The Alternating-time Temporal Logic (ATL) of Alur, Henzinger, and Kupferman is being increasingly widely applied in the specification and verification of open distributed systems ...
Dirk Walther, Carsten Lutz, Frank Wolter, Michael ...
FUIN
2007
110views more  FUIN 2007»
15 years 7 months ago
Controllable Delay-Insensitive Processes
Abstract. Josephs and Udding’s DI-Algebra offers a convenient way of specifying and verifying designs that must rely upon delay-insensitive signalling between modules (asynchrono...
Mark B. Josephs, Hemangee K. Kapoor