440 search results - page 46 / 88 » Predicate Abstraction with Indexed Predicates |
167
click to vote
CRYPTO
2012
Springer
13 years 7 months ago
2012
Springer
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
165
click to vote
ICLP
1997
Springer
15 years 9 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
147
click to vote
ETRICS
2006
15 years 8 months ago
2006
Abstract. Formal methods emphasizes the need for a top-down approach when developing large reliable software systems. Refinements are map step by step abstract algebraic specificat...
144
click to vote
CAV
2004
Springer
15 years 10 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...
142
click to vote
VMCAI
2010
Springer
16 years 2 months ago
2010
Springer
Shape analyses (Chase et al. 1990, Sagiv et al. 2002) discover properties of dynamic and/or mutable structures. We ask, "Is there an equivalent to shape analysis for purely fu...