Sciweavers

293 search results - page 34 / 59
» Reasoning About States of Probabilistic Sequential Programs
Sort
View
FPGA
2009
ACM
180views FPGA» more  FPGA 2009»
14 years 2 months ago
Scalable don't-care-based logic optimization and resynthesis
We describe an optimization method for combinational and sequential logic networks, with emphasis on scalability and the scope of optimization. The proposed resynthesis (a) is cap...
Alan Mishchenko, Robert K. Brayton, Jie-Hong Rolan...
POPL
2000
ACM
13 years 11 months ago
Modular Refinement of Hierarchic Reactive Machines
with existing analysis tools. Modular reasoning principles such as abstraction, compositional refinement, and assume-guarantee reasoning are well understood for architectural hiera...
Rajeev Alur, Radu Grosu
FLOPS
2006
Springer
13 years 11 months ago
Convergence in Language Design: A Case of Lightning Striking Four Times in the Same Place
What will a definitive programming language look like? By definitive language I mean a programming language that gives good soat its level of abstraction, allowing computer science...
Peter Van Roy
CACM
2010
121views more  CACM 2010»
13 years 5 months ago
Goldilocks: a race-aware Java runtime
We present Goldilocks, a Java runtime that monitors program executions and throws a DataRaceException when a data race is about to occur. This prevents racy accesses from taking p...
Tayfun Elmas, Shaz Qadeer, Serdar Tasiran
ESOP
2006
Springer
13 years 11 months ago
A Verification Methodology for Model Fields
Model fields are specification-only fields that encode abstractions of the concrete state of a data structure. They allow specifications to describe the behavior of object-oriented...
K. Rustan M. Leino, Peter Müller