1111 search results - page 155 / 223 » Program Analysis as Model Checking of Abstract Interpretatio... |
111
Voted
RTSS
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract—We apply automata theory to specifying behavioral interfaces of objects and show how to check schedulability and compatibility of real time asynchronous objects. The beh...
228
Voted
ICLP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
138
Voted
CC
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. This paper presents four extensions to the Interprocedural Finite Distributive Subset (IFDS) algorithm that make it applicable to a wider class of analysis problems. IFDS...
119
Voted
LR
2011
14 years 5 months ago
2011
Abstract We present methods and tools for modeling autonomously controlled production networks and investigation of their stability properties. Production networks are described as...
113
Voted
AMC
2008
15 years 2 months ago
2008
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...