Sciweavers

584 search results - page 85 / 117
» Logic Programs as term Rewriting Systems
Sort
View
ICFP
2003
ACM
15 years 9 months ago
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
Michael Norrish
75
Voted
ATAL
2006
Springer
15 years 1 months ago
Run-time model checking of interaction and deontic models for multi-agent systems
This paper is concerned with the problem of obtaining predictable interactions between groups of agents in open environments when individual agents do not expose their bdi logic. ...
Nardine Osman, David Robertson, Christopher Walton
POPL
2010
ACM
15 years 7 months ago
Toward a Verified Relational Database Management System
We report on our experience implementing a lightweight, fully verified relational database management system (RDBMS). The functional specification of RDBMS behavior, RDBMS impleme...
Avraham Shinnar, Greg Morrisett, J. Gregory Malech...
ILP
2007
Springer
15 years 3 months ago
ILP : - Just Trie It
Abstract. Despite the considerable success of Inductive Logic Programming, deployed ILP systems still have efficiency problems when applied to complex problems. Several techniques ...
Rui Camacho, Nuno A. Fonseca, Ricardo Rocha, V&iac...
CCS
2005
ACM
15 years 3 months ago
Formal security analysis of basic network-attached storage
We study formal security properties of network-attached storage (NAS) in an applied pi calculus. We model NAS as an implementation of a specification based on traditional central...
Avik Chaudhuri, Martín Abadi