1204 search results - page 95 / 241 » Termination of Polynomial Programs |
89
Voted
ISSRE
2007
IEEE
15 years 2 months ago
2007
IEEE
Enterprise systems must guarantee high availability and reliability to provide 24/7 services without interruptions and failures. Mechanisms for handling exceptional cases and impl...
117
Voted
AUTOMATICA
2007
15 years 24 days ago
2007
This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete...
192
Voted
POPL
2006
ACM
16 years 1 months ago
2006
ACM
This paper specifies, via a Hoare-like logic, an interprocedural and flow sensitive (but termination insensitive) information flow analysis for object-oriented programs. Pointer a...
103
click to vote
ICLP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
118
click to vote
EMSOFT
2005
Springer
15 years 6 months ago
2005
Springer
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...