507 search results - page 43 / 102 » Counterexample-Guided Abstraction Refinement |
ATVA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We define a probabilistic contract framework for the construction of component-based embedded systems, based on the theory of Interactive Markov Chains. A contract specif...
EJC
2006
13 years 10 months ago
2006
Abstract. A leaf of a plane tree is called an old leaf if it is the leftmost child of its parent, and it is called a young leaf otherwise. In this paper we enumerate plane trees wi...
CAISE
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. The development of critical systems requires a high assurance process from requirements to the running code. Formal methods, such as B, now provide industry-strength tool...
IJCIS
2007
13 years 10 months ago
2007
by allowing designers to model their systems at different abstraction levels, providing them omatic model transformations to incrementally refine abstract models into more concrete...
LICS
1994
IEEE
14 years 2 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...