Sciweavers

3221 search results - page 13 / 645
» Termination of Linear Programs
Sort
View
ICLP
2007
Springer
14 years 1 months ago
Declarative Diagnosis of Temporal Concurrent Constraint Programs
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
Moreno Falaschi, Carlos Olarte, Catuscia Palamides...
EMSOFT
2005
Springer
14 years 1 months ago
A structural approach to quasi-static schedulability analysis of communicating concurrent programs
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
Cong Liu, Alex Kondratyev, Yosinori Watanabe, Albe...
ICLP
1997
Springer
13 years 12 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
INTEGRATION
2008
101views more  INTEGRATION 2008»
13 years 7 months ago
An efficient terminal and model order reduction algorithm
The paper proposes an efficient terminal and model order reduction method for compact modeling of interconnect circuits with many terminals. The new method is inspired by the rece...
Pu Liu, Sheldon X.-D. Tan, Boyuan Yan, Bruce McGau...
POPL
2001
ACM
14 years 8 months ago
The size-change principle for program termination
Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram