Sciweavers

518 search results - page 48 / 104
» Automating Proofs in Category Theory
Sort
View
FOSSACS
2004
Springer
15 years 5 months ago
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
Hartmut Ehrig, Barbara König
POPL
2010
ACM
15 years 9 months ago
Pure Subtype Systems
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
DeLesley S. Hutchins
PODC
2009
ACM
16 years 11 days ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch
CCS
2005
ACM
15 years 5 months ago
PeerAccess: a logic for distributed authorization
This paper introduces the PeerAccess framework for reasoning about authorization in open distributed systems, and shows how a parameterization of the framework can be used to reas...
Marianne Winslett, Charles C. Zhang, Piero A. Bona...
POPL
2012
ACM
13 years 7 months ago
Probabilistic relational reasoning for differential privacy
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential priva...
Gilles Barthe, Boris Köpf, Federico Olmedo, S...