Sciweavers

378 search results - page 62 / 76
» Formalizing Spider Diagrams
Sort
View
FM
2001
Springer
108views Formal Methods» more  FM 2001»
15 years 9 months ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer
KBSE
2000
IEEE
15 years 9 months ago
New Visual Interface for Engineering Use Case Models
This paper describes a new approach to visualization of scenarios within the use case-based engineering of functional requirements – the so-called Video Camera metaphor. The Vid...
Nikolai Mansurov, Dmitri Vasura
COMPGEOM
1997
ACM
15 years 9 months ago
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
Giuseppe Liotta, Franco P. Preparata, Roberto Tama...
TYPES
1994
Springer
15 years 8 months ago
A Concrete Final Coalgebra Theorem for ZF Set Theory
A special final coalgebra theorem, in the style of Aczel's [2], is proved within standard Zermelo-Fraenkel set theory. Aczel's AntiFoundation Axiom is replaced by a varia...
Lawrence C. Paulson
AGTIVE
2007
Springer
15 years 8 months ago
Domain Specific Languages with Graphical and Textual Views
We show our approach for the definition of Domain Specific Languages integrating both graphical and textual views. The approach is based on the meta-modelling concepts provided by ...
Francisco Pérez Andrés, Juan de Lara...