Sciweavers

1809 search results - page 30 / 362
» Software Model Checking Using Linear Constraints
Sort
View
KBSE
2010
IEEE
13 years 6 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
CIKM
2008
Springer
13 years 9 months ago
Linear time membership in a class of regular expressions with interleaving and counting
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
CBSE
2009
Springer
14 years 2 months ago
Selecting Fault Tolerant Styles for Third-Party Components with Model Checking Support
To build highly available or reliable applications out of unreliable third-party components, some software-implemented fault-tolerant mechanisms are introduced to gracefully deal w...
Junguo Li, Xiangping Chen, Gang Huang, Hong Mei, F...
CAV
2001
Springer
119views Hardware» more  CAV 2001»
14 years 6 days ago
Certifying Model Checkers
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...
Kedar S. Namjoshi
NFM
2011
242views Formal Methods» more  NFM 2011»
13 years 2 months ago
Model Checking Using SMT and Theory of Lists
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
Aleksandar Milicevic, Hillel Kugler