1274 search results - page 75 / 255 » New Proofs for |
114
Voted
CORR
2007
Springer
15 years 19 days ago
2007
Springer
A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in pro...
109
Voted
CASCON
2010
14 years 10 months ago
2010
We describe research conducted to improve the design and management of notifications in the Jazz collaborative development environment. Scenario-based design was used in conjuncti...
200
click to vote
POPL
2007
ACM
16 years 29 days ago
2007
ACM
We present an internal language with equivalent expressive power to Standard ML, and discuss its formalization in LF and the machine-checked verification of its type safety in Twe...
123
Voted
ENTCS
2006
15 years 20 days ago
2006
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
110
Voted
ANSS
1991
IEEE
15 years 4 months ago
1991
IEEE
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...