Sciweavers

2137 search results - page 25 / 428
» Proving Abstract Non-interference
Sort
View
TACS
1997
Springer
15 years 2 months ago
Optimal Representations of Polymorphic Types with Subtyping (Extended Abstract)
d Abstract) Alexander Aiken1 and Edward L. Wimmers2 and Jens Palsberg3 1 EECS Department, University of California at Berkeley, Berkeley, CA 94720-1776. 2 IBM Almaden Research Cent...
Alexander Aiken, Edward L. Wimmers, Jens Palsberg
FOCS
1990
IEEE
15 years 2 months ago
Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract)
d abstract) Noga Alon IBM Almaden Research Center, San Jose, CA 95120 and Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel Moni Naor IBM Almaden Research Ce...
Noga Alon, Moni Naor
ENTCS
2007
158views more  ENTCS 2007»
14 years 10 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
RSP
1999
IEEE
160views Control Systems» more  RSP 1999»
15 years 2 months ago
Mixed Abstraction Level Hardware Synthesis from SDL for Rapid Prototyping
SDL is currently gaining interest as a system level specification language for HW/SW codesign. Automated synthesis of SDL in hardware so far had problems with its efficiency. The ...
Oliver Bringmann, Wolfgang Rosenstiel, Annette Mut...
DLT
2009
14 years 7 months ago
On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
Aleksi Saarela