1216 search results - page 48 / 244 » Hybrid type checking |
100
click to vote
ATVA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivate...
ACSD
2007
IEEE
15 years 1 months ago
2007
IEEE
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
107
click to vote
ECOOP
2010
Springer
15 years 1 months ago
2010
Springer
Developers using statically typed languages such as C and Java are increasingly having to interoperate with APIs and object models defined in dynamic languages. This impedance mis...
ECOOP
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We are interested in the class of systems for which the satisfaction of code dependencies is a dynamic process rather than one which is determined purely at load-time. Ex...
CSR
2010
Springer
15 years 3 months ago
2010
Springer
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of...