Sciweavers

22 search results - page 3 / 5
» Substitution for Fraenkel-Mostowski foundations
Sort
View
SOSYM
2008
90views more  SOSYM 2008»
13 years 5 months ago
A metamodeling language supporting subset and union properties
Abstract. The Meta Object Facility (MOF) 2.0 and the Unified Modeling Language Infrastructure introduce new language features such as subsets, (derived) unions and redefinitions, b...
Marcus Alanen, Ivan Porres
ICFP
2005
ACM
14 years 5 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
CSFW
2007
IEEE
13 years 11 months ago
Compositional Security for Task-PIOAs
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
TYPES
1994
Springer
13 years 9 months ago
A Concrete Final Coalgebra Theorem for ZF Set Theory
A special final coalgebra theorem, in the style of Aczel's [2], is proved within standard Zermelo-Fraenkel set theory. Aczel's AntiFoundation Axiom is replaced by a varia...
Lawrence C. Paulson
JAPLL
2010
141views more  JAPLL 2010»
13 years 3 months ago
Algebraic tableau reasoning for the description logic SHOQ
Semantic web applications based on the web ontology language (OWL) often require the use of numbers in class descriptions for expressing cardinality restrictions on properties or ...
Jocelyne Faddoul, Volker Haarslev