Sciweavers

799 search results - page 20 / 160
» A Logic for Abstract State Machines
Sort
View
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
14 years 9 months ago
Superstate identification for state machines using search-based clustering
State machines are a popular method of representing a syshigh level of abstraction that enables developers to gain an overview of the system they represent and quickly understand ...
Mathew Hall, Phil McMinn, Neil Walkinshaw
DATE
2002
IEEE
86views Hardware» more  DATE 2002»
15 years 2 months ago
A Layered, Codesign Virtual Machine Approach to Modeling Computer Systems
By using a macro/micro state model we show how assumptions on the resolution of logical and physical timing of computation in computer systems has resulted in design methodologies...
JoAnn M. Paul, Donald E. Thomas
TPHOL
2009
IEEE
15 years 4 months ago
Practical Tactics for Separation Logic
Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctne...
Andrew McCreight
MODELS
2009
Springer
15 years 4 months ago
HiLA: High-Level Aspects for UML State Machines
UML state machines are widely used for modeling software behavior. However state-crosscutting behaviors, such as synchronization or execution history dependence, are hard to model...
Gefei Zhang, Matthias M. Hölzl
96
Voted
DAC
1994
ACM
15 years 1 months ago
Exact Minimum Cycle Times for Finite State Machines
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...
William K. C. Lam, Robert K. Brayton, Alberto L. S...