Sciweavers

1864 search results - page 211 / 373
» Formal topology and domains
Sort
View
ICSE
2008
IEEE-ACM
14 years 10 months ago
3rd international workshop on advances and applications of problem frames
Central to the problem frames approach is the distinction of three different descriptions: requirements R, domain assumptions W and specifications S, tied together with the socall...
Thein Than Tun, Jon G. Hall, Lucia Rapanotti, Karl...
TLDI
2009
ACM
142views Formal Methods» more  TLDI 2009»
14 years 7 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»
14 years 7 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...
FOSSACS
2010
Springer
14 years 5 months ago
CIA Structures and the Semantics of Recursion
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
Stefan Milius, Lawrence S. Moss, Daniel Schwencke
FMCAD
2009
Springer
14 years 4 months ago
Scalable conditional equivalence checking: An automated invariant-generation based approach
—Sequential equivalence checking (SEC) technologies, capable of demonstrating the behavioral equivalence of two designs, have grown dramatically in capacity over the past decades...
Jason Baumgartner, Hari Mony, Michael L. Case, Jun...