Sciweavers

207 search results - page 21 / 42
» Proof Systems and Transformation Games
Sort
View
CADE
2006
Springer
15 years 10 months ago
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicati...
Roy Dyckhoff, Delia Kesner, Stéphane Lengra...
FM
2003
Springer
107views Formal Methods» more  FM 2003»
15 years 2 months ago
A Formal Framework for Modular Synchronous System Design
We present the formal framework for a novel approach for specifying and automatically implementing systems such as digital circuits and network protocols. The goal is to reduce the...
Maria-Cristina V. Marinescu, Martin C. Rinard
81
Voted
JLP
2010
142views more  JLP 2010»
14 years 4 months ago
Relational bytecode correlations
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...
Lennart Beringer
ICASSP
2011
IEEE
14 years 1 months ago
Quadrature approximation properties of the spiral-phase quadrature transform
The notion of the 1-D analytic signal is well understood and has found many applications. At the heart of the analytic signal concept is the Hilbert transform. The problem in exte...
Haricharan Aragonda, Chandra Sekhar Seelamantula
CC
2010
Springer
172views System Software» more  CC 2010»
15 years 4 months ago
Verifying Local Transformations on Relaxed Memory Models
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
Sebastian Burckhardt, Madanlal Musuvathi, Vasu Sin...