Sciweavers

143 search results - page 20 / 29
» On Some Differences Between Semantics of Logic Program Updat...
Sort
View
ICFP
2007
ACM
15 years 9 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
PASTE
2010
ACM
14 years 11 months ago
Null dereference analysis in practice
Many analysis techniques have been proposed to determine when a potentially null value may be dereferenced. But we have observed in practice that not every potential null derefere...
Nathaniel Ayewah, William Pugh
ECOOP
2006
Springer
15 years 1 months ago
Automated Detection of Refactorings in Evolving Components
Abstract. One of the costs of reusing software components is updating applications to use the new version of the components. Updating an application can be error-prone, tedious, an...
Danny Dig, Can Comertoglu, Darko Marinov, Ralph E....
LPNMR
1990
Springer
15 years 1 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
SIGSOFT
2005
ACM
15 years 10 months ago
Fluent temporal logic for discrete-time event-based models
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
Emmanuel Letier, Jeff Kramer, Jeff Magee, Sebasti&...