Sciweavers

2012 search results - page 251 / 403
» CORAL - Control, Relations and Logic
Sort
View
PEPM
1993
ACM
15 years 10 months ago
The Correctness of an Optimized Code Generation
For a functional programming language with a lazy standard semantics, we define a strictness analysis by means of abstract interpretation. Using the information from the strictne...
Torben Poort Lange
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
15 years 10 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz
CAV
2006
Springer
143views Hardware» more  CAV 2006»
15 years 10 months ago
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
Josh Berdine, Byron Cook, Dino Distefano, Peter W....
DEXA
2006
Springer
95views Database» more  DEXA 2006»
15 years 10 months ago
On the Completion of Workflows
Abstract. Workflow Management Systems (WFMS) coordinate execution of logically related multiple tasks in an organization. A workflow schema is defined using a set of tasks that are...
Tai Xin, Indrakshi Ray, Parvathi Chundi, Sopak Cha...
ECOOP
1995
Springer
15 years 10 months ago
Interface-Based Protocol Specification of Open Systems using PSL
PSL is a framework for describing dynamic and architectural properties of open systems. PSL extends established interface-based tactics for describing the functional properties of...
Doug Lea, Jos Marlowe