Sciweavers

2137 search results - page 58 / 428
» Proving Abstract Non-interference
Sort
View
MKM
2007
Springer
15 years 4 months ago
Context Aware Calculation and Deduction
We address some aspects of a proposed system architecture for mathematical assistants, integrating calculations and deductions by common infrastructure within the Isabelle theorem ...
Amine Chaieb, Makarius Wenzel
ASM
2004
ASM
15 years 3 months ago
An ASM Semantics for SSA Intermediate Representations
Abstract. Static single assignment (SSA) form is the intermediate representation of choice in modern optimizing compilers for which no formal semantics has been stated yet. To prov...
Sabine Glesner
POPL
2000
ACM
15 years 2 months ago
(Optimal) Duplication is not Elementary Recursive
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
Andrea Asperti, Paolo Coppola, Simone Martini
CSFW
2007
IEEE
15 years 1 months ago
Automaton-based Confidentiality Monitoring of Concurrent Programs
Noninterference is typically used as a baseline security policy to formalize confidentiality of secret information manipulated by a program. In contrast to static checking of noni...
Gurvan Le Guernic
ICFP
2001
ACM
15 years 10 months ago
A Simple Implementation Technique for Priority Search Queues
This paper presents a new implementation technique for priority search queues. This abstract data type is an amazing blend of finite maps and priority queues. Our implementation s...
Ralf Hinze