288 search results - page 33 / 58 » Interactive Termination Proofs Using Termination Cores |
162
click to vote
ACMACE
2007
ACM
15 years 10 months ago
2007
ACM
Augmented Reality (AR) in multimedia gaming is a dynamic and exciting field of research. One of the challenges is to have multiple users interacting in the networked augmented rea...
175
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...
159
click to vote
CHI
2009
ACM
16 years 29 days ago
2009
ACM
Authentication in public spaces is a risky task. Frauds on cash machines (ATMs) are not uncommon nowadays. The biggest group of attacks is observation attacks, which focus on reco...
167
click to vote
SOFSEM
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
168
click to vote
FASE
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...