Sciweavers

935 search results - page 117 / 187
» From Logic Programming Towards Multi-Agent Systems
Sort
View
PPDP
2009
Springer
14 years 2 months ago
Context-based proofs of termination for typed delimited-control operators
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
Malgorzata Biernacka, Dariusz Biernacki
OOPSLA
2005
Springer
14 years 3 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...
SIGSOFT
2003
ACM
14 years 10 months ago
Towards scalable compositional analysis by refactoring design models
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
Yung-Pin Cheng, Michal Young, Che-Ling Huang, Chia...
IRES
2002
63views more  IRES 2002»
13 years 9 months ago
The Semantic Web, universalist ambition and some lessons from librarianship
Building the semantic web encounters problems similar to building large bibliographic systems. The experience of librarianship in controlling large, heterogeneous collections of b...
Terrence A. Brooks
CSFW
2007
IEEE
14 years 4 months ago
Do As I SaY! Programmatic Access Control with Explicit Identities
We address the programmatic realization of the access control model of security in distributed systems. Our aim is e the gap between abstract/declarative policies and their concre...
Andrew Cirillo, Radha Jagadeesan, Corin Pitcher, J...