Sciweavers

1689 search results - page 120 / 338
» Refining abstract interpretations
Sort
View
FSTTCS
2006
Springer
15 years 8 months ago
Game Semantics for Higher-Order Concurrency
Abstract. We describe a denotational (game) semantics for a call-byvalue functional language with multiple threads of control, which may communicate values of general type on local...
James Laird
APLAS
2005
ACM
15 years 6 months ago
Loop Invariants on Demand
This paper describes a sound technique that combines the precision em proving with the loop-invariant inference of abstract interpretation. The loop-invariant computations are invo...
K. Rustan M. Leino, Francesco Logozzo
132
Voted
USENIX
1990
15 years 5 months ago
The Evolution of Dbx
Dbx is the standard source-level debugger on most Unix1 workstations. Over the past six years Dbx has grown from a debugger for interpreted Pascal programs to a debugger for compi...
Mark A. Linton
ENDM
2010
86views more  ENDM 2010»
15 years 4 months ago
Mathematical programming based debugging
Verifying that a piece of software has no bugs means proving that it has certain desired properties, such as an array index not taking values outside certain Abstract interpretati...
Leo Liberti, Stéphane Le Roux, Jeremy Lecon...
ENTCS
2006
142views more  ENTCS 2006»
15 years 4 months ago
The Rewriting Logic Semantics Project
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding th...
José Meseguer, Grigore Rosu