Sciweavers

2702 search results - page 58 / 541
» Practically Applicable Formal Methods
Sort
View
JCST
2010
189views more  JCST 2010»
14 years 4 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
FMOODS
2007
14 years 11 months ago
A Probabilistic Formal Analysis Approach to Cross Layer Optimization in Distributed Embedded Systems
We present a novel approach, based on probabilistic formal methods, to developing cross-layer resource optimization policies for resource limited distributed systems. One objective...
Minyoung Kim, Mark-Oliver Stehr, Carolyn L. Talcot...
RTSS
1999
IEEE
15 years 2 months ago
On the Use of Formal Techniques for Analyzing Dependable Real-Time Protocols
The e ective design of composite dependable and real-time protocols entails demonstrating their proof of correctness and, in practice, the e cient delivery of services. We focus o...
Purnendu Sinha, Neeraj Suri
KER
2008
134views more  KER 2008»
14 years 9 months ago
A review of current defeasible reasoning implementations
This article surveys existing practical implementations of both defeasible and argumentationbased reasoning engines and associated literature. We aim to summarise the current stat...
Daniel Bryant, Paul J. Krause
ECOOPW
1998
Springer
15 years 1 months ago
Providing Automatic Support for Heuristic Rules of Methods
In method-based software development, software engineers create artifacts based on the heuristic rules of the adopted method. Most CASE tools, however, do not actively assist soft...
Bedir Tekinerdogan, Mehmet Aksit