Sciweavers

624 search results - page 48 / 125
» The Complexity of Type Analysis of Object Oriented Programs
Sort
View
ORDER
2010
110views more  ORDER 2010»
13 years 6 months ago
The Complexity of Embedding Orders into Small Products of Chains
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
Olivier Raynaud, Eric Thierry
SCP
2002
119views more  SCP 2002»
13 years 7 months ago
Polymorphic subtyping in O'Haskell
O'Haskell is a programming language derived from Haskell by the addition of concurrent reactive objects and subtyping. Because Haskell already encompasses an advanced type sy...
Johan Nordlander
FM
2011
Springer
357views Formal Methods» more  FM 2011»
12 years 11 months ago
TraceContract: A Scala DSL for Trace Analysis
Abstract. In this paper we describe TRACECONTRACT, an API for trace analysis, implemented in the SCALA programming language. We argue that for certain forms of trace analysis the b...
Howard Barringer, Klaus Havelund
FM
2009
Springer
92views Formal Methods» more  FM 2009»
14 years 2 months ago
Field-Sensitive Value Analysis by Field-Insensitive Analysis
Shared and mutable data-structures pose major problems in static analysis and most analyzers are unable to keep track of the values of numeric variables stored in the heap. In this...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
SOFTVIS
2010
ACM
13 years 8 months ago
Heapviz: interactive heap visualization for program understanding and debugging
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
Edward Aftandilian, Sean Kelley, Connor Gramazio, ...