Sciweavers

217 search results - page 34 / 44
» Circuit Complexity of Regular Languages
Sort
View
DAC
2006
ACM
14 years 1 months ago
SystemC transaction level models and RTL verification
This paper describes how systems companies are adopting SystemC transaction level models for system on chip design and verification, and how these transaction level models are bei...
Stuart Swan
ISCAS
2003
IEEE
135views Hardware» more  ISCAS 2003»
14 years 23 days ago
Formal verification of LTL formulas for SystemC designs
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...
Daniel Große, Rolf Drechsler
SCAM
2008
IEEE
14 years 1 months ago
From Indentation Shapes to Code Structures
In a previous study, we showed that indentation was regular across multiple languages and the variance in the level of indentation of a block of revised code is correlated with me...
Abram Hindle, Michael W. Godfrey, Richard C. Holt
ECOOP
2010
Springer
14 years 9 days ago
Essential AOP: The A Calculus
Abstract. Aspect-oriented programming (AOP) has produced interesting language designs, but also ad hoc semantics that needs clarification. We contribute to this clarification wit...
Bruno De Fraine, Erik Ernst, Mario Südholt
BMCBI
2011
13 years 2 months ago
Hierarchical graphs for rule-based modeling of biochemical systems
Background: In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state...
Nathan W. Lemons, Bin Hu, William S. Hlavacek