Sciweavers

20 search results - page 3 / 4
» Maximizing the guessability of symbolic input
Sort
View
WCET
2003
13 years 7 months ago
Fully Automatic, Parametric Worst-Case Execution Time Analysis
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
Björn Lisper
CPM
2004
Springer
87views Combinatorics» more  CPM 2004»
13 years 11 months ago
A Trie-Based Approach for Compacting Automata
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
Maxime Crochemore, Chiara Epifanio, Roberto Grossi...
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 3 months ago
Cause Clue Clauses: Error Localization using Maximum Satisfiability
Much effort is spent everyday by programmers in trying to reduce long, failing execution traces to the cause of the error. We present a new algorithm for error cause localization ...
Manu Jose, Rupak Majumdar
FMCO
2008
Springer
117views Formal Methods» more  FMCO 2008»
13 years 7 months ago
Conformance Testing of Distributed Concurrent Systems with Executable Designs
Abstract. This paper presents a unified approach to test case generation and conformance test execution in a distributed setting. A model in the object-oriented, concurrent modelin...
Bernhard K. Aichernig, Andreas Griesmayer, Einar B...
NDSS
2008
IEEE
14 years 4 days 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...