Sciweavers

20126 search results - page 236 / 4026
» Timed Transition Systems
Sort
View
93
Voted
ENTCS
2006
126views more  ENTCS 2006»
15 years 4 months ago
A Congruence Format for Name-passing Calculi
We define and use a SOS-based framework to specify the transition systems of calculi with name-passing properties. This setting uses proof-theoretic tools to take care of some of ...
Axelle Ziegler, Dale Miller, Catuscia Palamidessi
JOT
2006
107views more  JOT 2006»
15 years 4 months ago
Object-Oriented Design Patterns for Detailed Design
This paper discusses the use of design patterns during the transition phase from analysis to design of object-oriented systems. Pattern mining, which is the process of finding and...
W. Al-Ahmad
SPIN
2010
Springer
15 years 2 months ago
Nevertrace Claims for Model Checking
In this paper, we propose the nevertrace claim, which is a new construct for specifying the correctness properties that either finite or infinite execution traces (i.e., sequence...
Zhe Chen, Gilles Motet
RTAS
2003
IEEE
15 years 9 months ago
Modular Code Generation from Hybrid Automata based on Data Dependency
Model-based automatic code generation is a process of converting abstract models into concrete implementations in the form of a program written in a high-level programming languag...
Jesung Kim, Insup Lee
ICCAD
2000
IEEE
119views Hardware» more  ICCAD 2000»
15 years 8 months ago
Synthesis of Operation-Centric Hardware Descriptions
Most hardware description frameworks, whether schematic or textual, use cooperating finite state machines (CFSM) as the underlying abstraction. In the CFSM framework, a designer ...
James C. Hoe, Arvind