Sciweavers

4257 search results - page 51 / 852
» The Logical Modularity of Programs
Sort
View
APLAS
2007
ACM
14 years 1 months ago
Adjunct Elimination in Context Logic for Trees
Abstract. We study adjunct-elimination results for Context Logic applied to trees, following previous results by Lozes for Separation Logic and Ambient Logic. In fact, it is not po...
Cristiano Calcagno, Thomas Dinsdale-Young, Philipp...
ICFP
2010
ACM
13 years 10 months ago
Higher-order representation of substructural logics
We present a technique for higher-order representation of substructural logics such as linear or modal logic. We show that such logics can be encoded in the (ordinary) Logical Fra...
Karl Crary
IPL
2006
120views more  IPL 2006»
13 years 9 months ago
Propositional dynamic logic of context-free programs and fixpoint logic with chop
This paper compares Propositional Dynamic Logic of Non-Regular Programs and Fixpoint Logic with Chop. It identifies a fragment of the latter which is equiexpressive to the former....
Martin Lange, Rafal Somla
RTSS
2009
IEEE
14 years 3 months ago
Distributed, Modular HTL
Abstract—The Hierarchical Timing Language (HTL) is a realtime coordination language for distributed control systems. HTL programs must be checked for well-formedness, race freedo...
Thomas A. Henzinger, Christoph M. Kirsch, Eduardo ...