Sciweavers

1147 search results - page 153 / 230
» Termination in language-based systems
Sort
View
120
Voted
SAS
2004
Springer
136views Formal Methods» more  SAS 2004»
15 years 6 months ago
Constraint-Based Linear-Relations Analysis
Abstract. Linear-relations analysis of transition systems discovers linear invariant relationships among the variables of the system. These relationships help establish important s...
Sriram Sankaranarayanan, Henny B. Sipma, Zohar Man...
107
Voted
IFL
2003
Springer
144views Formal Methods» more  IFL 2003»
15 years 5 months ago
Building an Interface Between Eden and Maple: A Way of Parallelizing Computer Algebra Algorithms
Eden is a parallel functional language extending Haskell with processes. This paper describes the implementation of an interface between the Eden language and the Maple system. The...
Rafael Martínez, Ricardo Pena
CCGRID
2009
IEEE
15 years 5 months ago
Dynamic Provisioning of Virtual Organization Clusters
Virtual Organization Clusters are systems comprised of virtual machines that provide dedicated computing clusters for each individual Virtual Organization. The design of these clu...
Michael A. Murphy, Brandon Kagey, Michael Fenn, Se...
ECOOP
2006
Springer
15 years 4 months ago
codeQuest:  Scalable Source Code Queries with Datalog
Abstract. Source code querying tools allow programmers to explore relations between different parts of the code base. This paper describes such a tool, named CodeQuest. It combines...
Elnar Hajiyev, Mathieu Verbaere, Oege de Moor
EMSOFT
2006
Springer
15 years 4 months ago
Efficient distributed deadlock avoidance with liveness guarantees
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...
César Sánchez, Henny B. Sipma, Zohar...