Sciweavers

2696 search results - page 235 / 540
» Semantic Abstraction and Anaphora
Sort
View
DATE
2010
IEEE
146views Hardware» more  DATE 2010»
15 years 6 months ago
Automatic pipelining from transactional datapath specifications
Abstract—We present a transactional datapath specification (Tspec) and the tool (T-piper) to synthesize automatically an inpelined implementation from it. T-spec abstractly views...
Eriko Nurvitadhi, James C. Hoe, Timothy Kam, Shih-...
JLP
2011
106views more  JLP 2011»
14 years 9 months ago
Concurrent Kleene Algebra and its Foundations
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
Tony Hoare, Bernhard Möller, Georg Struth, Ia...
FMICS
2007
Springer
16 years 24 days ago
An Approach to Formalization and Analysis of Message Passing Libraries
Message passing using libraries implementing the Message Passing Interface (MPI) standard is the dominant communication mechanism in high performance computing (HPC) applications. ...
Robert Palmer, Michael Delisi, Ganesh Gopalakrishn...
ECOOP
2005
Springer
16 years 4 days ago
Expressive Pointcuts for Increased Modularity
Abstract. In aspect-oriented programming, pointcuts are used to describe crossstructure. Pointcuts that abstract over irrelevant implementation details are clearly desired to bette...
Klaus Ostermann, Mira Mezini, Christoph Bockisch
TACAS
2005
Springer
106views Algorithms» more  TACAS 2005»
16 years 3 days ago
Dependent Types for Program Understanding
Abstract. Weakly-typed languages such as Cobol often force programrepresent distinct data abstractions using the same low-level physical type. In this paper, we describe a techniqu...
Raghavan Komondoor, Ganesan Ramalingam, Satish Cha...