Sciweavers

1147 search results - page 192 / 230
» Termination in language-based systems
Sort
View
PLILP
1993
Springer
14 years 2 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
CAV
2006
Springer
86views Hardware» more  CAV 2006»
14 years 1 months ago
The Power of Hybrid Acceleration
This paper addresses the problem of computing symbolically the set of reachable configurations of a linear hybrid automaton. A solution proposed in earlier work consists in explori...
Bernard Boigelot, Frédéric Herbretea...
CEAS
2006
Springer
14 years 1 months ago
Using E-Mail Social Network Analysis for Detecting Unauthorized Accounts
In this paper we detail the use of e-mail social network analysis for the detection of security policy violations on computer systems. We begin by formalizing basic policies that ...
Adam J. O'Donnell, Walter C. Mankowski, Jeff Abrah...
EUROPAR
2006
Springer
14 years 1 months ago
Toward a Definition of and Linguistic Support for Partial Quiescence
Abstract. The global quiescence of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provi...
Billy Yan-Kit Man, Hiu Ning (Angela) Chan, Andrew ...
ASPDAC
2001
ACM
105views Hardware» more  ASPDAC 2001»
14 years 1 months ago
Toward better wireload models in the presence of obstacles
Wirelength estimation techniques typically contain a site density function that enumerates all possible path sites for each wirelength in an architecture and an occupation probabil...
Chung-Kuan Cheng, Andrew B. Kahng, Bao Liu, Dirk S...