Sciweavers

3736 search results - page 190 / 748
» Generative Programming
Sort
View
ERLANG
2004
ACM
15 years 8 months ago
Flow graphs for testing sequential Erlang programs
Testing of software components during development is a heavily used approach to detect programming errors and to evaluate the quality of software. Systematic approaches to softwar...
Manfred Widera
CCS
2006
ACM
15 years 6 months ago
A scalable approach to attack graph generation
Attack graphs are important tools for analyzing security vulnerabilities in enterprise networks. Previous work on attack graphs has not provided an account of the scalability of t...
Xinming Ou, Wayne F. Boyer, Miles A. McQueen
ISSTA
2006
ACM
15 years 9 months ago
Application of automated environment generation to commercial software
Model checking can be an effective technique for detecting concurrency-related errors in software systems. However, due to scalability issues, to handle industrial-strength softw...
Oksana Tkachuk, Sreeranga P. Rajan
RSA
2008
123views more  RSA 2008»
15 years 2 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
SIAMJO
2002
149views more  SIAMJO 2002»
15 years 2 months ago
Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
Motivated by some results for linear programs and complementarity problems, this paper gives some new characterizations of the central path conditions for semidefinite programs. Ex...
Christian Kanzow, Christian Nagel