Sciweavers

303 search results - page 24 / 61
» A formal executable semantics of Verilog
Sort
View
PLDI
2012
ACM
11 years 10 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
SCP
2010
174views more  SCP 2010»
13 years 2 months ago
Aspects of availability: Enforcing timed properties to prevent denial of service
We propose a domain-specific aspect language to prevent denial of service caused by resource management. Our aspects specify availability policies by enforcing time limits in the ...
Pascal Fradet, Stéphane Hong Tuan Ha
RTAS
2007
IEEE
14 years 2 months ago
A Programming Model for Time-Synchronized Distributed Real-Time Systems
Discrete-event (DE) models are formal system specifications that have analyzable deterministic behaviors. Using a global, consistent notion of time, DE components communicate via...
Yang Zhao, Jie Liu, Edward A. Lee
ISOLA
2010
Springer
13 years 6 months ago
WOMM: A Weak Operational Memory Model
Abstract. Memory models of shared memory concurrent programs define the values a read of a shared memory location is allowed to see. Such memory models are typically weaker than t...
Arnab De, Abhik Roychoudhury, Deepak D'Souza
IEEEARES
2009
IEEE
14 years 2 months ago
Algebraic Properties in Alice and Bob Notation
—Alice and Bob notation is a popular way to describe security protocols: it is intuitive, succinct, and yet expressive. Several formal protocol specification languages are based...
Sebastian Mödersheim