Sciweavers

442 search results - page 33 / 89
» Proof Abstraction for Imperative Languages
Sort
View
JOLLI
2010
106views more  JOLLI 2010»
13 years 7 months ago
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars
rder Abstract Categorial Grammars as Hyperedge Replacement Grammars Makoto Kanazawa National Institute of Informatics 2–1–2 Hitotsubashi, Chiyoda-ku, Tokyo, 101–8430, Japan A...
Makoto Kanazawa
ENTCS
2007
121views more  ENTCS 2007»
13 years 8 months ago
Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract)
ly positive maps (extended abstract) Peter Selinger 1 Department of Mathematics and Statistics Dalhousie University, Halifax, Nova Scotia, Canada Dagger compact closed categories ...
Peter Selinger
ESOP
2006
Springer
14 years 11 days ago
ILC: A Foundation for Automated Reasoning About Pointer Programs
This paper presents a new program logic designed for facilitating automated reasoning about pointer programs. The program logic is directly inspired by previous work by O'Hea...
Limin Jia, David Walker
TCS
2011
13 years 3 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
IFIP
2009
Springer
14 years 1 months ago
Secure Information Flow for Distributed Systems
We present an abstract language for distributed systems of processes with local memory and private communication channels. Communication between processes is done via messaging. Th...
Rafael Alpízar, Geoffrey Smith