Sciweavers

738 search results - page 106 / 148
» Formal Methods: for All or for Chosen
Sort
View
FM
2009
Springer
157views Formal Methods» more  FM 2009»
14 years 3 months ago
Symbolic Predictive Analysis for Concurrent Programs
Abstract. Predictive analysis aims at detecting concurrency errors during runtime by monitoring a concrete execution trace of a concurrent program. In recent years, various models ...
Chao Wang, Sudipta Kundu, Malay K. Ganai, Aarti Gu...
ISPD
1997
ACM
186views Hardware» more  ISPD 1997»
14 years 20 days ago
EWA: exact wiring-sizing algorithm
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
Rony Kay, Gennady Bucheuv, Lawrence T. Pileggi
SIGMOD
1995
ACM
88views Database» more  SIGMOD 1995»
14 years 22 hour ago
Semantic Assumptions and Query Evaluation in Temporal Databases
When querying a temporal database, a user often makes certain semantic assumptions on stored temporal data. This paper formalizes and studies two types of semantic assumptions: po...
Claudio Bettini, Xiaoyang Sean Wang, Elisa Bertino...
JCP
2008
142views more  JCP 2008»
13 years 8 months ago
QoS Aware Query Processing Algorithm for Wireless Sensor Networks
In sensor networks, continuous query is commonly used for collecting periodical data from the objects under monitoring. This sort of queries needs to be carefully designed, in orde...
Jun-Zhao Sun
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