Sciweavers

592 search results - page 4 / 119
» Can Component Service-Based Systems Be Proved Correct
Sort
View
ZUM
2005
Springer
206views Formal Methods» more  ZUM 2005»
14 years 28 days ago
Component Reuse in B Using ACL2
Abstract. We present a new methodology that permits to reuse an existing hardware component that has not been developed within the B framework while maintaining a correct design ï¬...
Yann Zimmermann, Diana Toma
FROCOS
2005
Springer
14 years 29 days ago
ATS: A Language That Combines Programming with Theorem Proving
ATS is a language with a highly expressive type system that supports a restricted form of dependent types in which programs are not allowed to appear in type expressions. The langu...
Sa Cui, Kevin Donnelly, Hongwei Xi
AUSAI
2010
Springer
13 years 6 months ago
Pushing the Envelope: General Game Players Prove Theorems
A general game player is a system that can play previously unknown games given nothing but their rules. A key to success in this endeavour is the ability to automatically gain know...
Sebastian Haufe, Michael Thielscher
ICALP
2009
Springer
14 years 2 months ago
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
Abstract. We introduce a new theoretical model of ad hoc mobile computing in which agents have severely restricted memory, highly unpredictable movement and no initial knowledge of...
Rachid Guerraoui, Eric Ruppert
AIEDU
2005
83views more  AIEDU 2005»
13 years 7 months ago
A Simulated Student Can Improve Collaborative Learning
This paper describes a Simulated Student architecture designed to detect and avoid three situations that decrease the benefits of learning in collaboration. These are off-topic con...
Aurora Vizcaíno