Sciweavers

1724 search results - page 276 / 345
» Models for Concurrency
Sort
View
IS
2006
13 years 8 months ago
Composition of Semantic Web services using Linear Logic theorem proving
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses a Semantic Web service language (DAML-S)...
Jinghai Rao, Peep Küngas, Mihhail Matskin
JSW
2008
123views more  JSW 2008»
13 years 8 months ago
Component-oriented Reliability Analysis and Optimal Version-upgrade Problems for Open Source Software
The current software development environment has been changing into new development paradigms such as concurrent distributed development environment and the so-called open source p...
Yoshinobu Tamura, Shigeru Yamada
TCAD
2008
114views more  TCAD 2008»
13 years 8 months ago
Word-Level Predicate-Abstraction and Refinement Techniques for Verifying RTL Verilog
el Predicate Abstraction and Refinement Techniques for Verifying RTL Verilog Himanshu Jain, Daniel Kroening, Natasha Sharygina, and Edmund M. Clarke, Fellow, IEEE As a first step, ...
Himanshu Jain, Daniel Kroening, Natasha Sharygina,...
AC
2002
Springer
13 years 8 months ago
Embedded Software
nce of computation has systematically abstracted away the physical world. Embedded software systems, however, engage the physical world. Time, concurrency, liveness, robustness, c...
Edward A. Lee
ENTCS
2002
97views more  ENTCS 2002»
13 years 8 months ago
Plan in Maude: Specifying an Active Network Programming Language
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
Mark-Oliver Stehr, Carolyn L. Talcott