Sciweavers

590 search results - page 9 / 118
» Non-Failure Analysis for Logic Programs
Sort
View
PEPM
2009
ACM
14 years 4 months ago
Linear logical approximations
ract interpretation of programs relates the exact semantics of a programming language to an approximate semantics that can be effectively computed. We show that, by specifying ope...
Robert J. Simmons, Frank Pfenning
ICLP
2009
Springer
14 years 8 months ago
Merging Logic Programs under Answer Set Semantics
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
James P. Delgrande, Torsten Schaub, Hans Tompits, ...
SPC
2005
Springer
14 years 29 days ago
A Theorem Proving Approach to Analysis of Secure Information Flow
Abstract. Most attempts at analysing secure information flow in programs are based on domain-specific logics. Though computationally feahese approaches suffer from the need for ...
Ádám Darvas, Reiner Hähnle, Dav...

Book
604views
15 years 5 months ago
Prolog and Natural-Language Analysis
The book is an introduction to elementary computational linguistics from the point of view of logic programming.
Fernando C. N. Pereira and Stuart M. Shieber
SEFM
2005
IEEE
14 years 1 months ago
Description Logics for Shape Analysis
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
Lilia Georgieva, Patrick Maier