Sciweavers

551 search results - page 64 / 111
» Formalizing the Logic-Automaton Connection
Sort
View
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
15 years 3 months ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
DIGRA
2005
Springer
15 years 3 months ago
How Are Games Educational? Learning Theories Embodied in Games
Through the combined efforts of many dedicated researchers across the globe, the “message” of the value of games for learning is starting to be heard in formal education, but ...
Katrin Becker
FMCO
2005
Springer
15 years 3 months ago
A Software Component Model and Its Preliminary Formalisation
A software component model should define what components are, and how they can be composed. That is, it should define a theory of components and their composition. Current softwa...
Kung-Kiu Lau, Mario Ornaghi, Zheng Wang
FOSSACS
2005
Springer
15 years 3 months ago
Bridging Language-Based and Process Calculi Security
Language-based and process calculi-based information security are well developed fields of computer security. Although these fields have much in common, it is somewhat surprising...
Riccardo Focardi, Sabina Rossi, Andrei Sabelfeld
ICALP
2005
Springer
15 years 3 months ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...