Sciweavers

923 search results - page 100 / 185
» Proving the value of formal methods
Sort
View
TLDI
2009
ACM
142views Formal Methods» more  TLDI 2009»
16 years 3 months ago
Static extraction of sound hierarchical runtime object graphs
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
Marwan Abi-Antoun, Jonathan Aldrich
TLDI
2009
ACM
169views Formal Methods» more  TLDI 2009»
16 years 3 months ago
Relational parametricity for references and recursive types
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Lars Birkedal, Kristian Støvring, Jacob Tha...
FMCAD
2009
Springer
16 years 23 days ago
Retiming and resynthesis with sweep are complete for sequential transformation
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...
Hai Zhou
FMCO
2007
Springer
16 years 11 days ago
Universe Types for Topology and Encapsulation
The Universe Type System is an ownership type system for object-oriented programming languages that hierarchically structures the object store; it is used to reason modularly about...
Dave Cunningham, Werner Dietl, Sophia Drossopoulou...
FMCO
2007
Springer
103views Formal Methods» more  FMCO 2007»
16 years 11 days ago
Safety Guarantees from Explicit Resource Management
We present a language and a program analysis that certifies the safe use of flexible resource management idioms, in particular advance reservation or “block booking” of costl...
David Aspinall, Patrick Maier, Ian Stark