681 search results - page 16 / 137 » A Logic for True Concurrency |
105
click to vote
ESOP
2010
Springer
15 years 7 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
CONCUR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
75
Voted
ICCAD
1999
IEEE
15 years 1 months ago
1999
IEEE
: In this paper, an algorithm for simultaneous logic restructuring and placement is presented. This algorithm first constructs a set of super-cells along the critical paths and the...
73
Voted
FOSSACS
2009
Springer
15 years 4 months ago
2009
Springer
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
