Sciweavers

2137 search results - page 151 / 428
» Proving Abstract Non-interference
Sort
View
JAR
2007
123views more  JAR 2007»
15 years 3 months ago
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts
Abstract. We illustrate a methodology for formalizing and reasoning about Abadi and Cardelli’s object-based calculi, in (co)inductive type theory, such as the Calculus of (Co)Ind...
Alberto Ciaffaglione, Luigi Liquori, Marino Micula...
106
Voted
ACTA
2004
86views more  ACTA 2004»
15 years 3 months ago
Specification transformers: a predicate transformer approach to composition
Abstract. This paper explores theories that help in (i) proving that a system composed from components satisfies a system specification given only specifications of components and ...
Michel Charpentier, K. Mani Chandy
COMPLEXITY
2004
108views more  COMPLEXITY 2004»
15 years 2 months ago
On the convergence of a factorized distribution algorithm with truncation selection
nical Abstract Optimization is to find the "best" solution to a problem where the quality of a solution can be measured by a given criterion. Estimation of Distribution A...
Qingfu Zhang
FAC
2000
124views more  FAC 2000»
15 years 2 months ago
Algebraic Models of Correctness for Microprocessors
In this paper we present a method of describing microprocessors at different levels of temporal and data abstraction. We consider microprogrammed, pipelined and superscalar proces...
Anthony C. J. Fox, Neal A. Harman
PLDI
2012
ACM
13 years 5 months ago
Design and implementation of sparse global analyses for C-like languages
In this article we present a general method for achieving global static analyzers that are precise, sound, yet also scalable. Our method generalizes the sparse analysis techniques...
Hakjoo Oh, Kihong Heo, Wonchan Lee, Woosuk Lee, Kw...