Sciweavers

630 search results - page 111 / 126
» Symbolic Domain Decomposition
Sort
View
SPIN
2010
Springer
13 years 6 months ago
Experimental Comparison of Concolic and Random Testing for Java Card Applets
Concolic testing is a method for test input generation where a given program is executed both concretely and symbolically at the same time. This paper introduces the LIME Concolic ...
Kari Kähkönen, Roland Kindermann, Keijo ...
TSE
2010
161views more  TSE 2010»
13 years 6 months ago
Finding Bugs in Web Applications Using Dynamic Test Generation and Explicit-State Model Checking
— Web script crashes and malformed dynamically-generated web pages are common errors, and they seriously impact the usability of web applications. Current tools for web-page vali...
Shay Artzi, Adam Kiezun, Julian Dolby, Frank Tip, ...
ICST
2009
IEEE
13 years 6 months ago
Proving Functional Equivalence of Two AES Implementations Using Bounded Model Checking
Bounded model checking--as well as symbolic equivalence checking--are highly successful techniques in the hardware domain. Recently, bit-vector bounded model checkers like CBMC ha...
Hendrik Post, Carsten Sinz
CORR
2011
Springer
160views Education» more  CORR 2011»
13 years 6 days ago
Compositional Model Repositories via Dynamic Constraint Satisfaction with Order-of-Magnitude Preferences
The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mecha...
Jeroen Keppens, Qiang Shen
AISC
1998
Springer
14 years 21 days ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson