35 search results - page 6 / 7 » Program Analysis via Satisfiability Modulo Path Programs |
CADE
2002
Springer
14 years 6 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
SIAMREV
2010
13 years 1 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
ECOOP
2012
Springer
11 years 8 months ago
2012
Springer
Abstract. The Jetpack framework is Mozilla’s newly-introduced extension development technology. Motivated primarily by the need to improve how scriptable extensions (also called ...
STACS
2007
Springer
14 years 11 days ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
ICALP
1989
Springer
13 years 10 months ago
1989
Springer
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...