Sciweavers

126 search results - page 11 / 26
» Definitional Trees
Sort
View
SIGCSE
2009
ACM
137views Education» more  SIGCSE 2009»
16 years 9 days ago
The hidden injuries of overloading 'ADT'
commonly stated definition of abstract data type (ADT) is that it is a domain of values and the operations over that domain. So, for example, a language's built-in types, lik...
Duane Buck, David J. Stucki
ICFP
2007
ACM
15 years 11 months ago
Inductive reasoning about effectful data types
We present a pair of reasoning principles, definition and proof by rigid induction, which can be seen as proper generalizations of lazy-datatype induction to monadic effects other...
Andrzej Filinski, Kristian Støvring
APN
2003
Springer
15 years 5 months ago
Deciding Life-Cycle Inheritance on Petri Nets
One of the key issues of object-oriented modeling is inheritance. It allows for the definition of a subclass that inherits features from some superclass. When considering the dynam...
H. M. W. (Eric) Verbeek, Twan Basten
DAC
1999
ACM
15 years 4 months ago
ENOR: Model Order Reduction of RLC Circuits Using Nodal Equations for Efficient Factorization
ENOR is an innovative way to produce provablypassive, reciprocal, and compact representations of RLC circuits. Beginning with the nodal equations, ENOR formulates recurrence relat...
Bernard N. Sheehan
DBSEC
2006
144views Database» more  DBSEC 2006»
15 years 1 months ago
Policy Classes and Query Rewriting Algorithm for XML Security Views
Most state-of-the-art approaches of securing XML documents are based on a partial annotation of an XML tree with security labels which are later propagated to unlabeled nodes of th...
Nataliya Rassadko