Sciweavers

226 search results - page 34 / 46
» Extensional Theories and Rewriting
Sort
View
ENTCS
2006
113views more  ENTCS 2006»
13 years 7 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
LPAR
2005
Springer
14 years 1 months ago
Algebraic Intruder Deductions
Abstract. Many security protocols fundamentally depend on the algebraic properties of cryptographic operators. It is however difficult to handle these properties when formally anal...
David A. Basin, Sebastian Mödersheim, Luca Vi...
FSTTCS
1993
Springer
13 years 11 months ago
Higher-Order and Semantic Unification
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...
Nachum Dershowitz, Subrata Mitra
ATAL
2008
Springer
13 years 9 months ago
Model-checking agent refinement
We present a proof-technique for reducing the nondeterminbstract agent specifications in a BDI framework by means of refinement. We implement the operational semantics of agent sp...
Lacramioara Astefanoaei, Frank S. de Boer
DAGSTUHL
2001
13 years 9 months ago
A Language-Based Approach to Security
Abstract. Language-based security leverages program analysis and program rewriting to enforce security policies. The approach promises efficient enforcement of fine-grained access ...
Fred B. Schneider, J. Gregory Morrisett, Robert Ha...