Sciweavers

1023 search results - page 84 / 205
» A Formal Method for Program Slicing
Sort
View
99
Voted
SAS
2010
Springer
134views Formal Methods» more  SAS 2010»
14 years 12 months ago
Strictness Meets Data Flow
Abstract. Properties of programs can be formulated using various techdataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness...
Tom Schrijvers, Alan Mycroft
SAS
2012
Springer
208views Formal Methods» more  SAS 2012»
13 years 4 months ago
Finding Non-terminating Executions in Distributed Asynchronous Programs
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
Michael Emmi, Akash Lal
QSIC
2003
IEEE
15 years 6 months ago
A Note on Test Oracles and Semantics of Algebraic Specifications
Algebraic testing is an automated software testing method based on algebraic formal specifications. It tests if a program correctly implements an algebraic specification by checki...
Hong Zhu
SAS
2007
Springer
108views Formal Methods» more  SAS 2007»
15 years 7 months ago
Programming Language Design and Analysis Motivated by Hardware Evolution
Abstract. Silicon chip design has passed a threshold whereby exponentially increasing transistor density (Moore’s Law) no longer translates into increased processing power for si...
Alan Mycroft
IFM
2009
Springer
107views Formal Methods» more  IFM 2009»
15 years 8 months ago
Incremental Reasoning for Multiple Inheritance
Object-orientation supports code reuse and incremental programming. Multiple inheritance increases the power of code reuse, but complicates the binding of method calls and thereby ...
Johan Dovland, Einar Broch Johnsen, Olaf Owe, Mart...