Sciweavers

923 search results - page 37 / 185
» Proving the value of formal methods
Sort
View
SIGIR
2004
ACM
15 years 11 months ago
A formal study of information retrieval heuristics
Empirical studies of information retrieval methods show that good retrieval performance is closely related to the use of various retrieval heuristics, such as TF-IDF weighting. On...
Hui Fang, Tao Tao, ChengXiang Zhai
FM
2006
Springer
169views Formal Methods» more  FM 2006»
15 years 9 months ago
PSL Model Checking and Run-Time Verification Via Testers
Abstract. The paper introduces the construct of temporal testers as a compositional basis for the construction of automata corresponding to temporal formulas in the PSL logic. Temp...
Amir Pnueli, Aleksandr Zaks
CAGD
2000
246views more  CAGD 2000»
15 years 5 months ago
Estimation of the principle curvatures of approximated surfaces
This paper presents a method for estimating curvature values of a surface, which is given only approximatively, e.g., by measured data. The presented method requires estimates of ...
Christian Wollmann
FOSSACS
2001
Springer
15 years 10 months ago
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
Rémi Morin
AFP
1995
Springer
125views Formal Methods» more  AFP 1995»
15 years 9 months ago
Merging Monads and Folds for Functional Programming
Abstract. These notes discuss the simultaneous use of generalised fold operators and monads to structure functional programs. Generalised fold operators structure programs after th...
Erik Meijer, Johan Jeuring