Sciweavers

509 search results - page 15 / 102
» On the completeness of compositional reasoning methods
Sort
View
ECCV
2010
Springer
14 years 21 days ago
Exploiting Repetitive Object Patterns for Model Compression and Completion
Many man-made and natural structures consist of similar elements arranged in regular patterns. In this paper we present an unsupervised approach for discovering and reasoning on re...
CSL
2006
Springer
14 years 13 days ago
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...
Alexander Moshe Rabinovich, Wolfgang Thomas
ESOP
2007
Springer
14 years 2 months ago
A Complete Guide to the Future
Abstract We present the semantics and proof system for an objectoriented language with active objects, asynchronous method calls, and futures. The language, based on Creol, disting...
Frank S. de Boer, Dave Clarke, Einar Broch Johnsen
AAAI
2011
12 years 8 months ago
Reasoning About General Games Described in GDL-II
Recently the general Game Description Language (GDL) has been extended so as to cover arbitrary games with incomplete/imperfect information. Learning—without human interventionâ...
Stephan Schiffel, Michael Thielscher
CAV
1998
Springer
147views Hardware» more  CAV 1998»
14 years 1 months ago
Verification of an Implementation of Tomasulo's Algorithm by Compositional Model Checking
An implementation of an out-of-order processing unit based on Tomasulo's algorithm is formally verified using compositional model checking techniques. This demonstrates that f...
Kenneth L. McMillan