Sciweavers

455 search results - page 66 / 91
» The Linear Logical Abstract Machine
Sort
View
PODC
2003
ACM
15 years 2 months ago
A lattice-theoretic characterization of safety and liveness
The distinction between safety and liveness properties is due to Lamport who gave the following informal characterization. Safety properties assert that nothing bad ever happens w...
Panagiotis Manolios, Richard J. Trefler
POPL
2010
ACM
15 years 7 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
FOSSACS
2005
Springer
15 years 3 months ago
Mathematical Models of Computational and Combinatorial Structures
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
Marcelo P. Fiore
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
ASPDAC
2000
ACM
95views Hardware» more  ASPDAC 2000»
15 years 2 months ago
FSM decomposition by direct circuit manipulation applied to low power design
Abstract— Clock-gating techniques are very effective in the reduction of the switching activity in sequential logic circuits. In particular, recent work has shown that significa...
José C. Monteiro, Arlindo L. Oliveira