Sciweavers

4211 search results - page 495 / 843
» A formal approach to MASQ
Sort
View
IFL
1998
Springer
139views Formal Methods» more  IFL 1998»
15 years 11 months ago
Higher Order Demand Propagation
Abstract. In this report a new backward strictness analysis for functional languages is presented. It is called higher order demand propagation and is applicable to a realistic non...
Dirk Pape
WER
1998
Springer
15 years 11 months ago
Towards Requirements Engineering of Active Database Systems
Active systems are emerging in many fields, being particularly interesting those like Active Database Management Systems which always provide some kind of reactive capabilities. I...
José Hilario Canós Cerdá, Jav...
COMPGEOM
1997
ACM
15 years 11 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...
TAPSOFT
1997
Springer
15 years 11 months ago
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
Danièle Beauquier, Anatol Slissenko
TYPES
1994
Springer
15 years 11 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