Sciweavers

456 search results - page 32 / 92
» A Proof System for Abstract Non-interference
Sort
View
ESOP
2005
Springer
14 years 2 months ago
A Type System Equivalent to a Model Checker
ite-state abstraction scheme such as predicate abstraction. The type system, which is also parametric, type checks exactly those programs that are accepted by the model checker. It...
Mayur Naik, Jens Palsberg
ESWS
2007
Springer
14 years 2 months ago
Minimal Deductive Systems for RDF
Abstract. This paper presents a minimalist program for RDF, by showing how one can do without several predicates and keywords of the RDF Schema vocabulary, obtaining a simpler lang...
Sergio Muñoz, Jorge Pérez, Claudio G...
LICS
1991
IEEE
14 years 4 days ago
Higher-Order Critical Pairs
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
Tobias Nipkow
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 8 months ago
Definitions by Rewriting in the Calculus of Constructions
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...
Frédéric Blanqui
IANDC
2010
102views more  IANDC 2010»
13 years 7 months ago
Presenting functors on many-sorted varieties and applications
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of th...
Alexander Kurz, Daniela Petrisan