4447 search results - page 603 / 890 » Model Checking Games |
184
click to vote
COMPULOG
1999
Springer
15 years 11 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
172
click to vote
VLDB
1998
ACM
15 years 11 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
233
click to vote
CAV
1994
Springer
15 years 10 months ago
1994
Springer
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a...
188
click to vote
POPL
1990
ACM
15 years 10 months ago
1990
ACM
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
205
click to vote
CSFW
2009
IEEE
15 years 10 months ago
2009
IEEE
We present the design and implementation of a compiler that, given high-level multiparty session descriptions, generates custom cryptographic protocols. Our sessions specify pre-a...