429 search results - page 65 / 86 » Symbolic Computation Software Composability |
FOSSACS
2005
Springer
15 years 5 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
107
click to vote
NDSS
2008
IEEE
15 years 6 months ago
2008
IEEE
Fuzz testing is an effective technique for finding security vulnerabilities in software. Traditionally, fuzz testing tools apply random mutations to well-formed inputs of a progr...
WADT
1999
Springer
15 years 4 months ago
1999
Springer
Based on the FOCUS theory of distributed systems (see [Broy, Stølen 01]) that are composed of interacting components we introduce a formal model of services and layered architectu...
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
d Abstract) Zhe Dang ¡£¢¤¢ , Oscar H. Ibarra ¥ , Pierluigi San Pietro ¦ , and Gaoyan Xie ¡ § School of Electrical Engineering and Computer Science Washington State Univers...
101
click to vote
BIRTHDAY
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...