Sciweavers

429 search results - page 65 / 86
» Symbolic Computation Software Composability
Sort
View
FOSSACS
2005
Springer
14 years 1 months ago
Model Checking for Nominal Calculi
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 ...
Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto
NDSS
2008
IEEE
14 years 1 months ago
Automated Whitebox Fuzz Testing
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...
Patrice Godefroid, Michael Y. Levin, David A. Moln...
WADT
1999
Springer
13 years 11 months ago
From States to Histories
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...
Manfred Broy
FSTTCS
2004
Springer
14 years 29 days ago
Real-Counter Automata and Their Decision Problems
d Abstract) Zhe Dang ¡£¢¤¢ , Oscar H. Ibarra ¥ , Pierluigi San Pietro ¦ , and Gaoyan Xie ¡ § School of Electrical Engineering and Computer Science Washington State Univers...
Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, G...
BIRTHDAY
2006
Springer
13 years 11 months ago
Verification by Parallelization of Parametric Code
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
Tobias Gedell, Reiner Hähnle