Sciweavers

4513 search results - page 838 / 903
» Logic programming with satisfiability
Sort
View
CADE
2009
Springer
16 years 2 months ago
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
Albert Rubio, Cristina Borralleras, Enric Rodr&iac...
HPCA
2001
IEEE
16 years 1 months ago
An Architectural Evaluation of Java TPC-W
The use of the Java programming language for implementing server-side application logic is increasing in popularity, yet there is very little known about the architectural require...
Harold W. Cain, Ravi Rajwar, Morris Marden, Mikko ...
89
Voted
CADE
2008
Springer
16 years 1 months ago
Proving Group Protocols Secure Against Eavesdroppers
Security protocols are small programs designed to ensure properties such as secrecy of messages or authentication of parties in a hostile environment. In this paper we investigate ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
CADE
2006
Springer
16 years 1 months ago
Stratified Context Unification Is NP-Complete
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
ICALP
2009
Springer
16 years 1 months ago
High Complexity Tilings with Sparse Errors
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...