Sciweavers

764 search results - page 108 / 153
» On the Expressibility of Stable Logic Programming
Sort
View
FOSSACS
2007
Springer
15 years 6 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
CCS
2005
ACM
15 years 5 months ago
The framework of selective interleaving functions and the modular assembly kit
The Framework of Selective Interleaving Functions and the Modular Assembly Kit for Security Properties both provide a basis for the uniform representation and formal analysis of n...
Heiko Mantel
APLAS
2004
ACM
15 years 5 months ago
Concurrency Combinators for Declarative Synchronization
Developing computer systems that are both concurrent and evolving is challenging. To guarantee consistent access to resources by concurrent software components, some synchronizatio...
Pawel T. Wojciechowski
EUROSYS
2007
ACM
15 years 3 months ago
Dynamic updates: another middleware service?
Middleware simplifies the construction of distributed applications. These applications typically require continuous uptime. The maintenance of distributed applications, though, im...
Susanne Cech Previtali
ENTCS
2010
130views more  ENTCS 2010»
14 years 12 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, ...