Sciweavers

367 search results - page 63 / 74
» A Rewriting Logic Sampler
Sort
View
HICSS
2005
IEEE
151views Biometrics» more  HICSS 2005»
14 years 1 months ago
Inheritance in the Presence of Asynchronous Method Calls
— This paper considers a formal object-oriented model for distributed computing. Object orientation appears as a leading framework for concurrent and distributed systems. However...
Einar Broch Johnsen, Olaf Owe
CADE
2004
Springer
14 years 1 months ago
Improved Modular Termination Proofs Using Dependency Pairs
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
René Thiemann, Jürgen Giesl, Peter Sch...
FMCO
2004
Springer
120views Formal Methods» more  FMCO 2004»
14 years 1 months ago
A Dynamic Binding Strategy for Multiple Inheritance and Asynchronously Communicating Objects
This paper considers an integration of asynchronous communication, virtual binding, and multiple inheritance. Object orientation is the leading paradigm for concurrent and distribu...
Einar Broch Johnsen, Olaf Owe
OOPSLA
2004
Springer
14 years 1 months ago
C-SAW and genAWeave: a two-level aspect weaving toolsuite
This demonstration will feature overviews of the C-SAW and GenAWeave projects. The first half of the presentation will introduce the concept of two-level aspect weaving, which uni...
Jeffrey G. Gray, Jing Zhang, Suman Roychoudhury, I...
PEPM
2004
ACM
14 years 1 months ago
Proving termination of membership equational programs
Advanced typing, matching, and evaluation strategy features, as well as very general conditional rules, are routinely used in equational programming languages such as, for example...
Francisco Durán, Salvador Lucas, José...