ompact abstractions for processor pipelines∗ Sebastian Hahn, Jan Reineke Informatik, Saarland University Saarbr¨ucken Reinhard Wilhelm Informatik, Saarland University and AbsInt...
Sebastian Hahn 0001, Jan Reineke, Reinhard Wilhelm
We introduce a new class of succinct games, called weighted boolean formula games. Here, each player has a set of boolean formulas he wants to get satisfied. The boolean formulas...
Marios Mavronicolas, Burkhard Monien, Klaus W. Wag...
This paper defines the “ultimate” formal semantics for Alice and Bob notation, i.e., what actions the honest agents have to perform, in the presence of an arbitrary set of cry...
Abstract. The Helena approach allows to specify dynamically evolving ensembles of collaborating components. It is centered around the notion of roles which components can adopt in ...
This work studies the relationship between veriable and computable answers for reachability problems in rewrite theories with an underlying membership equational logic. These prob...