Sciweavers

949 search results - page 153 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
ASM
2008
ASM
13 years 10 months ago
On the Purpose of Event-B Proof Obligations
Event-B is a formal modelling method which is claimed to be suitable for diverse modelling domains, such as reactive systems and sequential program development. This claim hinges o...
Stefan Hallerstede
IJKL
2007
90views more  IJKL 2007»
13 years 8 months ago
Semantics-supported cooperative learning for enhanced awareness
: Awareness is required for supporting all forms of cooperation. In Computer Supported Collaborative Learning (CSCL), awareness can be used for enhancing collaborative opportunitie...
César A. Collazos, Roberto Garcia
CG
2004
Springer
13 years 8 months ago
Recursive turtle programs and iterated affine transformations
We provide a formal proof of equivalence between the class of fractals created by Recursive Turtle Programs (RTP) and Iterated Affine Transformations (IAT). We begin by reviewing ...
Tao Ju, Scott Schaefer, Ron Goldman
FORMATS
2007
Springer
14 years 2 months ago
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Sergio Giro, Pedro R. D'Argenio
TLDI
2010
ACM
190views Formal Methods» more  TLDI 2010»
14 years 5 months ago
Distributed programming with distributed authorization
We propose a programming language, called PCML5, for building distributed applications with distributed access control. Target applications include web-based systems in which prog...
Kumar Avijit, Anupam Datta, Robert Harper