Sciweavers

1226 search results - page 106 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
ISCAS
2003
IEEE
135views Hardware» more  ISCAS 2003»
15 years 8 months ago
Formal verification of LTL formulas for SystemC designs
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...
Daniel Große, Rolf Drechsler
239
Voted
POPL
2004
ACM
16 years 3 months ago
Symbolic transfer function-based approaches to certified compilation
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
Xavier Rival
CAV
2009
Springer
209views Hardware» more  CAV 2009»
16 years 4 months ago
Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamari...
162
Voted
PLDI
2006
ACM
15 years 9 months ago
Correctness-preserving derivation of concurrent garbage collection algorithms
Constructing correct concurrent garbage collection algorithms is notoriously hard. Numerous such algorithms have been proposed, implemented, and deployed – and yet the relations...
Martin T. Vechev, Eran Yahav, David F. Bacon
145
Voted
CORR
2010
Springer
97views Education» more  CORR 2010»
15 years 3 months ago
Continuation-Passing C, compiling threads to events through continuations
Abstract In this paper, we introduce Continuation Passing C (CPC), a programming language for concurrent systems in which native and cooperative threads are unified and presented t...
Gabriel Kerneis, Juliusz Chroboczek