Sciweavers

198 search results - page 2 / 40
» Modal Proofs as Distributed Programs (Extended Abstract)
Sort
View
PODC
1990
ACM
14 years 18 days ago
Half-Order Modal Logic: How to Prove Real-Time Properties
Abstract. We introduce a novel extension of propositional modal logic that is interpreted over Kripke structures in which a value is associated with every possible world. These val...
Thomas A. Henzinger
ENTCS
2007
102views more  ENTCS 2007»
13 years 8 months ago
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
Brigitte Pientka
CORR
2012
Springer
191views Education» more  CORR 2012»
12 years 4 months ago
The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract)
erate (Extended Abstract) Patrick Bindjeme1† and James Allen Fill1 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Bal...
Patrick Bindjeme, James Allen Fill
ENTCS
2010
130views more  ENTCS 2010»
13 years 6 months ago
Structural Operational Semantics and Modal Logic, Revisited
A previously introduced combination of the bialgebraic approach to structural operational semantics with aic modal logic is re-examined and improved in some aspects. Firstly, a mo...
Bartek Klin
FMCO
2004
Springer
157views Formal Methods» more  FMCO 2004»
14 years 1 months ago
MoMo: A Modal Logic for Reasoning About Mobility
Abstract. A temporal logic is proposed as a tool for specifying properties of Klaim programs. Klaim is an experimental programming language that supports a programming paradigm whe...
Rocco De Nicola, Michele Loreti