Sciweavers

1912 search results - page 118 / 383
» On the evaluation of argumentation formalisms
Sort
View
IFL
2005
Springer
116views Formal Methods» more  IFL 2005»
15 years 12 months ago
Proof Tool Support for Explicit Strictness
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Marko C. J. D. van Eekelen, Maarten de Mol
ISICT
2003
15 years 7 months ago
Analysis of a mobile communication security protocol
: Cryptographic protocols are used to achieve secure communication over insecure networks. Weaknesses in such protocols are hard to identify, as they can be the result of subtle de...
Tom Coffey, Reiner Dojen
ENTCS
2006
130views more  ENTCS 2006»
15 years 6 months ago
LSC Verification for UML Models with Unbounded Creation and Destruction
The approaches to automatic formal verification of UML models known up to now require a finite bound on the number of objects existing at each point in time. In [4] we have observ...
Bernd Westphal
JCB
2000
101views more  JCB 2000»
15 years 6 months ago
Evaluation Measures of Multiple Sequence Alignments
Multiple sequence alignments (MSAs) are frequently used in the study of families of protein sequences or DNA/RNA sequences. They are a fundamental tool for the understanding of th...
Gaston H. Gonnet, Chantal Korostensky, Steven A. B...
SCAM
2006
IEEE
16 years 13 days ago
Evaluating C++ Design Pattern Miner Tools
Many articles and tools have been proposed over the years for mining design patterns from source code. These tools differ in several aspects, thus their fair comparison is hard. B...
Lajos Jeno Fülöp, Tamas Gyovai, Rudolf F...