Sciweavers

4397 search results - page 358 / 880
» Relational Algebra Operations
Sort
View
CADE
1998
Springer
15 years 9 months ago
Admissibility of Fixpoint Induction over Partial Types
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
Karl Crary
169
Voted
IFL
1998
Springer
139views Formal Methods» more  IFL 1998»
15 years 9 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
TAPSOFT
1997
Springer
15 years 9 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
126
Voted
ECOOP
2007
Springer
15 years 9 months ago
Tracking Linear and Affine Resources with Java(X)
Java(X) is a framework for type refinement. It extends Java's type language with annotations drawn from an algebra X and structural subtyping in terms of the annotations. Each...
Markus Degen, Peter Thiemann, Stefan Wehr
FSEN
2009
Springer
15 years 9 months ago
Specification and Validation of Behavioural Protocols in the rCOS Modeler
The rCOS modeler implements the requirements modelling phase of a model driven component-based software engineering process. Components are specified in rCOS, a relational calculus...
Zhenbang Chen, Charles Morisset, Volker Stolz