451 search results - page 70 / 91 » Engineering Abstractions in Model Checking and Testing |
91
Voted
IJFCS
2006
15 years 13 days ago
2006
The outcome of verifying software is often a `counterexample', i.e., a listing of the actions and states of a behavior not satisfying the specification. In order to understan...
86
Voted
FOSSACS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. An extension of the λ-calculus is proposed, to study historybased access control. It allows for security policies with a possibly nested, local scope. We define a type ...
PUK
2000
15 years 1 months ago
2000
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
136
click to vote
PPOPP
2009
ACM
16 years 1 months ago
2009
ACM
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
103
Voted
ICFEM
2004
Springer
15 years 5 months ago
2004
Springer
d Abstract) Carsten Sinz and Wolfgang K¨uchlin Symbolic Computation Group, WSI for Computer Science, University of T¨ubingen and Steinbeis Technology Transfer Center OIT, 72076 T...