Sciweavers

3333 search results - page 396 / 667
» Abstract Proof Search
Sort
View
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
15 years 6 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
SOCO
2008
Springer
15 years 6 months ago
Interface Composition for Web Service Intermediaries
Abstract. The use of XML as a format for message exchange makes Web services well suited for composition of heterogeneous components. However, since clients must manage differences...
Sara Forghanizadeh, Eric Wohlstadter
149
Voted
ISCI
2007
135views more  ISCI 2007»
15 years 6 months ago
Generalising the array split obfuscation
An obfuscation is a behaviour-preserving program transformation whose aim is to make a program “harder to understand”. Obfuscations are mainly applied to make reverse engineer...
Stephen Drape
TFS
2008
93views more  TFS 2008»
15 years 6 months ago
Using Fuzzy Logic to Design Separation Function in Flocking Algorithms
Abstract--Flocking algorithms essentially consist of three components: alignment, cohesion, and separation. To track a desired trajectory, the flock center should move along the de...
Dongbing Gu, Huosheng Hu
LOGCOM
2007
97views more  LOGCOM 2007»
15 years 6 months ago
Termination for Hybrid Tableaus
Abstract. This article extends and improves work on tableau-based decision methods for hybrid logic by Bolander and Bra¨uner [5]. Their paper gives tableau-based decision procedur...
Thomas Bolander, Patrick Blackburn