Sciweavers

57 search results - page 7 / 12
» Specialising Logic Programs with Respect to Call
Sort
View
FAC
2000
94views more  FAC 2000»
13 years 6 months ago
Maximally Concurrent Programs
Typically, program design involves constructing a program P that implements a given specification S; that is, the set P of executions of P is a subset of the set S of executions s...
Rajeev Joshi, Jayadev Misra
ILP
2003
Springer
13 years 12 months ago
Hybrid Abductive Inductive Learning: A Generalisation of Progol
The learning system Progol5 and the underlying inference method of Bottom Generalisation are firmly established within Inductive Logic Programming (ILP). But despite their success...
Oliver Ray, Krysia Broda, Alessandra Russo
WDAG
2007
Springer
132views Algorithms» more  WDAG 2007»
14 years 24 days ago
Detecting Temporal Logic Predicates on Distributed Computations
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
Vinit A. Ogale, Vijay K. Garg
EPIA
2003
Springer
13 years 12 months ago
jcc: Integrating Timed Default Concurrent Constraint Programming into Java
Abstract. This paper describes jcc, an integration of the timed default concurrent constraint programming framework [16] (Timed Default cc) into JAVA [7]. jcc is intended for use i...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
ENTCS
2010
130views more  ENTCS 2010»
13 years 6 months ago
Compositional System Security with Interface-Confined Adversaries
This paper presents a formal framework for compositional reasoning about secure systems. A key insight is to view a trusted system in terms of the interfaces that the various comp...
Deepak Garg, Jason Franklin, Dilsun Kirli Kaynar, ...