3342 search results - page 369 / 669 » Automating Abstract Interpretation |
142
click to vote
LPAR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Many security protocols fundamentally depend on the algebraic properties of cryptographic operators. It is however difficult to handle these properties when formally anal...
133
click to vote
LPAR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The paper describes the formalization and implementation of an efficient constraint programming framework operating on 3D crystal lattices. The framework is motivated an...
145
click to vote
LPNMR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The rapid expansion of the Internet and World Wide Web led to growing interest in data and information integration, which should be capable to deal with inconsistent and ...
135
click to vote
LPNMR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...
136
click to vote
LPNMR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...