Sciweavers

100 search results - page 19 / 20
» A Schemata Calculus for Propositional Logic
Sort
View
178
Voted
POPL
2007
ACM
15 years 10 months ago
Logic-flow analysis of higher-order programs
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
Matthew Might
78
Voted
ESOP
2001
Springer
15 years 2 months ago
Proof-Directed De-compilation of Low-Level Code
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
Shin-ya Katsumata, Atsushi Ohori
115
Voted
NMR
2004
Springer
15 years 3 months ago
A probabilistic approach to default reasoning
A logic is defined which in addition to propositional calculus contains several types of probabilistic operators which are applied only to propositional formulas. For every s ∈...
Miodrag Raskovic, Zoran Ognjanovic, Zoran Markovic
82
Voted
BIRTHDAY
2005
Springer
15 years 3 months ago
Compiled Labelled Deductive Systems for Access Control
This paper proposes a Compiled Labelled Deductive System, called ACCLDS, for reasoning about role-based access control in distributed systems, which builds upon Massacci’s tablea...
Krysia Broda, Alessandra Russo
CEFP
2005
Springer
15 years 3 months ago
Exploiting Purely Functional Programming to Obtain Bounded Resource Behaviour: The Hume Approach
This chapter describes Hume: a functionally-based language for programming with bounded resource usage, including time and space properties. The purpose of the Hume language design...
Kevin Hammond