Sciweavers

1914 search results - page 118 / 383
» Abstract lambda-Calculus Machines
Sort
View
ISQED
2010
IEEE
126views Hardware» more  ISQED 2010»
13 years 10 months ago
Modeling and verification of industrial flash memories
We present a method to abstract, formalize, and verify industrial flash memory implementations. Flash memories contain specialized transistors, e.g., floating gate and split gate d...
Sandip Ray, Jayanta Bhadra, Thomas Portlock, Ronal...
KI
2007
Springer
14 years 2 months ago
Relational Exploration - Reconciling Plato and Aristotle
Abstract. We provide an interactive method for knowledge acquisition combining approaches from description logic and formal concept analysis. Based on present data, hypothetical ru...
Sebastian Rudolph
ASM
2000
ASM
14 years 21 days ago
An ASM Dynamic Semantics for Standard ML
Abstract. The Abstract State Machines (ASM) methodology is a methodology for formally specifying computing systems. We use the ASM methodology to give the dynamic semantics of the ...
Steven C. Cater, James K. Huggins
ICPP
1993
IEEE
14 years 15 days ago
Data-Parallel R-Tree Algorithms
Abstract Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data e.g., Bureau of the Census TIGER Line les....
Erik G. Hoel, Hanan Samet
ERSHOV
2006
Springer
14 years 1 days ago
An ASM Semantics of Token Flow in UML 2 Activity Diagrams
Abstract. The token flow semantics of UML 2 activity diagrams is formally defined using Abstract State Machines. Interruptible activity regions and multiplicity bounds for pins are...
Stefan Sarstedt, Walter Guttmann