Sciweavers

507 search results - page 17 / 102
» Counterexample-Guided Abstraction Refinement
Sort
View
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 11 months ago
Calculating modules in contextual logic program refinement
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
Robert Colvin, Ian J. Hayes, Paul A. Strooper
CONCUR
2007
Springer
14 years 2 months ago
On Modal Refinement and Consistency
Abstract. Almost 20 years after the original conception, we revisit several fundamental questions about modal transition systems. First, we demonstrate the incompleteness of the st...
Kim Guldstrand Larsen, Ulrik Nyman, Andrzej Wasows...
ENTCS
2008
79views more  ENTCS 2008»
13 years 11 months ago
Experimenting Formal Proofs of Petri Nets Refinements
Petri nets are a formalism for modelling and validating critical systems. Generally, the approach to specification starts from an abstract view of the system under study. Once val...
Christine Choppy, Micaela Mayero, Laure Petrucci
CAV
2008
Springer
110views Hardware» more  CAV 2008»
14 years 27 days ago
Probabilistic CEGAR
Counterexample-guided abstraction refinement (CEGAR) has been en vogue for the automatic verification of very large systems in the past years. When trying to apply CEGAR to the ver...
Holger Hermanns, Björn Wachter, Lijun Zhang
BIRTHDAY
2006
Springer
14 years 2 months ago
Composition by Colimit and Formal Software Development
Abstract. Goguen emphasized long ago that colimits are how to compose systems [7]. This paper corroborates and elaborates Goguen's vision by presenting a variety of situations...
Douglas R. Smith