Sciweavers

949 search results - page 85 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
KBSE
2000
IEEE
14 years 3 days ago
Circular Coinductive Rewriting
Circular coinductive rewriting is a new method for proving behavioral properties, that combines behavioral rewriting with circular coinduction. This method is implemented in our n...
Joseph A. Goguen, Kai Lin, Grigore Rosu
RSP
2003
IEEE
169views Control Systems» more  RSP 2003»
14 years 1 months ago
Rapid Prototyping and Incremental Evolution Using SLAM
The paper shows the outlines of the SLAM system and how its design is suitable for automating rapid prototyping. The system includes a very expressive object oriented specificati...
Ángel Herranz-Nieva, Juan José Moren...
FMICS
2009
Springer
14 years 2 months ago
A Rigorous Methodology for Composing Services
on Abstraction: a Lightweight Approach to Modelling Concurrency. Javier de Dios and Ricardo Peña Certified Implementation on top of the Java Virtual Machine 19:00 Social dinner + ...
Kenneth J. Turner, Koon Leai Larry Tan
ICCS
2007
Springer
14 years 1 months ago
Equivalent Semantic Translation from Parallel DEVS Models to Time Automata
Dynamic reconfigurable simulation based on Discrete Event System Specification (DEVS) requires efficient verification of simulation models. Traditional verification method of DEVS ...
Shoupeng Han, Kedi Huang
DBSEC
1996
125views Database» more  DBSEC 1996»
13 years 9 months ago
A Framework for High Assurance Security of Distributed Objects
High assurance security is di cult to achieve in distributed computer systems and databases because of their complexity, non-determinism and inherent heterogeneity. The practical ...
John Hale, Jody Threet, Sujeet Shenoi