Sciweavers

258 search results - page 17 / 52
» Proof Styles in Operational Semantics
Sort
View
TPHOL
2002
IEEE
14 years 12 days ago
Weakest Precondition for General Recursive Programs Formalized in Coq
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu
AML
2002
131views more  AML 2002»
13 years 7 months ago
Fuzzy logic, continuity and effectiveness
Abstract. It is shown the complete equivalence between the theory of continuous (enumeration) fuzzy closure operators and the theory of (effective) fuzzy deduction systems in Hilbe...
Loredana Biacino, Giangiacomo Gerla
COMPASS
1994
13 years 11 months ago
Types, Subtypes, and ASL+
ASL+ is a formalism for speci cation and programming in-the-large, based on an arbitrary institution. It has rules for proving the satisfaction and re nement of speci cations, whic...
David Aspinall
POPL
2007
ACM
14 years 7 months ago
Towards a mechanized metatheory of standard ML
We present an internal language with equivalent expressive power to Standard ML, and discuss its formalization in LF and the machine-checked verification of its type safety in Twe...
Daniel K. Lee, Karl Crary, Robert Harper
CORR
2010
Springer
165views Education» more  CORR 2010»
13 years 7 months ago
Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
Rajeev Goré, Linda Postniece, Alwen Tiu