5608 search results - page 403 / 1122 » On the Theory of Matchgate Computations |
166
click to vote
RP
2009
Springer
16 years 1 months ago
2009
Springer
We describe the class of games with opacity condition, as an adequate model for security aspects of computing systems. We study their theoretical properties, relate them to reachab...
174
click to vote
ICTAC
2004
Springer
16 years 8 days ago
2004
Springer
A model-based approach for minimization of test sets for interactive systems is introduced. Test cases are efficiently generated and selected to cover the behavioral model and the ...
168
click to vote
MFCS
2004
Springer
16 years 7 days ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
195
click to vote
ICALP
2003
Springer
16 years 3 days ago
2003
Springer
We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients. We give an lts based operational semantics, and a labelled bisimulation based equivalence that coincide...
189
click to vote
TPHOL
2002
IEEE
15 years 11 months ago
2002
IEEE
Based on an inductive definition of triangulations, a theory of undirected planar graphs is developed in Isabelle/HOL. The proof of the 5 colour theorem is discussed in some detai...