Sciweavers

184 search results - page 6 / 37
» Arity Raiser and its Use in Program Specialization
Sort
View
ISPAN
2002
IEEE
14 years 25 days ago
Building Ontology for Optimization and Composition of Parallel JavaBean Programs
Abstract— In this paper, we propose an ontology specification for JavaBean programs, the object component model of Java. Our specification is written using the DAML+OIL languag...
Cheng-Wei Chen, Chung-Kai Chen, Jenq Kuen Lee
IFL
2004
Springer
131views Formal Methods» more  IFL 2004»
14 years 1 months ago
Exploiting Single-Assignment Properties to Optimize Message-Passing Programs by Code Transformations
The message-passing paradigm is now widely accepted and used mainly for inter-process communication in distributed memory parallel systems. However, one of its disadvantages is the...
Alfredo Cristóbal-Salas, Andrey Chernykh, E...
TABLEAUX
2005
Springer
14 years 1 months ago
A Calculus for Type Predicates and Type Coercion
We extend classical first-order logic with subtyping by type predicates and type coercion. Type predicates assert that the value of a term belongs to a more special type than the ...
Martin Giese
LMCS
2007
132views more  LMCS 2007»
13 years 7 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
STOC
2006
ACM
83views Algorithms» more  STOC 2006»
14 years 8 months ago
A randomized polynomial-time simplex algorithm for linear programming
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
Jonathan A. Kelner, Daniel A. Spielman