Event structures are fundamental models in concurrency theory, providing a representation of events in computation and of their relations, notably concurrency, conflict and causality. In this paper we present a theory...
详细信息
By developing a hierarchical modeling method, using discrete element analysis software PFC3D, a pile foundation model is built. According to the idea of finite element method, using smaller particles for concerned par...
详细信息
the proceedings contain 38 papers. the special focus in this conference is on Semantics of Programming Languages, Categorical Models, Temporal Logics and Timed Systems. the topics include: Synthesis of strategies and ...
ISBN:
(纸本)9783662466773
the proceedings contain 38 papers. the special focus in this conference is on Semantics of Programming Languages, Categorical Models, Temporal Logics and Timed Systems. the topics include: Synthesis of strategies and the Hoare logic of angelic nondeterminism;game semantics and normalization by evaluation;a categorical semantics for linear logical frameworks;coalgebraic trace semantics via forgetful logics;on the total variation distance of semi-Markov chains;decidable and expressive classes of probabilistic automata;compositional metric reasoning with probabilistic process calculi;fragments of ml decidable by nested data class memory automata;step-indexed logical relations for probability;robust multidimensional mean-payoff games are undecidable;three variables suffice for real-time logic;on presburger arithmetic extended with modulo counting quantifiers;programming and reasoning with guarded recursion for coinductive types;the computational contents of ramified corecurrence and on the mints hierarchy in first-order intuitionistic logic.
A palindrome is a string that reads the same as its reverse, such as "aibohphobia" (fear of palindromes). Given a metric and an integer d > 0, a d-near-palindrome is a string of Hamming distance at most d...
详细信息
the proceedings contain 29 papers. the topics discussed include: analysis of probabilistic basic parallel processes;type reconstruction for the linear π-calculus with composite and equi-recursive types;a semantical a...
ISBN:
(纸本)9783642548291
the proceedings contain 29 papers. the topics discussed include: analysis of probabilistic basic parallel processes;type reconstruction for the linear π-calculus with composite and equi-recursive types;a semantical and operational account of call-by-value solvability;network-formation games with regular objectives;playing with probabilities in reconfigurable broadcast networks;unsafe order-2 tree languages are context-sensitive;complexity of model-checking call-by-value programs;resource reachability games on pushdown graphs;the complexity of partial-observation stochastic parity games with finite-memory strategies;on negotiation as concurrency primitive II: deterministic cyclic negotiations;on asymmetric unification and the combination problem in disjoint theories;axiomatizing bisimulation equivalences and metrics from probabilistic SOS rules;generalized Eilenberg theorem I: local varieties of languages;and combining bialgebraic semantics and equations.
Secure multiparty computation enables protocol participants to compute the output of a public function of their private inputs whilst protecting the confidentiality of their inputs. But such an output, as a function o...
详细信息
ISBN:
(纸本)9783662544556;9783662544549
Secure multiparty computation enables protocol participants to compute the output of a public function of their private inputs whilst protecting the confidentiality of their inputs. But such an output, as a function of its inputs, inevitably leaks some information about input values regardless of the protocol used to compute it. We introduce foundations for quantifying and understanding how such leakage may influence input behaviour of deceitful protocol participants as well as that of participants they target. Our model captures the beliefs and knowledge that participants have about what input values other participants may choose. In this model, measures of information flow that may arise between protocol participants are introduced, formally investigated, and experimentally evaluated. these information-theoretic measures not only suggest advantageous input behaviour to deceitful participants for optimal updates of their beliefs about chosen inputs of targeted participants. they also allow targets to quantify the information-flow risk of their input choices. We show that this approach supports a game-theoretic formulation in which deceitful attackers wish to maximise the information that they gain on inputs of targets once the computation output is known, whereas the targets wish to protect the privacy of their inputs.
foundations of softwarescience and computationstructures : Second internationalconference, Fossacs '99 Held as Part of the Joint European conferences on theory and Practice of software, Etaps '99, Amsterdam...
详细信息
foundations of softwarescience and computationstructures : Second internationalconference, Fossacs '99 Held as Part of the Joint European conferences on theory and Practice of software, Etaps '99, Amsterdam, the Netherlands, March 22-28, 1999 : Proceedings by Fossacs '99 (1999 : Amsterdam, Netherlands); thomas, Wolfgang, 1947-; international Joint conference on theory; Practice of software Development (9th : 1999 : Amsterdam, Netherlands); published by Berlin ; New York : Springer
We show that any one-counter automaton with n states, if its language is non-empty, accepts some word of length at most O(n(2)). this closes the gap between the previously known upper bound of O(n(3)) and lower bound ...
详细信息
ISBN:
(纸本)9783662496305;9783662496299
We show that any one-counter automaton with n states, if its language is non-empty, accepts some word of length at most O(n(2)). this closes the gap between the previously known upper bound of O(n(3)) and lower bound of Omega(n(2)). More generally, we prove a tight upper bound on the length of shortest paths between arbitrary configurations in one-counter transition systems (weaker bounds have previously appeared in the literature).
We present a theory for slicing probabilistic imperative programs-containing random assignment and "observe" statements-represented as control flow graphs whose nodes transform probability distributions. We ...
详细信息
ISBN:
(纸本)9783662496305;9783662496299
We present a theory for slicing probabilistic imperative programs-containing random assignment and "observe" statements-represented as control flow graphs whose nodes transform probability distributions. We show that such a representation allows direct adaptation of standard machinery such as data and control dependence, postdominators, relevant variables, etc. to the probabilistic setting. We separate the specification of slicing from its implementation: first we develop syntactic conditions that a slice must satisfy;next we prove that any such slice is semantically correct;finally we give an algorithm to compute the least slice. A key feature of our syntactic conditions is that they involve two disjoint slices such that the variables of one slice are probabilistically independent of the variables of the other. this leads directly to a proof of correctness of probabilistic slicing.
暂无评论