135 search results - page 10 / 27 » Structure-aware computation of predicate abstraction |
111
click to vote
ENTCS
2007
15 years 1 months ago
2007
ly positive maps (extended abstract) Peter Selinger 1 Department of Mathematics and Statistics Dalhousie University, Halifax, Nova Scotia, Canada Dagger compact closed categories ...
102
click to vote
KSEM
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Description logics (DLs) are a well-known family of knowledge representation (KR) languages. The notation of DLs has the style of a variable-free first order predicate l...
125
click to vote
TCC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
105
click to vote
CAV
2004
Springer
15 years 6 months ago
2004
Springer
Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, Tom´aˇs Voj...
122
click to vote
VMCAI
2010
Springer
15 years 10 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...