Sciweavers

911 search results - page 36 / 183
» Combining programs and state machines
Sort
View
VL
2002
IEEE
144views Visual Languages» more  VL 2002»
14 years 1 months ago
Interactive Visualization of Java Programs
The design and implementation of a novel visual interactive execution environment for Java is described. This system displays both the run-time object structure as well as the int...
Paul V. Gestwicki, Bharat Jayaraman
ACMMSP
2004
ACM
92views Hardware» more  ACMMSP 2004»
14 years 2 months ago
Instruction combining for coalescing memory accesses using global code motion
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatan...
ZUM
2000
Springer
107views Formal Methods» more  ZUM 2000»
14 years 7 days ago
How to Drive a B Machine
The B-Method is a state-based formal method that describes behaviour in terms of MACHINES whose states change under OPERATIONS. The process algebra CSP is an event-based formalism ...
Helen Treharne, Steve Schneider
TPHOL
2007
IEEE
14 years 2 months ago
Operational Reasoning for Concurrent Caml Programs and Weak Memory Models
This paper concerns the formal semantics of programming languages, and the specification and verification of software. We are interested in the verification of real programs, wr...
Tom Ridge
SAC
2005
ACM
14 years 2 months ago
Selective method combination in mixin-based composition
A mixin is a reusable module that provides uniform extend modifications to classes. It is an abstract subclass that is composable with a variety of superclasses. In mixinbased co...
Tetsuo Kamina, Tetsuo Tamai