Sciweavers

271 search results - page 4 / 55
» Logics from Galois connections
Sort
View
FOSSACS
2005
Springer
14 years 29 days ago
From Separation Logic to First-Order Logic
Separation logic is a spatial logic for reasoning locally about heap structures. A decidable fragment of its assertion language was presented in [1], based on a bounded model prope...
Cristiano Calcagno, Philippa Gardner, Matthew Hagu...
FOIKS
2008
Springer
13 years 9 months ago
Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arg...
Vasiliki Efstathiou, Anthony Hunter
AMAST
2006
Springer
13 years 11 months ago
Testing Semantics: Connecting Processes and Process Logics
We propose a methodology based on testing as a framework to capture the interactions of a machine represented in a denotational model and the data it manipulates. Using a duality t...
Dusko Pavlovic, Michael W. Mislove, James Worrell
CP
2010
Springer
13 years 5 months ago
The Lattice Structure of Sets of Surjective Hyper-Operations
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
Barnaby Martin
PODC
2012
ACM
11 years 9 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...