Sciweavers

2373 search results - page 31 / 475
» On the Theory of Structural Subtyping
Sort
View
POPL
2007
ACM
15 years 10 months ago
Dynamic heap type inference for program understanding and debugging
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
Ben Liblit, Chloë W. Schulze, Marina Polishch...
SLP
1990
76views more  SLP 1990»
14 years 10 months ago
Partial Evaluation for Hierarchies of Logic Theories
We discuss the impact of Partial Evaluation within the framework of structured logic programming. We define a general scheme for Partial Evaluation to be applied to a wide class o...
Michele Bugliesi, Evelina Lamma, Paola Mello
FASE
2010
Springer
15 years 4 months ago
Proving Consistency and Completeness of Model Classes Using Theory Interpretation
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
Ádám Darvas, Peter Müller
DM
2011
158views Education» more  DM 2011»
14 years 1 months ago
A survey of homogeneous structures
A relational first order structure is homogeneous if it is countable (possibly finite) and every isomorphism between finite substructures extends to an automorphism. This artic...
Dugald Macpherson
99
Voted
SCP
2010
155views more  SCP 2010»
14 years 8 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay