Sciweavers

3546 search results - page 641 / 710
» A Causal Logic of Logic Programming
Sort
View
CADE
2008
Springer
14 years 8 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
14 years 8 months ago
Solving Sparse Linear Constraints
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Shuvendu K. Lahiri, Madanlal Musuvathi
CADE
2006
Springer
14 years 8 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
14 years 8 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...
SIGMOD
2005
ACM
177views Database» more  SIGMOD 2005»
14 years 7 months ago
An approach for pipelining nested collections in scientific workflows
We describe an approach for pipelining nested data collections in scientific workflows. Our approach logically delimits arbitrarily nested collections of data tokens using special...
Timothy M. McPhillips, Shawn Bowers