Sciweavers

32 search results - page 6 / 7
» Automated Assume-Guarantee Reasoning by Abstraction Refineme...
Sort
View
ENTCS
2008
140views more  ENTCS 2008»
13 years 5 months ago
Linking Event-B and Concurrent Object-Oriented Programs
The Event-B method is a formal approach to modelling systems, using refinement. Initial specification is a high level of abstraction; detail is added in refinement steps as the de...
Andrew Edmunds, Michael Butler
CADE
2002
Springer
14 years 6 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
OWLED
2008
13 years 7 months ago
The OWL in the CASL - Designing Ontologies Across Logics
Abstract. In this paper, we show how the web ontology language OWL can be accommodated within the larger framework of the heterogeneous common algebraic specification language HETC...
Oliver Kutz, Dominik Lücke, Till Mossakowski,...
CSL
2010
Springer
13 years 6 months ago
Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries
Abstract. We present a symbolic framework, based on a modular operational semantics, for formalizing different notions of compromise relevant for the analysis of cryptographic prot...
David A. Basin, Cas J. F. Cremers
POPL
2008
ACM
14 years 6 months ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan