Sciweavers

1536 search results - page 184 / 308
» The Underlying Logic of Hoare Logic
Sort
View
EUSFLAT
2009
126views Fuzzy Logic» more  EUSFLAT 2009»
15 years 4 months ago
A Conceptual Framework for Understanding a Fuzzy System
The word Interpretability is becoming more and more frequent in the fuzzy literature. It is admitted as the main advantage of fuzzy systems and it should be given a main role in fu...
José M. Alonso, Luis Magdalena
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 3 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
JCST
2010
189views more  JCST 2010»
15 years 1 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
TCOM
2010
168views more  TCOM 2010»
15 years 1 months ago
A unified analysis of routing protocols in MANETs
This paper presents a mathematical framework for the evaluation of the performance of proactive and reactive routing protocols in mobile ad hoc networks (MANETs). This unified fram...
Hui Xu, Xianren Wu, Hamid R. Sadjadpour, J. J. Gar...
SIGSOFT
2007
ACM
16 years 7 months ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip