Sciweavers

551 search results - page 28 / 111
» {log}: A Logic Programming Language with Finite Sets
Sort
View
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 8 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
HASE
2007
IEEE
14 years 2 months ago
On the Verifiability of Programs Written in the Feature Language Extensions
High assurance in embedded system software is difficult to attain. Verification relies on testing. The unreliable and costly testing process is made much worse because the softwar...
Wu-Hon F. Leung
OOPSLA
2005
Springer
14 years 1 months ago
CodeQuest: querying source code with datalog
We describe CodeQuest, a system for querying source code. It combines two previous proposals, namely the use of logic programming and database system. Experiments (on projects ran...
Elnar Hajiyev, Mathieu Verbaere, Oege de Moor, Kri...
PLILP
1997
Springer
14 years 4 days ago
Narrowing the Narrowing Space
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...
Sergio Antoy, Zena M. Ariola
ECOOP
2009
Springer
14 years 8 months ago
Coinductive Type Systems for Object-Oriented Languages
We propose a novel approach based on coinductive logic to specify type systems of programming languages. The approach consists in encoding programs in Horn formulas which are inter...
Davide Ancona, Giovanni Lagorio