Sciweavers

913 search results - page 43 / 183
» Full Abstraction for Linda
Sort
View
FASE
2000
Springer
14 years 10 days ago
From Play-In Scenarios to Code: An Achievable Dream
g higher levels of abstraction with automated downward transformations has always been the way to go, as long as the engineers who do the actual work are th the abstractions. A dev...
David Harel
EUROSYS
2006
ACM
14 years 5 months ago
Solving the starting problem: device drivers as self-describing artifacts
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
Michael F. Spear, Tom Roeder, Orion Hodson, Galen ...
DAC
2004
ACM
14 years 14 days ago
An SoC design methodology using FPGAs and embedded microprocessors
In System on Chip (SoC) design, growing design complexity has esigners to start designs at higher abstraction levels. This paper proposes an SoC design methodology that makes full...
Nobuyuki Ohba, Kohji Takano
TVLSI
2008
152views more  TVLSI 2008»
13 years 8 months ago
MMV: A Metamodeling Based Microprocessor Validation Environment
With increasing levels of integration of multiple processing cores and new features to support software functionality, recent generations of microprocessors face difficult validati...
Deepak Mathaikutty, Sreekumar V. Kodakara, Ajit Di...
TSE
2010
110views more  TSE 2010»
13 years 7 months ago
Proofs from Tests
We present an algorithm Dash to check if a program P satisfies a safety property ϕ. The unique feature of the algorithm is that it uses only test generation operations, and nes ...
Nels E. Beckman, Aditya V. Nori, Sriram K. Rajaman...