Sciweavers

54 search results - page 7 / 11
» Topological Completeness for Higher-Order Logic
Sort
View
FLAIRS
2006
13 years 11 months ago
Reasoning about Knowledge and Continuity
The aim of this paper is to extend the modal logic of knowledge due to Moss and Parikh by state transformers arising, eg, from actions of agents. The peculiarity of Moss and Parik...
Bernhard Heinemann
DALT
2004
Springer
14 years 3 months ago
The Logic of Communication Graphs
In 1992, Moss and Parikh studied a bimodal logic of knowledge and effort called Topologic. In this current paper, Topologic is extended to the case of many agents who are assumed...
Eric Pacuit, Rohit Parikh
PERCOM
2008
ACM
14 years 9 months ago
Topology Formation in IEEE 802.15.4: Cluster-Tree Characterization
The IEEE 802.15.4 standard defines a set of procedures to set-up a Low-Rate Wireless Personal Area Network where nodes self-organize into a logical communication structure through ...
Francesca Cuomo, Sara Della Luna, Petia Todorova, ...
POPL
2006
ACM
14 years 10 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao
CADE
2002
Springer
14 years 10 months ago
Basic Syntactic Mutation
Modularity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 Michael Abbott, Neil Ghani, and Christoph L?uth Union of Equational Theo...
Christopher Lynch, Barbara Morawska