777 search results - page 64 / 156 » Model Checking with Formula-Dependent Abstract Models |
189
click to vote
ISOLA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Service-oriented systems have recently emerged as context-independent component-based systems. Unlike components, services can be created, invoked, composed, and destroye...
177
click to vote
VMCAI
2010
Springer
16 years 3 months ago
2010
Springer
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...
150
click to vote
ASPDAC
2008
ACM
15 years 7 months ago
2008
ACM
—In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...
211
click to vote
TACAS
2000
Springer
15 years 9 months ago
2000
Springer
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
174
click to vote
CAV
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. This paper develops a local reasoning method to check lineartime temporal properties of concurrent programs. In practice, it is often infeasible to model check over the p...