Sciweavers

844 search results - page 147 / 169
» Safraless Decision Procedures
Sort
View
CORR
2006
Springer
82views Education» more  CORR 2006»
13 years 8 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...
ENTCS
2007
141views more  ENTCS 2007»
13 years 8 months ago
Compressing BMC Encodings with QBF
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
Toni Jussila, Armin Biere
ENTCS
2007
158views more  ENTCS 2007»
13 years 8 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
JSAC
2006
108views more  JSAC 2006»
13 years 8 months ago
Distributed Nonlinear Integer Optimization for Data-Optical Internetworking
Abstract--We present a novel approach for joint optical network provisioning and Internet protocol (IP) traffic engineering, in which the IP and optical networks collaboratively op...
Anwar Elwalid, Debasis Mitra, Qiong Wang
EOR
2007
101views more  EOR 2007»
13 years 8 months ago
Using aggregation to optimize long-term production planning at an underground mine
Motivated by an underground mining operation at Kiruna, Sweden, we formulate a mixed integer program to schedule iron ore production over multiple time periods. Our optimization m...
Alexandra M. Newman, Mark Kuchta