Sciweavers

130 search results - page 17 / 26
» Verified Software: Theories, Tools, Experiments
Sort
View
ICST
2010
IEEE
13 years 6 months ago
When BDDs Fail: Conformance Testing with Symbolic Execution and SMT Solving
—Model-based testing is a well known technique that allows one to validate the correctness of software with respect to its model. If a lot of data is involved, symbolic technique...
Elisabeth Jöbstl, Martin Weiglhofer, Bernhard...
ARCS
2009
Springer
14 years 2 months ago
Evaluating Sampling Based Hotspot Detection
In sampling based hotspot detection, performance engineers sample the running program periodically and record the Instruction Pointer (IP) addresses at the sampling. Empirically, f...
Qiang Wu, Oskar Mencer
CODES
2007
IEEE
13 years 11 months ago
Pointer re-coding for creating definitive MPSoC models
Today's MPSoC synthesis and exploration design flows start abstract input specification model captured in a system level design language. Usually this model is created from a...
Pramod Chandraiah, Rainer Dömer
AMAST
2008
Springer
13 years 9 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
SIGSOFT
2004
ACM
14 years 8 months ago
Heuristic-guided counterexample search in FLAVERS
One of the benefits of finite-state verification (FSV) tools, such as model checkers, is that a counterexample is provided when the property cannot be verified. Not all counterexa...
Jianbin Tan, George S. Avrunin, Lori A. Clarke, Sh...