Sciweavers

2203 search results - page 150 / 441
» Temporal Abstract Interpretation
Sort
View
118
Voted
FMCO
2003
Springer
123views Formal Methods» more  FMCO 2003»
15 years 9 months ago
Machine Function Based Control Code Algebras
Abstract. Machine functions have been introduced by Earley and Sturgis in [6] in order to provide a mathematical foundation of the use of the T-diagrams proposed by Bratman in [5]....
Jan A. Bergstra
120
Voted
FSTTCS
2006
Springer
15 years 7 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
115
Voted
APLAS
2005
ACM
15 years 5 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
127
Voted
USENIX
1990
15 years 4 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
135
Voted
ENDM
2010
86views more  ENDM 2010»
15 years 3 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...