Sciweavers

1175 search results - page 73 / 235
» Abstract computability and algebraic specification
Sort
View
WWW
2004
ACM
14 years 8 months ago
A semantic approach for designing business protocols
Business processes involve interactions among autonomous partners. We propose that these interactions be specified modularly as protocols. Protocols can be published, enabling imp...
Ashok U. Mallya, Munindar P. Singh
PLILP
1998
Springer
13 years 12 months ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...
OWLED
2008
13 years 9 months ago
The OWL in the CASL - Designing Ontologies Across Logics
Abstract. In this paper, we show how the web ontology language OWL can be accommodated within the larger framework of the heterogeneous common algebraic specification language HETC...
Oliver Kutz, Dominik Lücke, Till Mossakowski,...
APLAS
2010
ACM
13 years 8 months ago
Verification of Tree-Processing Programs via Higher-Order Model Checking
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
Hiroshi Unno, Naoshi Tabuchi, Naoki Kobayashi
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 7 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama