Sciweavers

1137 search results - page 25 / 228
» Partial Program Admission
Sort
View
99
Voted
ESOP
2009
Springer
15 years 8 months ago
Global Principal Typing in Partially Commutative Asynchronous Sessions
We generalise a theory of multiparty session types for the π-calculus through asynchronous communication subtyping, which allows partial commutativity of actions with maximal fle...
Dimitris Mostrous, Nobuko Yoshida, Kohei Honda
131
Voted
PEPM
1994
ACM
15 years 5 months ago
Dictionary-Free Overloading by Partial Evaluation
One of the most novel features in the functional programming language Haskell is the system of type classes used to support a combination of overloading and polymorphism. Current ...
Mark P. Jones
110
Voted
PLDI
1995
ACM
15 years 4 months ago
Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation
Partial Redundancy Elimination PRE is a general scheme for suppressing partial redundancies which encompasses traditional optimizations like loop invariant code motion and redun...
Gagan Agrawal, Joel H. Saltz, Raja Das
124
Voted
CC
2004
Springer
177views System Software» more  CC 2004»
15 years 6 months ago
Value-Based Partial Redundancy Elimination
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...
Thomas VanDrunen, Antony L. Hosking
114
Voted
APN
2001
Springer
15 years 4 months ago
Partial Order Verification of Programmable Logic Controllers
We address the verification of programmable logic controllers (PLC). In our approach, a PLC program is translated into a special type of colored Petri net, a so-called register net...
Peter Deussen