Sciweavers

1613 search results - page 248 / 323
» Functional and Constraint Logic Programming
Sort
View
CADE
2007
Springer
14 years 9 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
14 years 2 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto
ICLP
1999
Springer
14 years 1 months ago
CLAIRE: Combining Sets, Search, and Rules to Better Express Algorithms
This paper presents a programming language that includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (funct...
Yves Caseau, François-Xavier Josset, Fran&c...
ICCAD
2005
IEEE
93views Hardware» more  ICCAD 2005»
14 years 5 months ago
Eliminating wire crossings for molecular quantum-dot cellular automata implementation
— When exploring computing elements made from technologies other than CMOS, it is imperative to investigate the effects of physical implementation constraints. This paper focuses...
Amitabh Chaudhary, Danny Z. Chen, Kevin Whitton, M...
AINA
2009
IEEE
14 years 3 months ago
A New Approach to Model Web Services' Behaviors Based on Synchronization
This paper introduces a novel approach for modelling and specifying behaviors of Web services. This approach excludes Web services from any composition scenario and sheds the ligh...
Zakaria Maamar, Quan Z. Sheng, Hamdi Yahyaoui, Jam...