Sciweavers

878 search results - page 88 / 176
» Interacting Abstract State Machines
Sort
View
POPL
2006
ACM
16 years 4 months ago
Frame rules from answer types for code pointers
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...
Hayo Thielecke
IPPS
2002
IEEE
15 years 8 months ago
Fault-Tolerance in the Network Storage Stack
This paper addresses the issue of fault-tolerance in applications that make use of network storage. A network abstraction called the Network Storage Stack is presented, along with...
Scott Atchley, Stephen Soltesz, James S. Plank, Mi...
134
Voted
ICALP
1994
Springer
15 years 8 months ago
On some Relations between Dynamical Systems and Transition Systems
Abstract. In this paper we de ne a precise notion of abstraction relation between continuous dynamical systems and discrete state-transition systems. Our main result states that ev...
Eugene Asarin, Oded Maler
FDL
2008
IEEE
15 years 5 months ago
Scenario-based Validation of Embedded Systems
This paper describes a scenario-based methodology em-level design validation based on the Abstract State Machines formal method. This scenario-based approach complements an existi...
Angelo Gargantini, Elvinia Riccobene, Patrizia Sca...
ENTCS
2007
91views more  ENTCS 2007»
15 years 3 months ago
Rule-Based Operational Semantics for an Imperative Language
Operational semantics for programming languages usually come in two flavours: big-step and small-step. Both are defined using deduction rules with a congruence rule allowing redu...
Florent Kirchner, François-Régis Sin...