Sciweavers

756 search results - page 62 / 152
» Using Logic Programs to Reason about Infinite Sets
Sort
View
ENTCS
2010
130views more  ENTCS 2010»
14 years 9 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, ...
POPL
2006
ACM
15 years 10 months ago
A logic for information flow in object-oriented programs
This paper specifies, via a Hoare-like logic, an interprocedural and flow sensitive (but termination insensitive) information flow analysis for object-oriented programs. Pointer a...
Torben Amtoft, Sruthi Bandhakavi, Anindya Banerjee
CORR
2000
Springer
132views Education» more  CORR 2000»
14 years 9 months ago
Declarative Representation of Revision Strategies
Abstract. We introduce a nonmonotonic framework for belief revision in which reasoning about the reliability of different pieces of information based on meta-knowledge about the in...
Gerhard Brewka
JACM
2010
137views more  JACM 2010»
14 years 8 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati
CSL
2004
Springer
15 years 3 months ago
Set Constraints on Regular Terms
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
Pawel Rychlikowski, Tomasz Truderung