Sciweavers

Share
CSFW
2011
IEEE
7 years 3 months ago
Formal Analysis of Protocols Based on TPM State Registers
—We present a Horn-clause-based framework for analysing security protocols that use platform configuration registers (PCRs), which are registers for maintaining state inside the...
Stéphanie Delaune, Steve Kremer, Mark Dermo...
APLAS
2011
ACM
7 years 3 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
TCS
2010
8 years 1 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
CORR
2008
Springer
103views Education» more  CORR 2008»
8 years 3 months ago
Flatness of the Energy Landscape for Horn Clauses
Abstract The Little-Hopfield neural network programmed with Horn clauses is studied. We argue that the energy landscape of the system, corresponding to the inconsistency function f...
Saratha Sathasivam, Wan Ahmad Tajuddin Wan Abdulla...
ESOP
2008
Springer
8 years 5 months ago
Iterative Specialisation of Horn Clauses
Abstract. We present a generic algorithm for solving Horn clauses through iterative specialisation. The algorithm is generic in the sense that it can be instantiated with any decid...
Christoffer Rosenkilde Nielsen, Flemming Nielson, ...
BIRTHDAY
2006
Springer
8 years 7 months ago
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses
We consider secrecy problems for cryptographic protocols modeled using Horn clauses and present general classes of Horn clauses which can be efficiently decided. Besides simplifyin...
Helmut Seidl, Kumar Neeraj Verma
EPIA
1993
Springer
8 years 7 months ago
A Uniform Framework for Deductive Database Derivation Strategies
A uniform framework is presented to describe the most typical strategies that are used to compute answers to Deductive Databases. The framework is based on the definition of a ge...
Robert Demolombe
FOSSACS
1999
Springer
8 years 7 months ago
A Strong Logic Programming View for Static Embedded Implications
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
R. Arruabarrena, Paqui Lucio, Marisa Navarro
AIMSA
2000
Springer
8 years 7 months ago
Coverage-Based Semi-distance between Horn Clauses
In the present paper we use the approach of height functions to de ning a semi-distance measure between Horn clauses. This appraoch is already discussed elsewhere in the framework ...
Zdravko Markov, Ivo Marinchev
ESOP
2001
Springer
8 years 7 months ago
Control-Flow Analysis in Cubic Time
Abstract. It is well-known that context-independent control flow analysis can be performed in cubic time for functional and object-oriented languages. Yet recent applications of c...
Flemming Nielson, Helmut Seidl
books