Sciweavers

140 search results - page 28 / 28
» Verifying timing properties of concurrent algorithms
Sort
View
ICSE
2008
IEEE-ACM
14 years 6 months ago
Symbolic mining of temporal specifications
Program specifications are important in many phases of the software development process, but they are often omitted or incomplete. An important class of specifications takes the f...
Mark Gabel, Zhendong Su
COMPUTER
1999
69views more  COMPUTER 1999»
13 years 5 months ago
Scientific Components Are Coming
abstract mathematical or physical statement, not something specific. The way scientific programmers most frequently verify that their programs are correct is to examine their resul...
Paul F. Dubois
CAV
2010
Springer
282views Hardware» more  CAV 2010»
13 years 9 months ago
A NuSMV Extension for Graded-CTL Model Checking
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
Alessandro Ferrante, Maurizio Memoli, Margherita N...
ICDE
2010
IEEE
562views Database» more  ICDE 2010»
14 years 5 months ago
Multi-Guarded Safe Zone: An Effective Technique to Monitor Moving Circular Range Queries
Given a positive value r, a circular range query returns the objects that lie within the distance r of the query location. In this paper, we study the circular range queries that c...
Muhammad Aamir Cheema, Ljiljana Brankovic, Xuemin ...
SEMWEB
2005
Springer
13 years 10 months ago
Rapid Benchmarking for Semantic Web Knowledge Base Systems
Abstract. We present a method for rapid development of benchmarks for Semantic Web knowledge base systems. At the core, we have a synthetic data generation approach for OWL that is...
Sui-Yu Wang, Yuanbo Guo, Abir Qasem, Jeff Heflin