777 search results - page 138 / 156 » Model Checking with Formula-Dependent Abstract Models |
111
click to vote
TACAS
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
101
click to vote
EMSOFT
2011
Springer
13 years 9 months ago
2011
Springer
System specifications are often structured as collections of scenarios and use-cases that describe desired and forbidden sequences of events. A recently proposed behavioral progr...
FOSSACS
2003
Springer
15 years 3 months ago
2003
Springer
rized Verification by Probabilistic Abstraction . . . . . . . . . . . . . . . . 87 Tamarah Arons, Amir Pnueli, Lenore Zuck Genericity and the π-Calculus . . . . . . . . . . . . ....
GMP
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract. In isogeometric analysis (IGA for short) framework, computational domain is exactly described using the same representation as that employed in the CAD process. For a CAD...
POPL
1999
ACM
15 years 2 months ago
1999
ACM
Linking is a low-level task that is usually vaguely specified, if at all, by language definitions. However, the security of web browsers and other extensible systems depends cru...