Sciweavers

8828 search results - page 1219 / 1766
» Formal methods in practice
Sort
View
SOFSEM
2007
Springer
16 years 1 months ago
Deterministic Simulation of a NFA with k -Symbol Lookahead
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
Bala Ravikumar, Nicolae Santean
SEW
2006
IEEE
16 years 1 months ago
Goal-Driven Software Development
Established software development processes focus on delivering software within time and budget according to a set of requirements. However, practical experiences show that neither...
Ingo Schnabel, Markus Pizka
SRDS
2006
IEEE
16 years 1 months ago
Solving Consensus Using Structural Failure Models
Failure models characterise the expected component failures in fault-tolerant computing. In the context of distributed systems, a failure model usually consists of two parts: a fu...
Timo Warns, Felix C. Freiling, Wilhelm Hasselbring
ACNS
2006
Springer
121views Cryptology» more  ACNS 2006»
16 years 1 months ago
Authentication for Paranoids: Multi-party Secret Handshakes
In a society increasingly concerned with the steady assault on electronic privacy, the need for privacy-preserving techniques is both natural and justified. This need extends to t...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik
ML
2006
ACM
103views Machine Learning» more  ML 2006»
16 years 1 months ago
Type-safe distributed programming for OCaml
Existing ML-like languages guarantee type-safety, ensuring memty and protecting the invariants of abstract types, but only within single executions of single programs. Distributed...
John Billings, Peter Sewell, Mark R. Shinwell, Rok...
« Prev « First page 1219 / 1766 Last » Next »