Sciweavers

1171 search results - page 103 / 235
» A Logical Language for Expressing Authorizations
Sort
View
POPL
2004
ACM
16 years 6 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
AAAI
1994
15 years 7 months ago
Reasoning about Priorities in Default Logic
In this paper we argue that for realistic applications involving default reasoning it is necessary to reason about the priorities of defaults. Existing approaches require the know...
Gerhard Brewka
TAP
2010
Springer
134views Hardware» more  TAP 2010»
15 years 4 months ago
Testing First-Order Logic Axioms in Program Verification
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
Ki Yung Ahn, Ewen Denney
RULEML
2004
Springer
15 years 11 months ago
A Defeasible Logic Reasoner for the Semantic Web
Abstract. Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology i...
Nick Bassiliades, Grigoris Antoniou, Ioannis P. Vl...
194
Voted
ESOP
2006
Springer
15 years 10 months ago
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
Amal J. Ahmed