Sciweavers

1691 search results - page 118 / 339
» Restricted subset selection
Sort
View
TACAS
1997
Springer
146views Algorithms» more  TACAS 1997»
14 years 2 months ago
Compositional State Space Generation from Lotos Programs
This paper describes a compositional approach to generate the labeled transition system representing the behavior of a Lotos program by repeatedly alternating composition and reduc...
Jean-Pierre Krimm, Laurent Mounier
VLDB
1989
ACM
155views Database» more  VLDB 1989»
14 years 2 months ago
Parallel Processing of Recursive Queries in Distributed Architectures
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...
Guy Hulin
CAISE
2007
Springer
14 years 2 months ago
Formalization and Verification of EPCs with OR-Joins Based on State and Context
The semantics of the OR-join in business process modeling languages like EPCs or YAWL have been discussed for a while. Still, the existing solutions suffer from at least one of two...
Jan Mendling, Wil M. P. van der Aalst
ITP
2010
164views Mathematics» more  ITP 2010»
14 years 2 months ago
Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder
Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based first-order relational model finder. Nitpick supports unbounded quantification, (co)ind...
Jasmin Christian Blanchette, Tobias Nipkow
CRYPTO
2004
Springer
97views Cryptology» more  CRYPTO 2004»
14 years 1 months ago
Efficient Tree-Based Revocation in Groups of Low-State Devices
Abstract. We study the problem of broadcasting confidential information to a collection of n devices while providing the ability to revoke an arbitrary subset of those devices (and...
Michael T. Goodrich, Jonathan Z. Sun, Roberto Tama...