Sciweavers

383 search results - page 44 / 77
» Abstracting Complex Languages through Transformation and Com...
Sort
View
TNN
1998
125views more  TNN 1998»
15 years 1 months ago
Symbolic connectionism in natural language disambiguation
Abstract—Natural language understanding involves the simultaneous consideration of a large number of different sources of information. Traditional methods employed in language an...
Samuel W. K. Chan, James Franklin
FDL
2007
IEEE
15 years 5 months ago
Transactor-based Formal Verification of Real-time Embedded Systems
With the increasing complexity of today's embedded systems, there is a need to formally verify such designs at mixed abstraction levels. This is needed if some compoe describ...
Daniel Karlsson, Petru Eles, Zebo Peng
PLDI
2012
ACM
13 years 3 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
COORDINATION
2005
Springer
15 years 7 months ago
Synchronized Hyperedge Replacement for Heterogeneous Systems
Abstract. We present a framework for modelling heterogeneous distributed systems using graph transformations in the Synchronized Hyperedge Replacement approach, which describes com...
Ivan Lanese, Emilio Tuosto
JSW
2006
82views more  JSW 2006»
15 years 1 months ago
Incremental Implementation of Syntax Driven Logics
Abstract-- This paper describes a technique combining higher order functions, algebraic datatypes, and monads to incrementally implement syntax driven logics. Extensions can be com...
Ignatius Sri Wishnu Brata Prasetya, A. Azurat, Tan...